This course teaches the mathematics necessary for students to be successful in computer science. Topics include: Logic, proofs, sets, relations, functions, intro to algorithms, recursion, theory behind trees/graphs. See the schedule for details.
| Professor | Ian Martiny Office hours: Tues 2:00–3:00, Thurs 2:00–3:00 (CSEL), or by appointment |
| Prerequisites | Programming experience, Data Structures (CSCI 2270) |
| Lectures | Mon./Tues./Wed. 5:00–6:40, FLMG 156 |
| Communication |
We'll use Moodle for general discussion and questions about course material. For administrative issues, email ian.martiny@colorado.edu to contact me. This is a paperless course. Assignments will be distributed here and collected via Moodle. |
| Reference Books |
No textbook is required, but if you would like additional references, I recommend: Discrete Mathematics and Its Applications by Kenneth Rosen Concrete Mathematics: A Foundation for Computer Science by Graham, Knuth, and Patashnik |
| Syllabus | Located here |
| Homework Exercises | 35% | Six homework exercises, individually submitted. |
| Programming Projects | 25% | Two–Three programming projects, individually submitted. |
| Quizzes | 15% | 5 Moodle quizzes around one per week. Timed. |
| Final Exam | 25% | One exam covering all material from the course |