Artificial Intelligence & Data Science 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.

Artificial Intelligence & Data Science

Discrete Mathematics

Logic, sets, functions and relations, combinatorics, graphs and trees, algebraic structures and morphism.

Interview questions
Your progress in this subject0 of 12 · 0%
  1. 1Functions: 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.
  2. 2Relations 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.
  3. 3Equivalence 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
  4. 4Prefix 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.
  5. 5Rings, 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.
  6. 6Mathematical 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.
  7. 7Pigeonhole 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.
  8. 8Permutations 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.
  9. 9Generating 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.
  10. 10Trees 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.
  11. 11Composition, 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.
  12. 12Inclusion–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.

Coming next in Discrete Mathematics

  1. Propositions and truth tables· notes coming
  2. Logical equivalences and normal forms· notes coming
  3. Predicates and quantifiers· notes coming
  4. Nested quantifiers· notes coming
  5. Rules of inference and valid arguments· notes coming
  6. Sets, set operations and identities· notes coming
  7. Cardinality of sets· notes coming
  8. Closures of relations· notes coming
  9. Partial orders and Hasse diagrams· notes coming
  10. Recurrence relations and their applications· notes coming
  11. Solving linear recurrence relations· notes coming
  12. Special graphs and bipartite graphs· notes coming
  13. Euler and Hamiltonian paths· notes coming
  14. Graph isomorphism and planar graphs· notes coming
  15. Graph colouring and matching· notes coming
  16. Spanning trees and minimal spanning trees· notes coming
  17. Semigroups, monoids and groups· notes coming
  18. Cyclic and permutation groups· notes coming
  19. Normal subgroups and quotient structures· notes coming
  20. Boolean algebra· notes coming
  21. Binomial coefficients and identities· notes coming
  22. Graphs, subgraphs and degree· notes coming
  23. Matrix representations of graphs· notes coming
  24. Graph operations: union, sum and products· notes coming
  25. Graphic sequences and the Havel–Hakimi criterion· notes coming
  26. Connectivity, cut-vertices and blocks· notes coming
  27. Shortest paths: Dijkstra and Floyd–Warshall· notes coming
  28. Fleury's algorithm and the Chinese postman problem· notes coming
  29. Conditions for Hamiltonian graphs· notes coming
  30. Hall's theorem and perfect matchings· notes coming
  31. Chromatic number and Brooks' theorem· notes coming
  32. Edge colouring and Vizing's theorem· notes coming
  33. Crisp and fuzzy sets: operations and properties· notes coming
  34. Binary operations and algebraic systems· notes coming
  35. Digraphs and their properties· notes coming
  36. Division algorithm, GCD and the Euclidean algorithm· notes coming
  37. Primes and the fundamental theorem of arithmetic· notes coming
  38. Methods of proof· notes coming
  39. Tautologies and functionally complete sets of connectives· notes coming
  40. Homomorphism and isomorphism of algebraic systems· notes coming
  41. Group codes· notes coming
  42. Lattices and their properties· notes coming