optional · CSS study notes
⭐ Most Repeated Questions — Paper-I, Section-B
CSS Computer Science (Optional) — Paper-I, Section-B. A frequency-based index across the three Section-B topics (Algorithms & Data Structures, Software Engineering, Compiler Construction). This index currently reflects the CSS Computer Science Paper-I 2026 exam — the first Section-B past paper reviewed for this project — with 4 question-patterns extracted per topic (12 total), each with a complete model solution and the reasoning an examiner is actually checking for. Unlike the Section-A index (built from 2016–2024 papers), this page will grow as more Section-B papers are reviewed in future.
How this index was built
Each subject-matter page below was built directly from the CSS Computer Science Paper-I 2026 exam (Section-B, Q5–Q8). As with the Section-A index, a question "pattern" here means the underlying concept and question type (not just the exact wording) — so future years' papers can be added to the same pages when the same skill is tested with a different scenario. Every question shows the year and question number it was drawn from.
The Three Topic Pages
Algorithms & Data Structures
Binary Search preconditions, time vs space complexity, stack-based postfix evaluation, and choosing the right data structure (Array/BST/AVL/Hash Table) under real-world constraints — 4 questions.
Software Engineering
SDLC maintenance economics, UML Use Case Diagrams, Agile customer collaboration, and a full requirements-conflict resolution scenario from the 2026 paper, plus 8 further confirmed-repeated patterns added from the 2019–2025 papers — requirements verification/validation, 3-tier web architecture (a near-verbatim repeat), black-box/white-box testing and QA vs QC vs Testing, the Spiral model and named Agile frameworks, software quality attributes and CMMI, Aspect-Oriented Software Engineering, project planning phases and PERT, and the Software Process Improvement framework — 12 questions total, the deepest-covered topic in this index.
Compiler Construction
DFA construction for a regular expression, lexeme/token/pattern theory, register allocation for three-address code, and step-by-step lexical analysis of a malformed input from the 2026 paper, plus 40 further confirmed patterns added from the 2016–2025 papers — finite automata and NFA-to-DFA construction, regular expressions and CFGs, top-down/bottom-up parsing and parse trees, lexers vs parsers, the compiler/interpreter/assembler pipeline, and code generation/optimization (register allocation, instruction scheduling, loop and peephole optimization, constant folding) — 54 questions total, now the deepest-covered topic in this index.
Quick-Reference: What Was Tested in 2026, at a Glance
| # | Topic | Question Theme | Type | Marks |
|---|---|---|---|---|
| 1 | Algorithms & DS | Why Binary Search needs sorted data | Theory | 6 |
| 2 | Algorithms & DS | Time complexity vs space complexity | Theory | 6 |
| 3 | Algorithms & DS | Stack-based postfix expression evaluation | Theory + example | 8 |
| 4 | Algorithms & DS | Data structure choice for millions of product IDs | Applied/scenario | 8 |
| 5 | Software Engineering | Why Maintenance is the costliest SDLC phase | Theory | 6 |
| 6 | Software Engineering | Purpose of Use Case Diagrams | Theory | 6 |
| 7 | Software Engineering | Why Agile needs frequent customer interaction | Theory | 8 |
| 8 | Software Engineering | Resolving conflicting requirements + SDLC impact | Applied/scenario | 6 |
| 9 | Compiler Construction | Constructing a DFA for (a | b)*abb | Numeric/construction |
| 10 | Compiler Construction | Lexeme vs token vs pattern | Theory | 6 |
| 11 | Compiler Construction | Register allocation for three-address code | Applied/scenario | 8 |
| 12 | Compiler Construction | Lexical analysis of a malformed input string | Applied/scenario | 6 |
⚠️
Wording throughout is paraphrased/summarized from the official 2026 FPSC past paper for study purposes, not reproduced verbatim in full. Always cross-check against the original paper PDF before an exam.