Discrete Structures for Computer Science

Overview

Underlying mathematical rules that govern algorithm design and data structures. Leans in on more of a mathematics course than a CS one. The course covers set theory, combinatorics, recurrence relations, graph theory and group theory

Judith Gerstring's book is a perfect introduction to the course for beginners. It is recommended to use Kenneth Rosen's book which provides examples and problems whose solutions can be found here

Navigation

• Prerequisites

• Textbooks

• Videos

• Apps

Prerequisites

This course has no prerequisites.

This course is a prerequisite for:

• Theory of Computation

• Data Structures & Algorithms

Textbooks

Title	Author(s)	Edition
Discrete Mathematics for Computer Scientists & Mathematicians	Mott, Kandel & Baker	2nd (2008)
Discrete Mathematics and its Applications	Kenneth Rosen	7th (2012)
Student's Solution Guide to Accompany Discrete Mathematics and its Applications	Jerrold Grossman & Kenneth Rosen	7th (2012)
Mathematical Structures for Computer Science: Discrete Mathematics & its Applications	Judith Gersting	7th (2014)
Lehman & Leighton Notes	Lehman & Leighton	Revised (2004)
Discrete Mathematics with Applications	Susanna S. Epp	4th (2011)

Videos

• Set Theory, Knowledge Gate

• Relations, Posets, etc., Knowledge Gate

• Relations Intro., Knowledge Gate

• Graph Theory Knowledge Gate

• Group Theory, Knowledge Gate

• Group Theory & Abstract Algebra, Socratica

• Discrete Math Full Course: Sets, Logic, Proofs, Probability, Graph Theory, etc, Trefor Bazett (Full Course)

• Discrete Math 1, TrevTutor

• Discrete Math 2, TrevTutor

• Introduction to Mathematical Thinking, Stanford University

• Discrete Mathematics Specialisation, UC San Diego

Apps

• Wolfram Alpha

• Algorithms: Explained and Animated