Discrete Structures Syllabus
CS 1800 Spring 2018

College of Computer and Information Science
Northeastern University

THIS ISN'T THE CURRENT SEMESTER'S WEBSITE. Click here for the fall 2018 website.

This course introduces the mathematical structures and methods that form the foundation of computer science. The material is motivated by applications from computer science. Students will learn the following:

  1. Techniques: binary and modular arithmetic, set notation, and methods of counting, evaluating sums, solving recurrences.
  2. Supporting Theory: the basics of probability, proof by induction, growth of functions, and analysis techniques.
  3. General problem solving techniques with many applications to real problems.

The main prerequisite for this course is a firm knowledge of high-school algebra. Though CS 2500, Fundamentals of Computer Science 1, is not a pre-requisite for this course, we will refer to topics that are covered in that course.

See the detailed syllabus for a more thorough course overview.
Information about buying the textbook is here.
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: