Discrete mathematics in plain view
(Redirected from Discrete Mathematics in plain view)
![]() |
Subject classification: this is a mathematics resource. |
Logic
edit- 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
- Normal Form (A.pdf)
- Logic Old Note (H1.pdf)
- Logic in Haskell (pdf)
Proof
edit
Set theory
edit
- Sets in Haskell (pdf)
Functions and Relations
edit- Functions (A.pdf)
- Matrix (A.pdf)
- Relations (A.pdf)
- Equivalent Relations (A.pdf)
- Partial Order Relations (A.pdf)
- Relation Note (H1.pdf)
Algorithms
edit- Algorithms
- [ Binary Search ]
- [ Bubble Sort ]
- [ Insertion Sort ]
Induction and Recursion
edit
- Induction and Recursion in Haskell (pdf)
Number theory
edit- [ Binary Numbers ]
- [ Hexadecimal Numbers ]
- Number Theory (A.pdf)
- Number Theory in Haskell
Combinatorics
edit- Counting (A.pdf)
Probability
edit
Graphs
edit- 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)
Trees
edit
- Tree Drawing in Latex (A.pdf)
Automata
edit- Finite State Machine (pdf)
- Finite State Automata (pdf)
- Push Down Automata (pdf)
- Turing Machine (pdf)
Formal Language
edit
Discrete Calculus
edit
Topology
edit
Operations research
edit