Discrete Structures Syllabus
CS 1800 Fall 2017

College of Computer and Information Science
Northeastern University

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:

  1. Techniques: binary and modular arithmetic, set notation, methods of counting, evaluating sums, solving recurrences, ...;
  2. Supporting Theory: basics of probability, proof by induction, growth of functions, and analysis techniques; and
  3. General problem solving techniques with many applications to real problems.
For more information, see the detailed syllabus.
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 .

        course map

Last Updated: