How this paper is set and answered
From the notes printed under FPSC's own Revised Scheme tables.
- Ratio of MCQs in compulsory papers for CE-2016 will be 20 MCQs in each paper except in the paper of Essay. Similarly there will be 20 MCQs from each optional paper except Pure Mathematics and Applied Mathematics.
Complete Computer Science Syllabus
The full official FPSC syllabus, reproduced section by section from the source document.
Paper I — 100 marks
Section-A (50 marks)
1Introduction to Computing
2 points
- Introduction to Information Technology and Computers, History of Computing, Computer HW and SW Details, Computer System Components and Communication System, Input & Output devices and their types, Storage Media and their types, Types of Computer Hardware, Software, and Programming languages, Information Representation & Number Systems, User interfaces, Major Software Issues, Creation, formatting, and maintenance of Computer documents, Usage of Word processors, Spread sheets, Power-Point, Email, Search Engines, Browsers, Messengers, and Internet , Computers & Society, Information Security/Privacy, Computer Crimes and Ethical Challenges, Viruses, Plagiarism, Intellectual Property Rights, Difference between computer science, software engineering, information technology, information systems, computer engineering and bioinformatics;
- IEEE / ACM computing disciplines guidelines.
2Programming Fundamentals
1 point
- Basic programming elements and concepts, Problem Solving & Program Design, Components of a programming language, Program development and execution, Program structure, Data types and variable declarations, Standard I/O streams, and statements, Control structures, Standard library functions, User defined functions and parameter passing, Arrays, pointers, and strings, Structures, unions, and bit manipulation operators.
3Object Oriented Paradigm
1 point
- Object Oriented Programming Concepts ( Object-oriented paradigm, data abstraction, encapsulation, inheritance, Polymorphism), Introduction to Classes and Objects ( classes, objects, data members, member functions), Classes Advanced ( friends, static, composition, this, const), Operator overloading (stream insertion, stream extraction, binary operator, unary operator), Inheritance (single inheritance, multiple inheritances, protected members, method over-riding), Polymorphism (virtual function, pure-virtual functions, abstract class, abstract super class), Standard Template Library (STL), Files & streams (sequential access files, random access files), File processing, Exception Handling
Section-B (50 marks)
4Algorithms & Data Structures
1 point
- Fundamental concepts, Properties of algorithms, Criteria for an Algorithm, Parameters for selecting an algorithm, Algorithm Representations, Pseudo Code and Flow Charts, Designing Algorithms, Algorithm Analysis and Asymptotic Notations, Classification of Lists, Abstract Data Types, Implementation of Stacks and Queues using ADTs, Searching and Sorting Algorithms (Linear Search, Binary Search, Bubble Sort, Merge Sort, Quick Sort, Heap Sort), Stacks and Queues, Hash Tables (Linear Probing, Bucketing, Chaining), Recursion, Trees (Binary Trees, Binary Search trees, AVL Trees, Two-Three Trees), Graphs, Heuristic (Guided) Search, Genetic Algorithms, Encryption Algorithms (DES, RSA)
5Software Engineering
1 point
- Software Processes, Software Process Models, Agile Software Development, Analysis Modeling, Requirements Engineering, Design Concepts, Architectural Design, Design & Implementation, Software Testing, System Delivery and Maintenance, Software Evolution Formal Specification, Software Quality Assurance, Introduction to Proofs of Correctness (LNO), Distributed Software Engineering, Aspect-Oriented Software Engineering, Project Management, Process Improvement
6Compiler Construction
1 point
- Difference among various type of Translators, Phases of Compilers, Classification of Compilers, Lexical Analysis (Input buffering, Specification & Recognition of tokens, Regular expressions, Finite automata, Syntax Analysis (Context-free grammars and their classification, LL(k) vs. LR(k) grammars, Top-down vs. Bottom-Up parsers, Parsing Techniques, FIRST and FOLLOW sets, Predictive Parsing using LL(1) grammars, Syntax error handling and recovery strategies), Syntax Directed Translation (Synthesized attributes, Inherited attributes, Construction of syntax trees, Top-down translation), Semantic analysis (Symbol tables, Type Expressions, Type Checking of statements), Intermediate Code Generation, Code Generation (Issues in the design of code generation, The target machine, Run-time storage management, Register allocation), Code optimization (Elimination of Redundant code, Folding of Constant, Loop optimization, Peephole optimization, Problems of optimization)
Paper II — 100 marks
Section-A (50 marks)
7Computer Organization & Architecture
1 point
- Fundamental concepts, Overview of a Computer System, Evolution & Performance Languages, Architectural levels, Virtual machines, Processor types, Metrics, Machine instructions, Instruction execution cycle, CISC vs. RISC, Parallelism, Internal/External data representation, Computer Function and Interconnections, Cache Memory, Internal Memory, External Memory, Input /Output System, Computer Arithmetic Microprocessor and its Bus Structure, I/O Types, Types of Buses, Memory Organization and Structure, information flow and execution in Machine, Instruction Representation, Machine Instruction Characteristics, Instruction Processing, Processor Structure & Function, Control Unit Operation, Micro-programmed Control, Instruction-Level Parallelism And Superscalar Processors, Parallel Processing, Multi-Processor and Multi-core Systems
8Computer Communications & Networks
1 point
- Basic Concepts and Classification of Networks, Circuit switching, Packet switching, Multiplexing (TDM, FDM), Layering: OSI and TCP/IP, Application Layer (Network application architectures, HTTP, FTP, Email, DNS, P2P applications), Transport Layer (Multiplexing in UDP and TCP, Connectionless Transport: UDP, Reliable data transfer and TCP, Congestion avoidance and control), Network Layer (The Internet Protocol, IPv4 Datagram, Internet Address Classes, Special IP Addresses ARP, IPv6, ICMP, Network Address Translation (NAT), Internet Routing Protocols and Algorithms, X.25, Frame relay and ATM, MPLS), Physical & Link Layer Functionalities (Error Detection & Control, ARQ, Link layer addressing, LAN Technologies, Bridges and Hubs, Multiple Access), Special topics (Security, Overlay networks, naming, Content distribution networks, Peer to peer systems, DHTs, Network Attacks)
9Operating Systems Concepts
1 point
- Roles of an Operating System, Operating-System Evolution, Structures, and Operations, Classification of Operating Systems, Computing Environments, Design and Components of OS, Process Management, Process Synchronization, Deadlocks, Memory Management, Virtual Memory Management, File Systems (UNIX and Windows Systems), I/O Management
Section-B (50 marks)
10Database Systems
1 point
- Introduction to Database Systems, Relational Data Model & Relational Database Constraints, Relational Data Model, SQL, Relational Algebra & Calculus, ER Model, ER to Relational Mapping, PL/SQL Stored Procedures & Triggers, Functional Dependencies and Normalization, Storage & Indexing, Indexing Structure, XML documents & Web Services, Query Processing & Evaluation, Query Optimization, Transaction processing, Object- Oriented Databases, Distributed Databases, Database Security & Access Control
11Digital Image Processing
2 points
- The relation between Image Processing, Computer Graphics, Computer Vision and Artificial Intelligence; Image Sensing and Acquisition Techniques; Representing Digital Image;
- Image Sampling and Quantization; Image Storage and Operations; Image Transformations (Translation, Scaling, Rotation, Shear); Image Histogram; Image Enhancement (Contrast, Smoothing, Sharpening); Gray-scale and Color Images; Color Models (RGB, CMYK and HIS); Image Restoration; Noise Models; Morphological Operators (Erosion, Dilation, Opening, Closing, Skeletonization, Thinning); Image Segmentation; Point Detection, Line Detection, Edge Detection and Boundary Detection; Image Compression
12Web Engineering & Technologies
1 point
- Modeling techniques for web applications, Introduction to web engineering, requirement engineering, requirement, types of requirements, functional requirements, non functional requirements, Requirement engineering process (Elicitation and negotiation, Documentation, Validation and verification, Management), HTML(hypertext markup language), Software Architecture, Styles, Patterns, and frameworks, Components of Web Architecture, Classifications of web architecture , Web Application layered architecture ( client server, n- layered, JSP model, struts, OOHDM ), Integration Architecture, Data Aspect architectures, Cascading Style Sheet(CSS), CSS properties, JavaScript (Functionalities, Events, Variables, Operators), DOM(Document Object Model), XML, RSS, API, Client-side programming using (HTML, XHTML, XML, JavaScript, and CSS), Server- side programming using PHP, Web development process, Web Application Development Methodologies, Web site promotion and deployment, Web applications Issues (Accessibility, testing, performance, operation, maintenance, security)
Scoring High in Computer Science (CSS)
The CSS Computer Science subject tests an aspirant's foundational knowledge across various domains of computing, from hardware and software basics to advanced concepts in programming, networking, and databases. It is structured into two papers, each carrying 100 marks, covering both theoretical underpinnings and practical application areas. A strong script demonstrates not only accurate technical definitions but also a clear understanding of inter-topic relationships, problem-solving approaches, and the ability to articulate complex concepts logically and concisely.
Computer Science is a solid 200-mark choice for candidates with a software engineering, IT, or computer science background. It offers an incredibly structured syllabus with objective, highly predictable question patterns.
1. Structuring Technical Answers (Paper I): Paper I focuses on computer architecture, programming concepts, data structures, and software engineering. Practice writing clean pseudo-code, C++ or Java snippets, and drawing accurate flowcharts or UML diagrams for algorithms. Code snippets act as mathematical proofs ensuring full marks.
2. Diagrams and Flowcharts (Paper II): Paper II delves into relational databases, operating systems, and networking protocols. Drawing Entity-Relationship (ER) models, process state diagrams, and understanding OSI layers visually are fundamental to scoring.
3. Emerging Technologies: Stay deeply updated on emerging tech trends like Artificial Intelligence, Cloud Computing, Cyber Security, and Big Data. FPSC examiners highly appreciate and actively test modern tech applications linking legacy knowledge to modern industry uses.
Paper by paper
Paper I focuses on core computer science principles including programming fundamentals, object-oriented concepts, algorithms, data structures, software engineering, and compiler construction. Prioritise a deep understanding of problem-solving techniques, algorithm analysis, and the software development lifecycle. Strong command over C++ based programming concepts and data structures is crucial.
Paper II covers computer organisation, architecture, networks, operating systems, database systems, digital image processing, and web technologies. Focus on understanding system-level interactions, data management principles, and the architecture of modern applications. Practical aspects of networking, database design, and web development should be thoroughly studied.
A six-month plan
- 1Phase 1: FoundationsWeeks 1-6
Establish a strong base by covering 'Introduction to Computing', 'Programming Fundamentals', and 'Object Oriented Paradigm'. Focus on understanding basic computer components, information representation, and core programming concepts like control structures, functions, arrays, and the principles of object-oriented programming.
- 2Phase 2: Core Theory & Problem SolvingWeeks 7-12
Delve into 'Algorithms & Data Structures', 'Software Engineering', and 'Compiler Construction'. Emphasise algorithm analysis, different data structures and their implementations, software process models, and the phases of compiler design. Practice designing and analysing algorithms.
- 3Phase 3: System Architecture & NetworksWeeks 13-18
Focus on 'Computer Organization & Architecture', 'Computer Communications & Networks', and 'Operating Systems Concepts'. Understand the internal workings of a computer, network layering models (OSI/TCP-IP), routing, and the various functions and management techniques of operating systems.
- 4Phase 4: Advanced ApplicationsWeeks 19-24
Study 'Database Systems', 'Digital Image Processing', and 'Web Engineering & Technologies'. Concentrate on relational database models, SQL, normalisation, image processing techniques, and the architecture and technologies involved in web application development.
- 5Phase 5: Revision & PracticeWeeks 25-26
Comprehensive revision of all syllabus sections. Practice past papers, focusing on structuring answers, time management, and identifying areas requiring further attention. Consolidate understanding of inter-connected topics across papers.
Using CSSPrep.AI for Computer Science
Only the tools that genuinely support this subject are listed.
Use the Essay Writer to construct well-structured answers for complex theoretical questions. It helps in organising thoughts into a coherent thesis, outline, introduction, argument paragraphs, and conclusion.
Try: Discuss the various phases of compilers and explain the role of lexical analysis in detail.
Utilise Topic Explorer to break down syllabus topics into structured maps. This helps in understanding timelines, cause and effect, key actors (if applicable), arguments, and current relevance, especially for broader concepts.
Try: Explore the concepts of process management and synchronization in operating systems.
Engage with the MPT Trainer for diagnostic and adaptive MCQ practice. This tool helps in identifying weak areas in factual recall and conceptual understanding across all sections of the syllabus.
Submit your written answers to the Evaluator to receive detailed feedback against the CSS rubric. It provides scores on structure, content, evidence, and language, helping you refine your answer writing skills for Computer Science specific questions.
High-yield topics
Each one is traced back to the section of the official syllabus it comes from.
This is a fundamental paradigm in modern software development and forms the basis for many programming-related questions. A clear understanding of abstraction, encapsulation, inheritance, and polymorphism is essential.
Syllabus section: Object Oriented Paradigm
Understanding algorithm efficiency is critical for designing effective solutions. This topic often appears in questions related to data structures and algorithm comparisons.
Syllabus section: Algorithms & Data Structures
These concepts are central to understanding how software is developed and managed, reflecting modern industry practices and frequently tested in the Software Engineering section.
Syllabus section: Software Engineering
The OSI and TCP/IP models are the foundational frameworks for computer networking. Questions on network protocols and communication often refer back to these models.
Syllabus section: Computer Communications & Networks
These are core operating system concepts that explain how an OS manages tasks and resources, which are frequently examined for their theoretical and practical implications.
Syllabus section: Operating Systems Concepts
These are the bedrock of database systems, crucial for designing, querying, and maintaining databases. Questions often involve practical application of SQL and normalisation principles.
Syllabus section: Database Systems
Given the prevalence of web technologies, understanding web application architecture and the distinction between client-side and server-side programming is highly relevant and frequently tested.
Syllabus section: Web Engineering & Technologies
Common mistakes in Computer Science answers
- Providing vague or incomplete definitions for technical terms instead of precise, syllabus-aligned explanations.
- Failing to illustrate complex concepts with appropriate diagrams, such as for data structures, network models, or computer architecture.
- Confusing similar concepts, for example, different types of memory (cache, main, external) or various sorting algorithms.
- Not addressing all parts of a multi-part question, leading to loss of marks despite knowing some aspects.
- Poor time management, resulting in incomplete answers for some sections, especially in Paper II which has a broad syllabus.
- Relying solely on theoretical knowledge without demonstrating an understanding of practical implications or examples where relevant.
FPSC recommended books
The 24 books FPSC lists for Computer Science in the official syllabus.
| Title | Author |
|---|---|
| 1. C++ How to Program | Harvey M. Deitel and Paul J. Deitel. |
| 2. Compilers: Principles, Techniques, and Tools | Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman |
| 3. Operating System Concepts | Silberschatz, Galvin, and Gagne. John |
| 4. Operating Systems | William Stallings |
| 5. Computer Organization & Architecture | William Stallings |
| 6. Computer System Architecture | M. Morris Mano |
| 7. Computer Organization and Design: The Hardware/ Software Interface | David A. Patterson and John L. Hennessy |
| 8. Software Engineering | Ian Sommerville |
| 9. Software Engineering A Practitioner’s Approach | Roger S. Pressman |
| 10. Data Structures and Algorithm Analysis in C++ | Mark Allen Weiss |
| 11. Computer Networking: A Top Down approach featuring the Internet | James F. Kurose and Keith W. Ross |
| 12. Data and Computer Communications | William Stallings |
| 13. Computer Networks | Andrew Tanenbaum |
| 14. Fundamentals of Database Systems | Ramez Elmasri and S. B |
| 15. Database Systems Concepts | Silberchatz, Abraham & Korth, Sudarshan |
| 16. Web Services: Principles and Technology | Michael Papazoglu |
| 17. Electronic Commerce: The Second Wave, Ninth Edition | Gary P. Schneider |
| 18. Electronic-Commerce –A Managerial Perspective | Turban, Lee, King, Chung |
| 19. Web Engineering | Kappel, G., Proll, B. Reich, S. & Retschitzegger |
| 20. Styling Web Pages with CSS | Tom Negrino and Dori Smith |
| 21. PHP: The Good Parts | Peter B. MacIntyre |
| 22. Learn JavaScript | Chuck Easttom |
| 23. ADTs, Data Structures, and Problem Solving with C++ | Larry R. Nayhoff |
| 24. Digital Image Processing | Gonzalez and Woods |
Frequently asked questions
Is Computer Science a scoring subject for CSS?
Computer Science can be a scoring subject if candidates develop a strong conceptual understanding and articulate their answers clearly and precisely. Success depends on thorough preparation and effective presentation of technical knowledge.
How much programming knowledge is required for this subject?
A strong grasp of basic programming elements, object-oriented concepts, data types, control structures, functions, arrays, pointers, and strings, as outlined in Paper I, is essential. The syllabus specifically mentions C++ in the context of Data Structures and Algorithm Analysis.
Should I focus more on Paper I or Paper II?
Both Paper I and Paper II carry equal weight (100 marks each) and cover distinct but interconnected areas of computer science. A balanced approach to preparation, ensuring thorough coverage of all sections in both papers, is recommended for optimal results.
Are the FPSC recommended books mandatory to study?
The FPSC recommended books are valuable resources for in-depth understanding of the syllabus topics. While not strictly mandatory to read cover-to-cover, consulting them for specific concepts can provide a comprehensive perspective beyond basic notes.
How important are diagrams and flowcharts in answers?
Diagrams, flowcharts, and pseudo-code are highly beneficial for illustrating complex concepts in Computer Science, particularly in sections like Algorithms & Data Structures, Computer Organization & Architecture, and Computer Communications & Networks. They can enhance clarity and demonstrate a deeper understanding.
How can I manage the breadth of the Computer Science syllabus?
To manage the extensive syllabus, focus on understanding core concepts rather than rote memorisation. Prioritise high-yield topics, practice problem-solving, and regularly revise to connect concepts across different sections. A structured study plan is key.
Syllabus text reproduced from Revised Syllabi for CSS Competitive Examination, CE-2016 (updated 7 July 2015), pages 56-59. Marks and grouping are from the same document's Revised Scheme tables. Verify against the official PDF before relying on it.