Discrete Structures for Computer Science: Counting, Recursion, and Probability
Author: Michiel Smid
Publisher: Creative Commons Attribution 3.0
Content URL: Link To Content
About Discrete Structures for Computer Science: Counting, Recursion, and Probability:
This is a free textbook for an undergraduate course on Discrete Structures for Computer Science students, which I have been teaching at Carleton University since the fall term of 2013. The material is offered as the second-year course COMP 2804 (Discrete Structures II). Students are assumed to have taken COMP 1805 (Discrete Structures I), which covers mathematical reasoning, basic proof techniques, sets, functions, relations, basic graph theory, asymptotic notation, and countability.