Information Technology 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.
Information Technology
Discrete Mathematics
Sets and logic, induction, recursion and functions, counting and recurrence, relations and algebraic structures, graph theory.
Your progress in this subject0 of 5 · 0%
- 1Inclusion–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.
- 2Permutations 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.
- 3Pigeonhole 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.
- 4Relations 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.
- 5Partial 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.
Coming next in Discrete Mathematics
- Sets, power sets and partitions· notes coming
- Propositional logic· notes coming
- Predicate logic and quantifiers· notes coming
- Rules of inference and proof strategies· notes coming
- Mathematical and strong induction· notes coming
- Recursive definitions and algorithms· notes coming
- Types of functions· notes coming
- Composition and inverse of functions· notes coming
- Binomial coefficients· notes coming
- Solving recurrence relations· notes coming
- Closures and Warshall's algorithm· notes coming
- Equivalence relations and partial orders· notes coming
- Groups, monoids and semigroups· notes coming
- Rings and fields· notes coming
- Group codes and homomorphism· notes coming
- Graphs, paths and circuits· notes coming
- Euler and Hamiltonian paths· notes coming
- Graph colouring and planar graphs· notes coming
- Trees, spanning trees and cut sets· notes coming
- Minimum spanning trees and shortest paths· notes coming
- Discrete numeric functions and generating functions· notes coming
- Logical equivalences and normal forms· notes coming
- Binary operations and algebraic systems· notes coming
- Boolean algebra and Boolean rings· notes coming