Discrete mathematics in plain view

Subject classification: this is a mathematics resource.

Logic

• Overview (A.pdf)
• Connectives (A.pdf)
• Propositional Logic (A.pdf)
• First Order Logic (A.pdf)
• Truth Table in C (A.pdf)
• Implications (A.pdf)
• Resolution (A.pdf)
• Boolean Algebra

- Overview (A.pdf)

- Functions (A.pdf)

- K-Map (A.pdf)

• Normal Form (A.pdf)

• Logic Old Note (H1.pdf)

• Logic in Haskell (pdf)

• MIT OCW

Set theory

• Set Operations (A.pdf)
• Cardinality (A.pdf)

• Sets in Haskell (pdf)

Functions and Relations

• Functions (A.pdf)
• Matrix (A.pdf)
• Relations (A.pdf)
• Equivalent Relations (A.pdf)
• Partial Order Relations (A.pdf)

• Relation Note (H1.pdf)

• Functions in Haskell (pdf)
• Relations in Haskell (pdf)

Algorithms

• Algorithms

- Overview (A.pdf)

- Bubble Sort (B.pdf)

- Insertion Sort (C.pdf)

- Binary Search (D.pdf)

• The Growth of Functions (A.pdf)
• The Complexity of Algorithms (A.pdf)

• [ Binary Search ]
• [ Bubble Sort ]
• [ Insertion Sort ]

Induction and Recursion

• [ C Recursion Functions ]

• Induction and Recursion in Haskell (pdf)

Number theory

• [ Binary Numbers ]
• [ Hexadecimal Numbers ]
• Number Theory (A.pdf)

• Number Theory in Haskell

Combinatorics

• Counting (A.pdf)

Probability

• Probability (A.pdf)
• Bayes' Theorem (B.pdf)
• Monte Carlo Algorithms (C.pdf)
• Expected Value (D.pdf)

Graphs

• Graph Overview (A.pdf, H1.pdf)
• Eulerian Cycles (A.pdf)
• Hamiltonian Cycles (A.pdf)
• Shortest Path Problem (A.pdf)
• Minimum Spanning Tree (A.pdf)
• Graph Search (A.pdf)
• Planar Graph (A.pdf)
• Graph Isomorphism (A.pdf)
• Graph Coloring (A.pdf)

• Graph Drawing in Latex (A.pdf)
• Network Analysis using R (A.pdf)

Trees

• Tree Background (pdf)
• Tree Traversal (pdf)
• Binary Search Tree (pdf)

• Tree Drawing in Latex (A.pdf)

Automata

• Finite State Machine (pdf)
• Finite State Automata (pdf)
• Push Down Automata (pdf)
• Turing Machine (pdf)

Formal Language

• Regular Language (pdf)
• Context Free Language (pdf)
• Recursively Enumerable Language Language (pdf)

Note

• Week 01 (H.pdf, K.pdf, P.pdf)
• Week 02 (H.pdf, K.pdf, P.pdf)
• Week 03 (H.pdf, K.pdf, P.pdf)

• Week 04 (H.pdf, K.pdf, P.pdf)

• Week 05 (H.pdf, K.pdf, P.pdf)

• Week 06 (H.pdf, K.pdf, P.pdf)

• Week 07 (H.pdf, K.pdf, P.pdf)

• Week 08 (H.pdf, K.pdf, P.pdf)

• Week 09 (H.pdf, K.pdf, P.pdf)

• Week 10 (H.pdf, K.pdf, P.pdf)

• Week 11 (H.pdf, K.pdf, P.pdf)

• Week 12 (H.pdf, K.pdf, P.pdf)

• Week 13 (H.pdf, K.pdf, P.pdf)

• Week 14 (H.pdf, K.pdf, P.pdf)

• Week 15 (H.pdf, K.pdf, P.pdf)

go to [ Electrical_&_Computer_Engineering_Studies ]