- Text: Schaum's of Discrete Mathematics 3rd edition
- Authors: Seymour Lipschutz, Marc Lipson
- ISBN-10: 0071470387
- ISBN-13: 978-0071470384

- (Starting with chapter 2, section 2). Proofs, Recursion,
and Analysis of Algorithms
- Induction
- Section 2.4: Recursion and Recurrence Relations

- Sections 3.1-3.3:
- Sets
- Counting
- Principal of Inclusion and Exclusion; Pigeonhole Principle

- Section 3.4:
- Permutations and Combinations
- Exam on Monday

- Section 3.4-3.5: Combinations, Binomial Theorem
- Sections 4.1-4.3:
- Relations
- Topological Sorting
- Relations and Databases

- Section 4.4:
- Functions
- Exam on Monday

- Sections 5.1-5.2:
- Representations of Graphs
- Representations of Trees

- Sections 5.3-5.4:
- Decision trees
- Huffman codes

- Sections 6.1-6.3:
- Directed graphs and binary relations
- Boolean adjacency matrices and reachability
- Warshall's algorithm
- Euler Path and Hamiltonian Circuit
- Shortest path and minimal spanning tree

- Section 8.2:
- Finite state machines
- Exam on Monday

- Section 8.4
- Formal languages
- Review

There will be 3 hour-long exams on the Mondays of week 3, 6, and 9. There will be a final exam that will be counted twice. The lowest of the 5 exam-grades will be dropped.

- SWI Prolog Home Page

An excellent*free*implementation of Prolog - Otter Home
page

Otter is a free generalized theorem proving system (somewhat user-hostile) - Solution to the Fibonacci
Recurrence

This is in MathML, so you must use the Mozilla browser to view it.

Justin R. Smith