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.

Interview questions

Coming next in Discrete Mathematics

  1. Sets, power sets and partitions· notes coming
  2. Propositional logic· notes coming
  3. Predicate logic and quantifiers· notes coming
  4. Rules of inference and proof strategies· notes coming
  5. Mathematical and strong induction· notes coming
  6. Recursive definitions and algorithms· notes coming
  7. Types of functions· notes coming
  8. Composition and inverse of functions· notes coming
  9. Binomial coefficients· notes coming
  10. Solving recurrence relations· notes coming
  11. Closures and Warshall's algorithm· notes coming
  12. Equivalence relations and partial orders· notes coming
  13. Groups, monoids and semigroups· notes coming
  14. Rings and fields· notes coming
  15. Group codes and homomorphism· notes coming
  16. Graphs, paths and circuits· notes coming
  17. Euler and Hamiltonian paths· notes coming
  18. Graph colouring and planar graphs· notes coming
  19. Trees, spanning trees and cut sets· notes coming
  20. Minimum spanning trees and shortest paths· notes coming
  21. Discrete numeric functions and generating functions· notes coming
  22. Logical equivalences and normal forms· notes coming
  23. Binary operations and algebraic systems· notes coming
  24. Boolean algebra and Boolean rings· notes coming