Computer Engineering is coming soon

We're still writing and reviewing the notes for every subject, and we'll open it when every subject is ready. Meanwhile you can practise aptitude, ask Aria about any subject, or see the branches that are ready.

Computer Engineering

Discrete Mathematics

Logic, sets, relations, functions, trees, graphs, counting, algebraic structures.

Interview questions
Your progress in this subject0 of 24 · 0%
  1. 1Propositional logic and equivalencesPropositional logic studies Boolean statements, their connectives and algebraic laws so you can simplify logical formulas, prove equivalences and convert formulas to normal forms used in design, verification and algorithms.
  2. 2Translating English into logicHow to convert ordinary English sentences into precise propositional and predicate-logic formulas, with rules, common patterns, worked translations and how to negate quantified statements.
  3. 3Mathematical inductionMathematical induction is a proof method to show a property holds for every integer in a range (usually all natural numbers) by proving a base case and an inductive step; it is used in engineering for proving correctness of algorithms, recurrences, and formulas for sums and combinatorial counts.
  4. 4Set theory and set operationsClear, exam-focused notes on set theory and set operations: definitions, laws (with proofs), formulas, worked problems and common exam pitfalls for engineering students.
  5. 5Inclusion–exclusion principleInclusion–exclusion counts elements in unions of overlapping sets by alternately adding and subtracting sizes of intersections; used in counting, probability, derangements and avoiding double-counting in engineering problems.
  6. 6Relations and their propertiesRelations between sets: definitions (reflexive, symmetric, antisymmetric, transitive, equivalence, partial order), representation, basic theorems, closures, composition and inverse, with worked examples and exam guidance.
  7. 7Representing relations: matrices and digraphsHow to represent a binary relation on a finite set as a directed graph (digraph) and as a (Boolean) matrix, and how relation properties correspond to simple matrix tests and graph features.
  8. 8Equivalence relations and partitionsEquivalence relations are relations that are reflexive, symmetric and transitive; they exactly correspond to partitions of a set into disjoint equivalence classes — a fundamental idea used to group objects by 'sameness' in engineering problems like modular arithmetic, state minimisation and type/cla
  9. 9Partial orders, Hasse diagrams and latticesNotes on partial orders, Hasse diagrams and lattices: definitions, laws, how to draw and recognise Hasse diagrams, lattice properties (meet/join), worked examples and typical exam questions.
  10. 10Transitive closure and Warshall's algorithmHow to compute the transitive closure (reachability) of a relation or directed graph and how Warshall's algorithm finds it in O(n^3) time using boolean matrix updates.
  11. 11Functions: injective, surjective and bijectiveClear definitions and proofs for functions, focusing on injective (one-to-one), surjective (onto) and bijective maps, with examples, common mistakes and exam guidance.
  12. 12Composition, inverse and recursive functionsComposition combines functions by feeding the output of one to another; inverses undo bijections and follow a reverse order rule; recursive functions are defined by base cases and rules and are used to compute sequences like factorials and Fibonacci numbers.
  13. 13Trees and their propertiesClear, exam-focused notes on trees: definitions (rooted/unrooted), properties, key theorems (edges = n−1, equivalent characterizations), formulas for m-ary and binary trees, worked examples (proof by induction, numeric counts, traversal trace), common mistakes and quick-check questions.
  14. 14Prefix codes and Huffman codingPrefix codes are instantaneously decodable variable-length codes used for lossless data compression; Huffman coding is a greedy algorithm that constructs an optimal binary prefix code for known symbol probabilities.
  15. 15Minimum spanning treesMinimum spanning trees (MSTs) choose a set of edges of minimum total weight that connects all vertices; engineers use MSTs for wiring, network design, clustering and routing cost optimization.
  16. 16Graph terminology and special graphsBasic graph definitions, standard special graphs (complete, bipartite, path, cycle, wheel, star, regular, trees), key theorems (handshaking lemma, complement edge count), examples, common exam mistakes and quick checks.
  17. 17Euler and Hamilton pathsEuler and Hamilton paths study the existence and construction of trails/circuits that visit every edge once (Euler) or every vertex once (Hamilton) in graphs, with simple tests, algorithms (Hierholzer) and sufficient theorems (Dirac, Ore).
  18. 18Dijkstra's shortest-path algorithmDijkstra's algorithm finds shortest paths from one source in a weighted graph with non‑negative edge weights; engineers use it in routing, networking, and many optimization tasks.
  19. 19Planar graphs and graph colouringPlanar graphs are graphs that can be drawn on a plane without edge crossings; this topic covers planarity tests, Euler's formula and consequences, Kuratowski's theorem, and graph colouring (five-colour theorem and chromatic number of planar graphs).
  20. 20Permutations and combinationsPermutations and combinations count ordered and unordered selections from finite sets; engineers use them in counting states, resource allocations, testing combinations, and analysing algorithms.
  21. 21Pigeonhole principleThe pigeonhole principle: simple and generalized statements, proofs, formulas and exam-style worked examples showing how to guarantee collisions or minimum occupancy when objects are placed into boxes.
  22. 22Generating functionsIntroduction to ordinary generating functions: definitions, basic operations, solving linear recurrences, counting with product GFs, worked examples (recurrence solution, Fibonacci/Binet, combinations), common exam mistakes and quick checks.
  23. 23Groups, semigroups and monoidsClear, exam-focused notes on semigroups, monoids and groups: definitions, basic laws and proofs, examples, worked problems, common mistakes and exam guidance.
  24. 24Rings, integral domains and fieldsClear study notes on rings, integral domains and fields: definitions, key theorems (with proofs), examples, common mistakes and exam advice for engineering students.

Coming next in Discrete Mathematics

  1. Countable and uncountable sets· notes coming
  2. Cut sets and the max-flow min-cut theorem· notes coming
  3. Graph representation and isomorphism· notes coming
  4. Predicate logic and quantifiers· notes coming
  5. Methods of proof· notes coming
  6. Chains, antichains and sublattices· notes coming
  7. Recurrence relations and their solution· notes coming
  8. Subgroups, abelian and cyclic groups· notes coming
  9. Cut sets and cut vertices· notes coming
  10. Nested quantifiers· notes coming
  11. Rules of inference and valid arguments· notes coming
  12. Applications of recurrence relations· notes coming
  13. Congruence relations and quotient structures· notes coming
  14. Boolean algebra and Boolean rings· notes coming
  15. Discrete numeric functions· notes coming
  16. Logical equivalences and normal forms· notes coming
  17. Group codes and homomorphism· notes coming