Exam Intelligence
What the last two papers actually asked — counted, not guessed. Historical trends only: a topic appearing twice does not guarantee it appears a third time.
Mathematics for Computer Engineering (N2113111)
Dec 2025: 93 marks of questions analysed · May 2026: 93 marks · 19 of 19 topics appeared in both papers.
| Topic | Dec 2025 Qs | May 2026 Qs | Total | Marks |
|---|---|---|---|---|
| Eigenvalues & eigenvectors | 2 | 2 | 4 | 18 |
| Full Fourier expansion | 2 | 2 | 4 | 21 |
| Diagonalisation | 1 | 1 | 2 | 11 |
| Cayley–Hamilton theorem | 1 | 1 | 2 | 8 |
| Lagrange multipliers (NLPP) | 1 | 1 | 2 | 12 |
| Solving an LPP (Simplex method) | 1 | 1 | 2 | 11 |
| LPP standard form & dual | 1 | 1 | 2 | 6 |
| Chinese Remainder Theorem (CRT) | 1 | 1 | 2 | 10 |
| RSA algorithm | 1 | 1 | 2 | 12 |
| Remainder by modular arithmetic | 1 | 1 | 2 | 6 |
| Finding an in a Fourier expansion | 1 | 1 | 2 | 6 |
| Spearman rank correlation | 1 | 1 | 2 | 6 |
| Karl Pearson correlation coefficient | 1 | 1 | 2 | 10 |
| Regression lines | 1 | 1 | 2 | 9 |
| Fitting a straight line y = a + bx | 1 | 1 | 2 | 8 |
| Moments (raw moments, moments about origin / mean) | 1 | 1 | 2 | 7 |
| Moment generating function (MGF) | 1 | 1 | 2 | 7 |
| Poisson distribution | 1 | 1 | 2 | 8 |
| Normal distribution | 1 | 1 | 2 | 10 |
No question appeared word-for-word in both papers. Topics repeat; exact wordings change.
Discrete Structures & Graph Theory (N2113112)
Dec 2025: 100 marks of questions analysed · May 2026: 90 marks · 13 of 15 topics appeared in both papers.
| Topic | Dec 2025 Qs | May 2026 Qs | Total | Marks |
|---|---|---|---|---|
| Mathematical induction | 1 | 1 | 2 | 14 |
| Logical equivalence | 1 | 1 | 2 | 10 |
| Transitive closure / Warshall | 1 | 1 | 2 | 16 |
| Hasse diagram / lattice | 1 | 1 | 2 | 14 |
| Equivalence relation | 1 | 1 | 2 | 10 |
| Function composition | 1 | 1 | 2 | 14 |
| Inclusion–exclusion | 1 | 1 | 2 | 16 |
| Recurrence relation | 1 | 1 | 2 | 14 |
| Pigeonhole principle | 1 | 1 | 2 | 10 |
| Group under × mod 7 | 1 | 1 | 2 | 16 |
| Ring | 1 | 1 | 2 | 16 |
| Graph isomorphism | 1 | 1 | 2 | 16 |
| Euler / Hamiltonian paths & circuits | 1 | 1 | 2 | 14 |
| Truth table / access expression | 1 | 0 | 1 | 5 |
| Mapping: function / one-one / onto / many-one | 1 | 0 | 1 | 5 |
No question appeared word-for-word in both papers. Topics repeat; exact wordings change.
Analysis of Algorithms (N2113113)
Dec 2025: 93 marks of questions analysed · May 2026: 93 marks · 6 of 26 topics appeared in both papers.
| Topic | Dec 2025 Qs | May 2026 Qs | Total | Marks |
|---|---|---|---|---|
| Backtracking family | 1 | 2 | 3 | 11 |
| Recurrence solving | 1 | 1 | 2 | 6 |
| Merge Sort (FIXED 10 MARKS) | 1 | 1 | 2 | 20 |
| Fractional Knapsack | 1 | 1 | 2 | 8 |
| Multistage Graph | 1 | 1 | 2 | 15 |
| LCS — Longest Common Subsequence | 1 | 1 | 2 | 13 |
| KMP String Matching | 0 | 2 | 2 | 8 |
| Selection Sort | 1 | 0 | 1 | 5 |
| Insertion Sort | 0 | 1 | 1 | 5 |
| Asymptotic notations | 0 | 1 | 1 | 5 |
| Big Theta (Θ) | 1 | 0 | 1 | 5 |
| Binary Search | 1 | 0 | 1 | 3 |
| Divide and Conquer | 0 | 1 | 1 | 3 |
| Kruskal's MCST | 1 | 0 | 1 | 10 |
| Dijkstra's shortest path | 0 | 1 | 1 | 10 |
| Prim's MST | 0 | 1 | 1 | 5 |
| Greedy general method | 1 | 0 | 1 | 3 |
| 0/1 Knapsack by DP | 0 | 1 | 1 | 10 |
| Floyd-Warshall | 1 | 0 | 1 | 5 |
| Principle of Optimality | 1 | 0 | 1 | 3 |
| Graph Coloring | 1 | 0 | 1 | 5 |
| N-Queen Problem | 1 | 0 | 1 | 10 |
| 15-puzzle | 0 | 1 | 1 | 5 |
| Sum of Subset | 0 | 1 | 1 | 5 |
| Rabin-Karp | 1 | 0 | 1 | 5 |
| Naïve String Matching | 1 | 0 | 1 | 3 |
No question appeared word-for-word in both papers. Topics repeat; exact wordings change.
Computer Organization & Architecture (N2113114)
Dec 2025: 95 marks of questions analysed · May 2026: 95 marks · 10 of 19 topics appeared in both papers.
| Topic | Dec 2025 Qs | May 2026 Qs | Total | Marks |
|---|---|---|---|---|
| Number conversion | 1 | 1 | 2 | 10 |
| Non-restoring division | 1 | 1 | 2 | 16 |
| Booth's algorithm | 1 | 1 | 2 | 14 |
| 8086 architecture | 1 | 1 | 2 | 16 |
| Cache mapping | 1 | 1 | 2 | 16 |
| Memory hierarchy / characteristics | 1 | 1 | 2 | 12 |
| Associative memory | 1 | 1 | 2 | 10 |
| I/O methods | 1 | 1 | 2 | 14 |
| Pipeline hazards | 1 | 1 | 2 | 14 |
| Flynn's classification | 1 | 1 | 2 | 13 |
| IEEE 754 floating point | 0 | 1 | 1 | 8 |
| Microprogrammed control unit | 1 | 0 | 1 | 8 |
| Hardwired vs Softwired CU | 0 | 1 | 1 | 7 |
| Horizontal vs Vertical microinstruction | 1 | 0 | 1 | 5 |
| Addressing modes of 8086 | 1 | 0 | 1 | 5 |
| ISA / PCI / USB buses | 1 | 0 | 1 | 5 |
| Bus arbitration | 1 | 0 | 1 | 5 |
| 80386DX operation modes | 0 | 1 | 1 | 7 |
| Instruction pipeline | 0 | 1 | 1 | 5 |
1 question(s) appeared word-for-word in both papers:
- explain flynn's classification.
Generative AI (Open elective)
Dec 2025: 100 marks of questions analysed · May 2026: 52 marks · 9 of 20 topics appeared in both papers.
| Topic | Dec 2025 Qs | May 2026 Qs | Total | Marks |
|---|---|---|---|---|
| GPT architecture & working | 1 | 2 | 3 | 17 |
| RNN — architecture & working | 1 | 1 | 2 | 13 |
| LLM — Large Language Models | 1 | 1 | 2 | 10 |
| Generative AI — definition & scope | 1 | 1 | 2 | 7 |
| GPT variants | 1 | 1 | 2 | 10 |
| Ethics in Generative AI | 1 | 1 | 2 | 10 |
| Generative AI tools / applications | 1 | 1 | 2 | 10 |
| Pre-training | 1 | 1 | 2 | 9 |
| CNN — architecture & working | 1 | 1 | 2 | 13 |
| Challenges in Generative AI | 1 | 0 | 1 | 8 |
| Importance in five real-world domains | 1 | 0 | 1 | 5 |
| Traditional vs modern language models | 1 | 0 | 1 | 5 |
| Transformer architecture | 0 | 1 | 1 | 5 |
| LSTM | 0 | 1 | 1 | 2 |
| Tokenization in transformers | 0 | 1 | 1 | 2 |
| Chat-GPT | 1 | 0 | 1 | 7 |
| Multi-head mechanism in GPT | 1 | 0 | 1 | 7 |
| Self-attention in GPT | 1 | 0 | 1 | 5 |
| GPT and Chat-GPT — definition | 0 | 1 | 1 | 2 |
| Importance of data in training | 1 | 0 | 1 | 5 |
No question appeared word-for-word in both papers. Topics repeat; exact wordings change.
Practice sets — questions only
Every question from both papers, grouped by topic. Work them, then check yourself against your own notes — answers are not published here.