This course introduces the mathematical structures and methods that form the foundation of computer science. The material will be motivated by applications from computer science and will emphasize:
- Techniques: binary and modular arithmetic, set notation, methods of counting, evaluating sums, solving recurrences, ...;
- Supporting Theory: basics of probability, proof by induction, growth of functions, and analysis techniques; and
- General problem solving techniques with many applications to real problems.
For information about grading policies and expectations of students, see the "Policies" tab .
For information about the schedule for assignments and readings, see the "Schedule" tab .