Select Guide Rating

• 1. Fundamentals 1.1 Sets and Subsets1.2 Operations on Sets1.3 Sequences1.4 Properties of Integers1.5 Matrices1.6 Mathematical Structures 2. Logic 2.1 Propositions and Logical Operations2.2 Conditional Statements2.3 Methods of Proof2.4 Mathematical Induction2.5 Mathematical Statements2.6 Logic and Problem Solving 3. Counting 3.1 Permutations3.2 Combinations3.3 Pigeonhole Principle3.4 Elements of Probability3.5 Recurrence Relations 4. Relations and Digraphs 4.1 Product Sets and Partitions4.2 Relations and Digraphs4.3 Paths in Relations and Digraphs4.4 Properties of Relations4.5 Equivalence Relations4.6 Data Structures for Relations and Digraphs4.7 Operations on Relations4.8 Transitive Closure and Warshall's Algorithm 5. Functions 5.1 Functions5.2 Functions for Computer Science5.3 Growth of Functions5.4 Permutation Functions 6. Order Relations and Structures 6.1 Partially Ordered Sets6.2 Extremal Elements of Partially Ordered Sets6.3 Lattices6.4 Finite Boolean Algebras6.5 Functions on Boolean Algebras6.6 Circuit Design 7. Trees 7.1 Trees7.2 Labeled Trees7.3 Tree Searching7.4 Undirected Trees7.5 Minimal Spanning Trees 8. Topics in Graph Theory 8.1 Graphs8.2 Euler Paths and Circuits8.3 Hamiltonian Paths and Circuits8.4 Transport Networks8.5 Matching Problems8.6 Coloring Graphs 9. Semigroups and Groups 9.1 Binary Operations Revisited9.2 Semigroups9.3 Products and Quotients of Semigroups9.4 Groups9.5 Products and Quotients of Groups9.6 Other Mathematical Structures 10. Groups and Coding 10.1 Coding of Binary Information and Error Detection10.2 Decoding and Error Correction10.3 Public Key Cryptology 11. Languages and Finite-State Machines 11.1 Languages11.2 Representations of Special Grammars and Languages11.3 Finite-State Machines11.4 Monoids, Machines, and Languages11.5 Machines and Regular Languages11.6 Simplification of Machines