Discrete Structures for Computer Science: Counting ...

← Back to document page

Discrete Structures for Computer Science: Counting , Recursion, and ProbabilityMichiel SmidSchool of Computer ScienceCarleton UniversityOttawa, 22, 2019ContentsPrefacevii1 Ramsey Theory . . . . . . . . . . . . . . . . . . . . . . . . . . Sperner s Theorem . . . . . . . . . . . . . . . . . . . . . . . . The Quick-Sort Algorithm . . . . . . . . . . . . . . . . . . . .52 Mathematical Basic Concepts . . . . . . . . . . . . . . . . . . . . . . . . . . Proof Techniques.

course COMP 2804 (Discrete Structures II). Students are assumed to have taken COMP 1805 (Discrete Structures I), which covers mathematical rea-soning, basic proof techniques, sets, functions, relations, basic graph theory, asymptotic notation, and countability. During a 12-week term with three hours of classes per week, I cover most

  Course, Structure, Discrete, Discrete structures