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
- Normal Form (A.pdf)
- Logic Old Note (H1.pdf)
- Logic in Haskell (pdf)
Proof
Set theory
- 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)
Algorithms
- Algorithms
- [ Binary Search ]
- [ Bubble Sort ]
- [ Insertion Sort ]
Induction and Recursion
- 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
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)
Trees
- Tree Drawing in Latex (A.pdf)
Automata
- Finite State Machine (pdf)
- Finite State Automata (pdf)
- Push Down Automata (pdf)
- Turing Machine (pdf)
Formal Language
Discrete Calculus
Topology
Operations research
Note
This article is issued from Wikiversity. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.