The course is divided into 3 sections:
📄️ Modular Arithmetic
notes about modular arithmetic and its examples: parity, clock arithmetic
This page is about the definition of exponents, laws of exponents, and examples of exponents.
notes about logarithms
notes about bit strings, bit operations, bit-wise operations, bit manipulation.
📄️ Data Representation
How to represent integers, characters, decimal numbers using bits.
📄️ Propositional Logic
Week 3: Propositional Logic. Study propositions and logical operators.
📄️ Set Theory
Week 4: Sets. Study set theory, Zermelo-Fraenkel set theory axioms, and Syllogisms.
📄️ Zermelo-Fraenkel Set Theory
Week 4: Sets. Study Zermelo-Fraenkel set theory axioms
Week 4: Sets. Study Syllogisms.
📄️ Logical Implication
Week 5: Predicate logic. Study Logical implications
Week 5: Predicate logic. Study proofs.
Week 5: Predicate logic. Study predicate logic. An introduction to predicate.
Week 5: Predicate logic. Study existential/universal quantifiers.
Week 6: Relations
Week 6: Functions
Week 6: Sequences
Week 7: Graphs
📄️ Graph Connectivity
Week 7: Graphs
📄️ Graph Algorithms
Week 7: Graphs. Breadth-First Search and Depth-First Search
Week 8: Trees
📄️ Algorithms for Trees
Week 8: Algorithms for Trees
📄️ Problem Solving Assignment
📄️ Project: Pegs
CAB203 Assignment Solve the pegs game using BFS.
- Abstractions, definitions, modular arithmetic, exponents
- Data representations, bits, bit strings
- Logic, proofs, axioms recursion
- Predicate logic
- Relations, functions
- Finite state automata and regular languages
- Linear algebra
- Probability and Baysian reasoning
- Program correctness
Cannot find definitions for "automata".
Cannot find definitions for "axioms".