← Back to MCS-21233%16%23%29%
PYQ Analysis
MCS-212 · 10 papers · Jun 2019, Dec 2019, Jun 2020, Dec 2020, Jun 2021, Jun 2022, Dec 2022, Jun 2023, Dec 2023, Dec 2021
Block Weightage
Block 1 — Elementary Logic & Proofs
~28 marks/paper · 9/9 papers · 3 units
Block 2 — Sets, Relations & Functions
~13 marks/paper · 9/9 papers · 3 units
Block 3 — Counting Principles
~20 marks/paper · 9/9 papers · 4 units
Block 4 — Graph Theory
~24 marks/paper · 9/9 papers · 4 units
Unit Breakdown
Unit 1 — Propositional Calculus
Must~18 marks · 100% frequency
Propositions & ConnectivesTruth TablesLogical EquivalenceTautology & ContradictionCNF / DNF Normal FormsPredicate Logic & QuantifiersDe Morgan's Laws
Unit 2 — Methods of Proof
Must~8 marks · 90% frequency
Direct ProofProof by ContradictionProof by ContrapositiveMathematical InductionStrong Induction
Unit 3 — Boolean Algebra & Circuits
Must~10 marks · 85% frequency
Boolean Laws & IdentitiesSimplificationLogic Gates & CircuitsK-MapDe Morgan's Theorem
Unit 1 — Sets, Relations & Functions
Must~8 marks · 80% frequency
Set Types & OperationsVenn DiagramsSymmetric DifferencePower SetRelations & PropertiesEquivalence RelationsFunctions: Domain, Range, CompositionInverse Functions
Unit 2 — Automata & Languages
Must~12 marks · 100% frequency
Finite Automata (DFA/NFA)Regular ExpressionsKleene ClosureState Transition DiagramsMoore & Mealy Machines
Unit 3 — Computability & Complexity
Must~10 marks · 90% frequency
Turing MachineHalting ProblemUndecidable ProblemsTuring Acceptable vs Decidable LanguageP and NP Classes
Unit 1 — Combinatorics
Must~8 marks · 85% frequency
Fundamental Counting PrinciplePermutationsCombinationsCircular PermutationsMultinomial Theorem
Unit 2 — Advance Counting Principles
Must~8 marks · 90% frequency
Pigeonhole PrincipleGeneralized PigeonholeInclusion-Exclusion PrincipleDerangementsSurjective Functions
Unit 3 — Recurrence Relations
Must~8 marks · 80% frequency
Order & Degree of RecurrenceSolving RecurrencesFibonacci NumbersTower of HanoiCharacteristic Equation
Unit 4 — Partitions & Distributions
~4 marks · 50% frequency
Stirling NumbersPartitions of SetsDistribution of ObjectsInteger Solutions
Unit 1 — Basic Properties of Graphs
Must~10 marks · 100% frequency
Graph TerminologyDegree of VertexHandshaking TheoremComplete & Regular GraphsSubgraphsIsomorphismBipartite Graphs
Unit 2 — Connectedness
~8 marks · 80% frequency
Walk, Path, Circuit, CycleConnected GraphsSpanning TreesFloyd-Warshall Shortest PathTree and Forest
Unit 3 — Eulerian & Hamiltonian Graphs
Must~10 marks · 95% frequency
Eulerian Graph & CircuitHamiltonian GraphDirac's CriterionOre's CriterionTravelling Salesman Problem
Unit 4 — Graph Colourings
~6 marks · 70% frequency
Vertex ColouringChromatic NumberEdge ColouringPlanar GraphsMap Colouring