Spring 2025
Class Information
| Item | Section 0180 |
|---|---|
| Schedule | Monday/Wednesday 1:30 - 2:50 PM |
| Location | Zoom. Details on Carmen. |
| Professor | Greg Ryslik / ryslik DOT 1 AT osu DOT edu |
| Professor Office Hours | Fridays (2:20 - 3:40 PM) - via zoom. Contact me ahead of time if you plan to attend. |
| TA | TBD |
| TA Office Hours | Per request. Please reach out over slack/ email. |
| Slack Discussion Group | See the link in Carmen! Say hello! |
All classes will be recorded and posted for you to review online afterwards if you want to listen again.
Some classes may need to be rescheduled earlier or later due to professor travel. They will of course be recorded as well if the new time doesn’t work.
Please enable your camera if at all able. I understand it’s not always possible but it’s very helpful to the me!
Description:
By the end of this course, students should be comfortable using propositional logic, first-order predicate logic, be familiar with basic mathematical proofs such as proof by contradiction and strong and ordinary mathematical induction, be familiar with using asymptotic notation, be able to analyze running time of simple iterative or recursive algorithms, and finally be familiar with basic definitions and algorithms in graph theory.
Grading Plan:
- Midterm 1: 20%
- Midterm 2: 20%
- Final: 35%
- HW: 20%
- Participation/Retrospectives: 5%
There might be tentative bonus points assigned for harder math or cs problems. Max would be at most 3%. At the discretion of the professor :-).
Retrospectives
At the end of each week, I ask you to submit a very short writeup about how the week went. Essentially:
1) What went well
2) What can be improved/did not go so well
3) What did you like learning.
A few sentences is fine here – I just want to keep an eye on how the course is progressing throughout the semester.
Grading Scheme
Grades will follow the standard scale:
A : 93 <= grade <= 100
A-: 90 <= grade < 93
B+: 87 <= grade < 90
B : 83 <= grade < 87
B-: 80 <= grade < 83
C+: 77 <= grade < 80
C : 73 <= grade < 77
C-: 70 <= grade < 73
D+: 67 <= grade < 70
D : 60 <= grade < 67
E : <60
Textbooks:
You might find the following books useful but I won’t assign homework from them.
- Discrete Mathematics and Its Applications, Eighth Edition, By Kenneth Rosen.
- Introduction to Algorithms, Third Edition, by Corman, Leiserson, Rivest and Stein.
Class course
| Class | Wk | Date | Day | Topic | Assign Out | Assign Due | Notes | Video | Related Files & Comments |
|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 6-Jan | Mon | Logic & Proofs |
1. Logic 1 2. Logic 2 3. Proof Methods | Jan 6 | |||
| 2 | 1 | 8-Jan | Wed | Logic & Proofs | HW1 | Jan 8 | |||
| 3 | 2 | 13-Jan | Mon | Logic & Proofs | Jan 13 | ||||
| 4 | 2 | 15-Jan | Wed | Logic & Proofs | HW2 | HW1 | Jan 15 | ||
| 5 | 3 | 20-Jan | Mon | Set Theory | No Class | ||||
| 6 | 3 | 22-Jan | Wed | Set Theory | HW3 | HW2 | Jan 22 | ||
| 7 | 4 | 27-Jan | Mon | Set Theory |
1. Set Theory 1 2. Set Theory 2 | Jan 27 | |||
| 8 | 4 | 29-Jan | Wed | Set Theory | HW4 | HW3 | Jan 29 | ||
| 9 | 5 | 3-Feb | Mon | Review For Exam 1 | Exam Review | Feb 3 | |||
| 10 | 5 | 5-Feb | Wed | Exam1 | |||||
| 11 | 6 | 10-Feb | Mon | Algorithms | HW4 |
1. Algorithms 2. Asymptotic Behavior | Feb 10 | ||
| 12 | 6 | 12-Feb | Wed | Algorithms | Feb 12 | ||||
| 13 | 7 | 17-Feb | Mon | Algorithms | HW5 | Feb 17 | |||
| 14 | 7 | 19-Feb | Wed | Algorithms/Induction | 1. Induction | Feb 19 | |||
| 15 | 8 | 24-Feb | Mon | Induction | Feb 24 | ||||
| 16 | 8 | 26-Feb | Wed | No Class | HW6 | HW5 | |||
| 17 | 9 | 3-Mar | Mon | Induction | Mar 3 | ||||
| 18 | 9 | 5-Mar | Wed | Induction | Mar 5 | ||||
| 19 | 10 | 10-Mar | Mon | No Class | HW7 | ||||
| 20 | 10 | 12-Mar | Wed | No Class | |||||
| 21 | 11 | 17-Mar | Mon | Recursion | HW6 | 1. Recursion | Mar 17 | Master Theorem Notes | |
| 22 | 11 | 19-Mar | Wed | Recursion | HW8 | HW7 | No class. Available at 11 am for questions. | ||
| 23 | 12 | 24-Mar | Mon | Review | Exam Review | Mar 5 | Master Theorem Notes | ||
| 24 | 12 | 26-Mar | Wed | Exam 2 | |||||
| 25 | 13 | 31-Mar | Mon | Graph Theory | HW8 | Mar 31 | |||
| 26 | 13 | 2-Apr | Wed | Graph Theory | 1. Graph Algorithms | April 2 | Eulerian Paths | ||
| 27 | 14 | 7-Apr | Mon | Graph Theory | HW9 | April 7 | |||
| 28 | 14 | 9-Apr | Wed | Graph Theory | April 9 | ||||
| 29 | 15 | 14-Apr | Mon | Graph Theory | HW10 | HW9 | Exam Review | April 14 | |
| 30 | 15 | 16-Apr | Wed | Final Released | |||||
| 31 | 16 | 21-Apr | Mon | No Class | HW 10 |