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. It covers mathematical reasoning, basic proof techniques, sets, functions, relations, basic graph theory, asymptotic notation, and countability.

Publication date: 20 Apr 2016

ISBN-10: n/a

ISBN-13: n/a

Paperback: 284 pages

Views: 12,923

Type: Textbook

Publisher: n/a

Post time: 28 Apr 2016 11:00:00

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. It covers mathematical reasoning, basic proof techniques, sets, functions, relations, basic graph theory, asymptotic notation, and countability.
Tag(s): Graph Theory Introduction to Computer Science Mathematics
Publication date: 20 Apr 2016
ISBN-10: n/a
ISBN-13: n/a
Paperback: 284 pages
Views: 12,923
Document Type: Textbook
Publisher: n/a
License: Creative Commons Attribution-ShareAlike 4.0 International
Post time: 28 Apr 2016 11:00:00
Summary/Excerpts of (and not a substitute for) the Creative Commons Attribution-ShareAlike 4.0 International:
You are free to:

Share — copy and redistribute the material in any medium or format
Adapt — remix, transform, and build upon the material for any purpose, even commercially.

The licensor cannot revoke these freedoms as long as you follow the license terms.

Click here to read the full license.
From the Preface:
Michiel Smid wrote: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.

During a 12-week term with three hours of classes per week, I cover most of the material in this book, except for Chapter 2, which has been included so that students can review the material from COMP 1805.

About The Author(s)

Michiel Smid is a Professor in the School of Computer Science at Carleton University. His research interests include Algorithms, Applications of Computational Geometry in Manufacturing, Computational Geometry, Data Structures, Discrete Mathematics, Geometric Networks, Graph Theory, and Theory of Computing.

Michiel Smid is a Professor in the School of Computer Science at Carleton University. His research interests include Algorithms, Applications of Computational Geometry in Manufacturing, Computational Geometry, Data Structures, Discrete Mathematics, Geometric Networks, Graph Theory, and Theory of Computing.

Sponsors