CMSC250: Notes
Each document has a table of contents on the front page
so please click on the document if you wish to know what it contains.
These notes
are the result of extensive semester-long discussions with Clifford Bakalian
so I am indebted to him for significant input, examples, ideas, and structure.
- Propositional Logic
- Digital Circuits
- Number Bases
- Adder Circuits
- Parity, Primes, Divisibility, Modular Arithmetic
- First Order Logic - Quantification
- First Order Logic - Proofs
- Sets, Set Comparisons, Venn Diagrams, Set Identities, Partitions, Cardinality, Countability, Set Theory Proofs
- Sequences, Sums, and Products
- Weak and Strong Mathematical Induction
- Recursively Defined Sets and Binary Trees
- Structural Mathematical Induction
- Events and Basic Counting
- Permutations and Combinations
- Probability and Expected Value
- Basics of Algorithm Analysis