Select the desired Level or Schedule Type to find available classes for the course. |

CS 1800 - Discrete Structures |

Introduces the mathematical structures and methods that form the foundation of computer science. Studies structures such as sets, tuples, sequences, lists, trees, and graphs. Discusses functions, relations, ordering, and equivalence relations. Examines inductive and recursive definitions of structures and functions. Discusses principles of proof such as truth tables, inductive proof, and basic logic. Also covers the counting techniques and arguments needed to estimate the size of sets, the growth of functions, and the space-time complexity of algorithms.
4.000 Credit hours 4.000 Lecture hours Syllabus Available Levels: Undergraduate Schedule Types: Lecture Computer Science Department Course Attributes: NUpath Formal/Quant Reasoning, NU Core Math/Anly Think Lvl 1, Computer&Info Sci Restrictions: Must be enrolled in one of the following Levels: Undergraduate Corequisites: CS 1802 |

Return to Previous | New Search |