Framingham State University
Spring 2014
Topics:
Introduction (slides)
D. Keil,
Definitions, theorems, proofs
D. Keil,
Abstraction, functions, and recursion
1. Boolean algebras; propositional and
predicate logic; and inductive
proofs (slides)
D. Keil, Sample problems in algorithm verification
2.
Sets, relations, and recurrences (slides)
D. Keil,
Sample problems in algorithm analysis
3.
Graphs and transition systems (slides)
4.
Trees (slides)
5. Decidability and countability (slides)
6. Combinatorics and discrete probability (slides)
7. Information theory, randomness,
and
chaos (slides)
Summary (slides)
This page last edited 1/21/14