Discrete Mathematics (MCS-212)
Discrete mathematics is the maths of separate, countable things: true/false values, sets, integers, graphs. It is the foundation for algorithms, databases, programming logic and cryptography, which is why it sits in the first semester of the MCA.
Each chapter is split into short sections. Read a section, then answer the practice questions at the end before moving on.
Chapters
Section titled “Chapters”- Propositional Logic: Propositions, logical connectives, truth tables and logical equivalence, the language behind every if-statement and circuit.
© 2026 Navninder Singh Benipal. Free to read and study. Licensed under CC BY-NC-ND 4.0: share the link, but please don't republish or sell these notes.