Computer Science is a Group I optional in CSS, carrying 200 marks across two papers. It’s an excellent choice for candidates with a CS or engineering background — the syllabus is technical but well-defined, and the scoring potential is high. Below you can download Computer Science CSS Past Papers from 2000 to 2025, with paper pattern, syllabus, books, and a prep plan for CSS 2026.
Download Computer Science CSS Past Papers (Year-wise PDFs)
Paper Pattern (FPSC 2026)
- Paper I — Programming, data structures, algorithms, computer architecture, OS.
- Paper II — Databases, networks, software engineering, AI, cybersecurity, IT in Pakistan.
Each paper: 100 marks, 3 hours. Format: 20 MCQs + 4 subjective questions out of 8. Numerical and programming-style questions are common.
FPSC Syllabus Highlights
Paper I — Core CS
- Programming languages: C/C++, Java, Python — paradigms
- Data structures: arrays, lists, stacks, queues, trees, graphs, hashing
- Algorithms: sorting, searching, complexity (Big-O), divide & conquer, dynamic programming
- Computer architecture: CPU, memory, pipelining, RISC vs CISC
- Operating systems: processes, threads, scheduling, deadlocks, memory management
- Discrete math: logic, set theory, graph theory
Paper II — Applied CS
- Databases: relational model, SQL, normalisation, transactions, NoSQL
- Computer networks: OSI/TCP-IP, routing, switching, protocols
- Software engineering: SDLC, Agile, requirements, testing
- AI & ML basics: supervised/unsupervised, neural networks
- Cybersecurity: cryptography, threats, defences
- IT in Pakistan: digital transformation, PSEB, ICT policy
Most Repeated Topics (2016-2025)
- Time complexity analysis (Big-O) with examples
- Process synchronisation: semaphores, monitors, classic problems
- SQL queries, joins, normalisation up to BCNF
- Network layering, TCP vs UDP, IPv4 vs IPv6
- Object-oriented design principles
- Cryptography basics: symmetric vs asymmetric, hashing
- Agile vs Waterfall: when to use
- Pakistan’s IT industry: Software exports, freelancing, PSEB role
High-Scoring Strategy
- Cormen’s CLRS for algorithms is the gold reference; pick the chapters you need.
- Practice code by hand — Examiners want pseudocode for sorts, BFS/DFS, tree traversals.
- Diagrams & tables — OSI layers, normalisation forms, scheduling Gantt charts.
- Stay current — AI/ML developments, Pakistan’s ICT policy, cybersecurity incidents.
- Numericals — Big-O calculations, page-replacement algorithms, network throughput, SQL.
- Solve 8-10 past papers under timing.
Recommended Books
- Introduction to Algorithms — Cormen, Leiserson, Rivest, Stein (CLRS)
- Operating System Concepts — Silberschatz, Galvin, Gagne
- Database System Concepts — Silberschatz, Korth, Sudarshan
- Computer Networking: A Top-Down Approach — Kurose & Ross
- Software Engineering — Sommerville
- Artificial Intelligence: A Modern Approach — Russell & Norvig
Frequently Asked Questions
Do I need a CS degree?
Strongly recommended. Non-CS candidates can take CS but the syllabus is technical and demands 4-6 months of focused preparation. Engineering / mathematics backgrounds adapt easiest.
Is Computer Science scoring?
Yes — strong candidates routinely score 140-170 out of 200. The subject rewards clean technical writing, correct pseudocode, and concise analysis.
Will I need to write code in the exam?
Yes — pseudocode for algorithms, SQL queries, and small program design questions are common. Practice writing them by hand under timing.