CS 3233: Discrete Mathematics

Syllabus and Assignments

Syllabus for Fall 2003

Homework 1, Homework 2, Homework 3, Midterm 1 Review.

Homework 4, Homework 5, Homework 6, Midterm 2 Review.

Homework 7, Homework 8, Homework 9, Final Review.

Notes (subject to change)

Many of my notes here are organized around the 4th edition of the Rosen book. There will be many changes (mostly minor) to take into account the different order of topics in the 5th edition.

The Foundations: Propositional Logic, Predicate Logic, Proof Methods, Sets and Functions.

The Fundamentals: Algorithms, Big-Oh Notation, Integers and Algorithms, Matrices.

Mathematical Reasoning: Sequences and Mathematical Induction, Recursion, Recurrences.

Counting: Counting Rules, Permutations, Combinations, Binomials, Probability.

Relations: Relations and Their Properties, Transitive Closure Algorithms, n-Ary Relations.

Graphs: Introduction to Graphs, Connectivity and Dijkstra's Algorithm.

Trees: Introduction to Trees, Spanning Trees, Grammars.

Turing Machines.

Other

Back to Tom Bylander's Home Page