← Back to Optional Subjects
RAHBAR CSS SUBJECTIVE PREPARATION
Computer Science
465
Available Learning Modules
16
Learning Stages
Optional
CSS Subject Category
Orientation
6 modules01 CS-LEARN-001 What CSS Computer Science Really Tests
A 200-mark technical optional subject requiring conceptual clarity, algorithmic reasoning, programming competence, systems understanding and the ability to explain design trade-offs rather than merely reproduce definitions.
02 CS-LEARN-002 How Paper-I and Paper-II Fit Together
Paper-I builds computing, programming, object orientation, algorithms and data structures. Paper-II extends the candidate into computer architecture, networks, operating systems, databases, software engineering, image processing and web-oriented computing.
03 CS-LEARN-003 How to Study a Technical CSS Subject
For every topic learn definition, internal mechanism, representation or algorithm, complexity/performance, advantages, limitations, applications and one worked example.
04 CS-LEARN-004 Technical Answer Architecture
A strong answer normally combines a precise definition, labeled diagram or pseudocode where relevant, mechanism, example, complexity or trade-off analysis and a concise conclusion.
05 CS-LEARN-005 Pseudocode Discipline
Pseudocode should expose algorithmic logic independently of programming-language syntax and make initialization, conditions, loops and outputs unambiguous.
06 CS-LEARN-006 Complexity Thinking
Evaluate solutions not only by correctness but also by time, space, scalability and input characteristics.
Introduction to Computing
32 modules07 CS-LEARN-007 History and Evolution of Computing
Understand major generations and conceptual transitions from mechanical calculation to electronic, stored-program, networked and modern computing.
08 CS-LEARN-008 Information Technology and Computer Systems
Distinguish data, information, computing and information technology and understand the computer as an integrated processing system.
09 CS-LEARN-009 Computer Hardware
Understand processor, memory, storage, buses, peripherals and interfaces as cooperating physical components.
10 CS-LEARN-010 Computer Software
Distinguish system software, application software, utilities, firmware and development software.
11 CS-LEARN-011 Computer System Components
Explain input, processing, storage, output and communication functions and their relationships.
12 CS-LEARN-012 Communication Systems
Understand sender, receiver, medium, protocol, encoding and transmission as core elements of digital communication.
13 CS-LEARN-013 Input Devices
Compare keyboard, pointing, scanning, sensing, audio, biometric and specialized input technologies.
14 CS-LEARN-014 Output Devices
Understand displays, printers, audio output and specialized output devices through function and performance characteristics.
15 CS-LEARN-015 Storage Media
Compare magnetic, optical, semiconductor and network/cloud storage by speed, capacity, volatility, durability and use.
16 CS-LEARN-016 Types of Computers
Understand embedded, personal, workstation, server, mainframe, high-performance and distributed computing contexts.
17 CS-LEARN-017 Programming Languages
Distinguish machine, assembly and high-level languages and understand compilation, interpretation and execution.
18 CS-LEARN-018 Information Representation
Understand bits, bytes, characters, integers, floating-point concepts and encoding.
19 CS-LEARN-019 Binary Number System
Convert and perform basic operations in base two and understand positional representation.
20 CS-LEARN-020 Octal and Hexadecimal Systems
Use compact base-8 and base-16 representations and convert between common number systems.
21 CS-LEARN-021 Signed Number Representation
Understand sign-magnitude, one's complement and two's complement, emphasizing why two's complement dominates integer arithmetic.
22 CS-LEARN-022 Character Encoding
Understand ASCII, Unicode and the need for interoperable character representation.
23 CS-LEARN-023 User Interfaces
Compare command-line, graphical, menu, touch, voice and other interaction paradigms.
24 CS-LEARN-024 Word Processing
Understand document creation, formatting, styles, references, review and maintenance as information-processing functions.
25 CS-LEARN-025 Spreadsheets
Understand cells, formulas, functions, references, sorting, filtering, charts and analytical use.
26 CS-LEARN-026 Presentation Software
Understand structured slide communication, multimedia and presentation design at a conceptual level.
27 CS-LEARN-027 Email and Messaging
Understand addressing, message transfer, attachments, security risks and appropriate digital communication.
28 CS-LEARN-028 Search Engines and Browsers
Distinguish web browsers from search engines and understand crawling, indexing, querying and retrieval conceptually.
29 CS-LEARN-029 Internet Fundamentals
Understand internet architecture, addressing, protocols, clients, servers and services.
30 CS-LEARN-030 Computers and Society
Analyze productivity, access, automation, employment, surveillance, digital divide and social consequences.
31 CS-LEARN-031 Information Security and Privacy
Understand confidentiality, integrity, availability, authentication, authorization and privacy principles.
32 CS-LEARN-032 Computer Crime
Recognize unauthorized access, fraud, malware, identity abuse and other cyber offenses conceptually without operational misuse.
33 CS-LEARN-033 Viruses and Malware
Distinguish viruses, worms, trojans, ransomware and related malware by propagation and impact at a defensive conceptual level.
34 CS-LEARN-034 Plagiarism
Understand academic and software plagiarism, attribution and ethical reuse.
35 CS-LEARN-035 Intellectual Property Rights
Distinguish copyright, patents, licensing and trade secrets in computing contexts.
36 CS-LEARN-036 Computing Ethics
Analyze professional responsibility, privacy, safety, bias, security and intellectual-property dilemmas.
37 CS-LEARN-037 Computing Disciplines
Distinguish computer science, software engineering, IT, information systems, computer engineering and bioinformatics by primary focus.
38 CS-LEARN-038 IEEE and ACM Professional Context
Understand the role of professional bodies and curriculum/professional guidance in computing.
Programming Fundamentals
25 modules39 CS-LEARN-039 Problem Solving and Program Design
Translate a problem into inputs, outputs, constraints, decomposition, algorithm and test cases before coding.
40 CS-LEARN-040 Program Development Cycle
Understand requirements, design, coding, compilation/interpretation, testing, debugging, deployment and maintenance.
41 CS-LEARN-041 Program Structure
Understand declarations, statements, functions/modules and control flow in structured programs.
42 CS-LEARN-042 Variables and Constants
Use named storage with appropriate type, scope and lifetime.
43 CS-LEARN-043 Primitive Data Types
Understand integer, floating-point, character, Boolean and related basic representations.
44 CS-LEARN-044 Operators and Expressions
Use arithmetic, relational, logical, assignment and bitwise operators with correct precedence.
45 CS-LEARN-045 Standard Input and Output
Understand console/stream-based input-output and validation.
46 CS-LEARN-046 Selection Structures
Use if, if-else and multiway selection to express conditional behavior.
47 CS-LEARN-047 Iteration Structures
Use while, do-while and for loops and reason about termination and invariants.
48 CS-LEARN-048 Nested Control Structures
Analyze nested selection and loops while managing complexity.
49 CS-LEARN-049 Functions
Use functions for decomposition, reuse, abstraction and testability.
50 CS-LEARN-050 Parameter Passing
Understand value, reference/address concepts and side effects.
51 CS-LEARN-051 Scope and Lifetime
Distinguish local, global/static and block scope and reason about object lifetime.
52 CS-LEARN-052 Recursion Fundamentals
Define a base case and recursive reduction and understand stack behavior.
53 CS-LEARN-053 Arrays
Store homogeneous collections in contiguous indexed structures and reason about traversal.
54 CS-LEARN-054 Multidimensional Arrays
Represent tables and matrices and perform nested traversal.
55 CS-LEARN-055 Pointers
Understand addresses, dereferencing, pointer arithmetic concepts and safe use.
56 CS-LEARN-056 Strings
Understand character sequences, termination/length concepts and common operations.
57 CS-LEARN-057 Structures
Group heterogeneous fields into a single record-like type.
58 CS-LEARN-058 Unions
Understand shared-memory representation among alternative members.
59 CS-LEARN-059 Bit Manipulation
Use masks, shifts and bitwise operations conceptually for low-level representation.
60 CS-LEARN-060 Standard Library Functions
Use library abstractions appropriately while understanding inputs, outputs and side effects.
61 CS-LEARN-061 Testing and Debugging
Use test cases, tracing, assertions and debugging to isolate defects.
62 CS-LEARN-062 Programming Errors
Distinguish syntax, runtime and logical errors.
63 CS-LEARN-063 Defensive Programming
Validate assumptions and inputs and design predictable failure handling.
Object-Oriented Programming
28 modules64 CS-LEARN-064 Object-Oriented Paradigm
Model systems as interacting objects combining state and behavior.
65 CS-LEARN-065 Classes and Objects
Distinguish a class definition from its instantiated objects.
66 CS-LEARN-066 Data Members and Member Functions
Encapsulate object state and operations inside class boundaries.
67 CS-LEARN-067 Data Abstraction
Expose essential behavior while hiding unnecessary implementation detail.
68 CS-LEARN-068 Encapsulation
Control access to state and preserve class invariants through interfaces.
69 CS-LEARN-069 Constructors
Initialize objects into valid states.
70 CS-LEARN-070 Destructors and Resource Lifetime
Understand cleanup and deterministic resource-management concepts.
71 CS-LEARN-071 The this Reference
Understand how an instance method refers to its current object.
72 CS-LEARN-072 const Correctness
Use immutability/const concepts to express and enforce non-modifying behavior.
73 CS-LEARN-073 Static Members
Understand data or behavior associated with the class rather than an individual instance.
74 CS-LEARN-074 Friend Functions and Classes
Understand controlled access exceptions and their encapsulation trade-offs.
75 CS-LEARN-075 Composition
Build complex objects from contained objects and prefer has-a relationships where appropriate.
76 CS-LEARN-076 Inheritance
Reuse and specialize behavior through is-a relationships.
77 CS-LEARN-077 Single and Multiple Inheritance
Understand inheritance structures and ambiguity/design issues.
78 CS-LEARN-078 Protected Members
Understand protected accessibility and its design implications.
79 CS-LEARN-079 Method Overriding
Provide subclass-specific behavior for inherited operations.
80 CS-LEARN-080 Polymorphism
Use a common interface to support different runtime behaviors.
81 CS-LEARN-081 Virtual Functions
Understand dynamic dispatch through virtual behavior.
82 CS-LEARN-082 Pure Virtual Functions
Use abstract operations to define required interfaces.
83 CS-LEARN-083 Abstract Classes
Represent incomplete general concepts that cannot be instantiated directly.
84 CS-LEARN-084 Operator Overloading
Define meaningful operator behavior for user-defined types without obscuring semantics.
85 CS-LEARN-085 Stream Operators
Understand insertion/extraction overloading for object I/O.
86 CS-LEARN-086 Templates and Generic Programming
Parameterize algorithms and data structures by type.
87 CS-LEARN-087 Standard Template Library
Understand containers, iterators and algorithms as reusable generic abstractions.
88 CS-LEARN-088 Exception Handling
Separate exceptional failure handling from normal control flow using throw/catch concepts.
89 CS-LEARN-089 Sequential File Access
Process file data in ordered sequence.
90 CS-LEARN-090 Random File Access
Access selected file positions/records without processing all preceding data.
91 CS-LEARN-091 Object-Oriented Design Quality
Evaluate cohesion, coupling, responsibility allocation, reuse and maintainability.
Algorithms & Data Structures
47 modules92 CS-LEARN-092 What Is an Algorithm?
An algorithm is a finite, unambiguous and effective procedure transforming input into output.
93 CS-LEARN-093 Algorithm Properties and Criteria
Analyze finiteness, definiteness, input, output, effectiveness and correctness.
94 CS-LEARN-094 Algorithm Representation
Use natural language, pseudocode, flowcharts and code according to purpose.
95 CS-LEARN-095 Algorithm Design Strategy
Decompose problems and select representations and operations that fit constraints.
96 CS-LEARN-096 Algorithm Correctness
Reason about whether an algorithm produces required output for all valid inputs.
97 CS-LEARN-097 Time Complexity
Express growth of running time as input size increases.
98 CS-LEARN-098 Space Complexity
Measure additional memory requirements as input size increases.
99 CS-LEARN-099 Asymptotic Notation
Understand Big-O, Big-Omega and Big-Theta as bounds on growth.
100 CS-LEARN-100 Best, Average and Worst Cases
Distinguish input-dependent performance scenarios.
101 CS-LEARN-101 Abstract Data Types
Specify data and operations independently from implementation.
102 CS-LEARN-102 Lists
Understand sequential and linked representations and their operation trade-offs.
103 CS-LEARN-103 Singly Linked Lists
Implement conceptual insertion, deletion, search and traversal using nodes and links.
104 CS-LEARN-104 Doubly Linked Lists
Use forward/backward links and understand memory and update trade-offs.
105 CS-LEARN-105 Stacks
Use last-in-first-out behavior for calls, parsing, undo and expression processing.
106 CS-LEARN-106 Stack Implementation
Implement stacks using arrays or linked structures and analyze overflow/underflow.
107 CS-LEARN-107 Queues
Use first-in-first-out behavior for scheduling and buffering.
108 CS-LEARN-108 Queue Implementation
Implement linear/circular or linked queues and analyze operations.
109 CS-LEARN-109 Priority Queues
Serve elements according to priority rather than arrival order.
110 CS-LEARN-110 Linear Search
Scan sequentially and analyze O(n) behavior.
111 CS-LEARN-111 Binary Search
Search sorted data by repeated halving and understand O(log n) behavior and preconditions.
112 CS-LEARN-112 Bubble Sort
Understand repeated adjacent exchanges and quadratic behavior.
113 CS-LEARN-113 Insertion Sort
Build a sorted prefix and understand when its simplicity/adaptiveness is useful.
114 CS-LEARN-114 Selection Sort
Repeatedly select an extreme element and analyze its quadratic comparisons.
115 CS-LEARN-115 Merge Sort
Use divide-and-conquer merging for O(n log n) time with additional storage.
116 CS-LEARN-116 Quick Sort
Partition around a pivot and analyze average and worst-case behavior.
117 CS-LEARN-117 Heap Sort
Use heap structure for O(n log n) sorting with characteristic space/performance trade-offs.
118 CS-LEARN-118 Hash Tables
Map keys to table positions and understand average-case lookup efficiency.
119 CS-LEARN-119 Hash Functions
Design/discuss deterministic key distribution and collision implications.
120 CS-LEARN-120 Linear Probing
Resolve collisions through open addressing and understand clustering.
121 CS-LEARN-121 Bucketing
Group multiple keys/records into bucket structures.
122 CS-LEARN-122 Chaining
Resolve collisions using per-slot linked collections.
123 CS-LEARN-123 Trees
Understand hierarchical node-edge structures and terminology.
124 CS-LEARN-124 Binary Trees
Represent nodes with at most two children and perform standard traversals.
125 CS-LEARN-125 Tree Traversals
Understand preorder, inorder, postorder and level-order traversal.
126 CS-LEARN-126 Binary Search Trees
Maintain ordering for search/insertion/deletion and analyze imbalance.
127 CS-LEARN-127 AVL Trees
Use rotations to maintain height balance and logarithmic operations.
128 CS-LEARN-128 Two-Three Trees
Understand balanced multiway search-tree principles.
129 CS-LEARN-129 Heaps
Maintain heap order for priority operations.
130 CS-LEARN-130 Graphs
Represent vertices and edges for networks and relationships.
131 CS-LEARN-131 Graph Representations
Compare adjacency matrix and adjacency list by density and operation needs.
132 CS-LEARN-132 Breadth-First Search
Explore graph layers using a queue and understand shortest paths in unweighted graphs.
133 CS-LEARN-133 Depth-First Search
Explore recursively/with a stack and understand traversal and structural applications.
134 CS-LEARN-134 Heuristic Search
Use problem-specific estimates to guide search while distinguishing heuristic quality from guaranteed optimality.
135 CS-LEARN-135 Genetic Algorithms
Understand population, fitness, selection, crossover and mutation as an evolutionary optimization approach.
136 CS-LEARN-136 DES: Conceptual Algorithm Structure
Understand symmetric block-cipher structure historically and conceptually; treat DES as legacy rather than current security advice.
137 CS-LEARN-137 RSA: Conceptual Algorithm Structure
Understand public/private key principles, modular arithmetic basis and uses conceptually without operational misuse.
138 CS-LEARN-138 Choosing a Data Structure
Match operations, scale, ordering, memory and update patterns to the appropriate structure.
Computer Architecture
21 modules139 CS-LEARN-139 Computer Architecture versus Organization
Distinguish programmer-visible design from implementation/organization details.
140 CS-LEARN-140 CPU Organization
Understand control unit, ALU, registers and datapath as core processor components.
141 CS-LEARN-141 Arithmetic Logic Unit
Understand arithmetic and logical operations and status effects.
142 CS-LEARN-142 Registers
Understand general-purpose and special-purpose registers and their speed role.
143 CS-LEARN-143 Flags and Status Registers
Interpret condition flags used by arithmetic and control operations.
144 CS-LEARN-144 System Buses
Understand address, data and control buses and their roles.
145 CS-LEARN-145 Instruction Cycle
Trace fetch, decode, execute and write-back conceptually.
146 CS-LEARN-146 Instruction Set Design
Compare instruction formats, addressing needs and design trade-offs.
147 CS-LEARN-147 Addressing Modes
Understand immediate, direct, indirect, register and indexed-style addressing concepts.
148 CS-LEARN-148 RISC and CISC
Compare simplified versus complex instruction-set philosophies without treating modern processors as pure examples.
149 CS-LEARN-149 Memory Hierarchy
Understand locality and trade-offs among registers, cache, main memory and secondary storage.
150 CS-LEARN-150 Cache Memory
Understand hits, misses, mapping and locality at a conceptual level.
151 CS-LEARN-151 Virtual Memory Architecture
Understand how virtual addressing extends/protects process address spaces.
152 CS-LEARN-152 Main and Secondary Memory
Compare volatility, capacity, latency and persistence.
153 CS-LEARN-153 Peripheral Communication
Understand programmed I/O, interrupts and direct-memory-access concepts.
154 CS-LEARN-154 Interrupts
Understand asynchronous events, context handling and priority concepts.
155 CS-LEARN-155 Pipelining
Overlap instruction stages to improve throughput and understand hazards.
156 CS-LEARN-156 Pipeline Hazards
Distinguish structural, data and control hazards and basic mitigation.
157 CS-LEARN-157 Multiprocessors
Understand multiple processing units, shared resources and coordination.
158 CS-LEARN-158 Thread-Level Parallelism
Exploit concurrent threads while recognizing synchronization and workload limits.
159 CS-LEARN-159 Performance Measurement
Understand latency, throughput, clock rate, CPI and why no single metric tells the whole story.
Operating Systems
33 modules160 CS-LEARN-160 Purpose of an Operating System
The OS mediates applications and hardware and manages resources, protection and abstractions.
161 CS-LEARN-161 System Calls
Understand controlled interfaces through which programs request OS services.
162 CS-LEARN-162 Processes
Understand process state, address space, resources and execution context.
163 CS-LEARN-163 Process States
Trace new, ready, running, waiting/blocked and terminated states.
164 CS-LEARN-164 Process Control Block
Understand metadata required to manage and resume a process.
165 CS-LEARN-165 Threads
Understand multiple execution flows within a process and shared-resource implications.
166 CS-LEARN-166 Multithreading
Analyze responsiveness, parallelism and synchronization issues.
167 CS-LEARN-167 CPU Scheduling
Understand scheduling goals such as utilization, throughput, turnaround, waiting and response time.
168 CS-LEARN-168 FCFS Scheduling
Analyze first-come-first-served behavior and convoy effects.
169 CS-LEARN-169 Shortest-Job Scheduling
Understand optimal average waiting under ideal knowledge and practical limitations.
170 CS-LEARN-170 Priority Scheduling
Understand priority-based selection and starvation/aging.
171 CS-LEARN-171 Round-Robin Scheduling
Use time quanta for interactive sharing and analyze quantum trade-offs.
172 CS-LEARN-172 Context Switching
Understand saving/restoring execution state and its overhead.
173 CS-LEARN-173 Process Synchronization
Coordinate concurrent access to shared state.
174 CS-LEARN-174 Critical Section Problem
Understand mutual exclusion, progress and bounded waiting requirements.
175 CS-LEARN-175 Semaphores and Mutexes
Use synchronization primitives conceptually and recognize misuse risks.
176 CS-LEARN-176 Deadlocks
Understand mutual exclusion, hold-and-wait, no preemption and circular wait.
177 CS-LEARN-177 Deadlock Prevention and Avoidance
Distinguish breaking necessary conditions from keeping the system in safe states.
178 CS-LEARN-178 Deadlock Detection and Recovery
Allow, detect and recover from deadlock under appropriate policies.
179 CS-LEARN-179 Memory Management
Allocate, protect and translate memory for processes.
180 CS-LEARN-180 Contiguous Allocation and Fragmentation
Understand internal/external fragmentation and allocation trade-offs.
181 CS-LEARN-181 Paging
Divide virtual and physical memory into fixed-size pages/frames.
182 CS-LEARN-182 Page Tables and TLB
Understand address translation and caching of translations.
183 CS-LEARN-183 Demand Paging
Load pages when needed and understand page faults.
184 CS-LEARN-184 Page Replacement
Compare FIFO, optimal and LRU concepts and performance.
185 CS-LEARN-185 Thrashing
Understand excessive paging caused by insufficient working memory.
186 CS-LEARN-186 File Systems
Understand files, directories, metadata, allocation and protection.
187 CS-LEARN-187 File Allocation
Compare contiguous, linked and indexed allocation conceptually.
188 CS-LEARN-188 Directory Structures
Understand single-level, tree and graph-like directory organization.
189 CS-LEARN-189 UNIX and Windows File-System Concepts
Compare hierarchy, permissions, naming and organizational principles at a conceptual level.
190 CS-LEARN-190 I/O Management
Understand device drivers, buffering, caching and spooling.
191 CS-LEARN-191 Protection and Security in OS
Understand authentication, authorization, isolation and least privilege.
192 CS-LEARN-192 Virtualization
Understand abstraction of computing resources and separation of guest environments.
Database Systems
31 modules193 CS-LEARN-193 Database Systems
Understand why managed databases improve sharing, consistency, security and controlled access over isolated files.
194 CS-LEARN-194 DBMS Architecture
Understand users, schemas, storage manager, query processor and transaction services.
195 CS-LEARN-195 Data Models
Compare relational and other models conceptually.
196 CS-LEARN-196 Entity-Relationship Modeling
Represent entities, attributes, relationships, cardinality and participation.
197 CS-LEARN-197 Keys
Distinguish super, candidate, primary, alternate and foreign keys.
198 CS-LEARN-198 Relational Model
Represent data as relations with tuples, attributes and integrity constraints.
199 CS-LEARN-199 Relational Algebra
Understand selection, projection, union, difference, product and join as formal query operations.
200 CS-LEARN-200 SQL Fundamentals
Use declarative data definition and manipulation concepts.
201 CS-LEARN-201 SELECT Queries
Understand projection, filtering, ordering and aggregation.
202 CS-LEARN-202 SQL JOINs
Combine related tables correctly and understand inner/outer join semantics.
203 CS-LEARN-203 Nested Queries
Use subqueries where logically appropriate and understand readability/performance concerns.
204 CS-LEARN-204 Aggregation and GROUP BY
Compute grouped summaries and distinguish WHERE from HAVING.
205 CS-LEARN-205 Functional Dependencies
Represent attribute-determination relationships that guide normalization.
206 CS-LEARN-206 Normalization
Reduce harmful redundancy and update anomalies through principled decomposition.
207 CS-LEARN-207 First Normal Form
Require atomic relation values within the relational model.
208 CS-LEARN-208 Second Normal Form
Remove inappropriate partial dependency on a composite key.
209 CS-LEARN-209 Third Normal Form
Remove relevant transitive dependency while preserving meaningful design.
210 CS-LEARN-210 BCNF
Apply a stronger determinant-based normalization criterion where required.
211 CS-LEARN-211 Transactions
Understand atomic units of database work.
212 CS-LEARN-212 ACID Properties
Understand atomicity, consistency, isolation and durability.
213 CS-LEARN-213 Concurrency Control
Preserve correctness under simultaneous transactions.
214 CS-LEARN-214 Serializability
Use equivalence to serial execution as a correctness concept.
215 CS-LEARN-215 Locking
Understand shared/exclusive locks and basic two-phase-locking concepts.
216 CS-LEARN-216 Database Deadlocks
Understand circular lock waits and management strategies.
217 CS-LEARN-217 Recovery
Use logging/checkpoints and recovery principles to restore consistency after failure.
218 CS-LEARN-218 Database Security
Apply authentication, authorization, roles, least privilege and auditing.
219 CS-LEARN-219 Views
Use virtual relations for abstraction and controlled access.
220 CS-LEARN-220 Indexes
Improve access paths while recognizing storage and update costs.
221 CS-LEARN-221 Query Optimization
Understand logical/physical plans, selectivity and why equivalent SQL can differ in performance.
222 CS-LEARN-222 Distributed Databases
Understand fragmentation, replication, distributed transactions and consistency challenges.
223 CS-LEARN-223 Database Evolution and Emerging Systems
Understand why distributed, NoSQL/cloud and large-scale systems emerged from changing workload requirements.
Computer Networks
30 modules224 CS-LEARN-224 Data Communications Fundamentals
Understand sender, receiver, message, medium, encoding and protocol.
225 CS-LEARN-225 Analog and Digital Signals
Understand basic signal representation and transmission implications.
226 CS-LEARN-226 Bandwidth and Throughput
Distinguish theoretical capacity from achieved data rate.
227 CS-LEARN-227 Transmission Modes
Understand simplex, half-duplex and full-duplex communication.
228 CS-LEARN-228 Synchronous and Asynchronous Transmission
Compare timing/coordination approaches.
229 CS-LEARN-229 Network Types
Distinguish LAN, MAN and WAN by scope and architecture.
230 CS-LEARN-230 Network Topologies
Compare bus, star, ring, mesh and hybrid structures by resilience and cost.
231 CS-LEARN-231 OSI Model
Understand seven-layer responsibilities and encapsulation.
232 CS-LEARN-232 TCP/IP Model
Understand practical internet-layer architecture and mapping to OSI concepts.
233 CS-LEARN-233 Physical Layer
Understand transmission media, signaling and bit transport conceptually.
234 CS-LEARN-234 Data Link Layer
Understand framing, MAC addressing, error detection and medium access.
235 CS-LEARN-235 Network Layer
Understand logical addressing, routing and packet forwarding.
236 CS-LEARN-236 Transport Layer
Understand end-to-end process communication, reliability and flow concepts.
237 CS-LEARN-237 Application Layer
Understand services such as web, naming and email at protocol level.
238 CS-LEARN-238 IPv4 Addressing
Understand address structure, subnet concepts and private/public addressing.
239 CS-LEARN-239 IPv6 Orientation
Understand expanded addressing and key architectural motivations.
240 CS-LEARN-240 Subnetting
Reason about network/host portions and address allocation.
241 CS-LEARN-241 Routing
Understand route selection, forwarding tables and static/dynamic approaches.
242 CS-LEARN-242 TCP
Understand connection-oriented reliable byte-stream transport, sequencing and acknowledgments.
243 CS-LEARN-243 UDP
Understand connectionless datagram transport and its latency/overhead trade-offs.
244 CS-LEARN-244 TCP versus UDP
Choose transport according to reliability, ordering, latency and application requirements.
245 CS-LEARN-245 DNS
Understand hierarchical name resolution.
246 CS-LEARN-246 HTTP and HTTPS
Understand request-response web communication and the security role of TLS conceptually.
247 CS-LEARN-247 Email Protocols
Understand SMTP and mailbox-access concepts.
248 CS-LEARN-248 Network Devices
Distinguish repeaters, switches, routers, gateways and access points.
249 CS-LEARN-249 Switching
Understand frame forwarding and basic LAN switching behavior.
250 CS-LEARN-250 Wireless Networks
Understand wireless access, mobility and shared-medium considerations.
251 CS-LEARN-251 Network Security Principles
Understand segmentation, authentication, encryption, firewalls and secure protocol use defensively.
252 CS-LEARN-252 Client-Server and Peer-to-Peer
Compare centralized service and peer interaction models.
253 CS-LEARN-253 Network Performance
Analyze latency, bandwidth, loss, congestion and application requirements.
Software Engineering
21 modules254 CS-LEARN-254 Software Engineering
Apply systematic engineering principles to specification, development, operation and maintenance of software.
255 CS-LEARN-255 Software Process
Understand activities from requirements through evolution.
256 CS-LEARN-256 Process Models
Compare waterfall, incremental, iterative and agile-style development by context.
257 CS-LEARN-257 Requirements Engineering
Elicit, analyze, specify, validate and manage stakeholder needs.
258 CS-LEARN-258 Functional Requirements
Specify services and observable system behavior.
259 CS-LEARN-259 Non-Functional Requirements
Specify quality constraints such as performance, security, usability and reliability.
260 CS-LEARN-260 Software Design
Transform requirements into architecture, components, interfaces and data structures.
261 CS-LEARN-261 Modularity
Decompose systems to manage complexity and change.
262 CS-LEARN-262 Cohesion and Coupling
Seek focused modules and controlled dependencies.
263 CS-LEARN-263 UML Orientation
Use standard diagrams to communicate structural and behavioral design where appropriate.
264 CS-LEARN-264 Software Testing
Design verification activities to reveal defects and build confidence.
265 CS-LEARN-265 Unit Testing
Test small components in isolation.
266 CS-LEARN-266 Integration Testing
Test interactions among combined components.
267 CS-LEARN-267 System and Acceptance Testing
Evaluate complete-system behavior and stakeholder acceptance criteria.
268 CS-LEARN-268 Black-Box and White-Box Testing
Distinguish specification-based from structure-aware testing.
269 CS-LEARN-269 Software Maintenance
Understand corrective, adaptive, perfective and preventive change.
270 CS-LEARN-270 Software Quality
Evaluate correctness, reliability, maintainability, usability, efficiency and security.
271 CS-LEARN-271 Configuration Management
Control versions, baselines and changes to software artifacts.
272 CS-LEARN-272 Project Estimation
Estimate effort, cost and schedule under uncertainty.
273 CS-LEARN-273 Software Risk Management
Identify, analyze, prioritize and mitigate project/product risks.
274 CS-LEARN-274 Professional Ethics in Software Engineering
Balance client, employer, public safety, privacy, intellectual property and professional competence.
Digital Image Processing
20 modules275 CS-LEARN-275 Digital Image Fundamentals
Represent an image as sampled and quantized spatial intensity/color data.
276 CS-LEARN-276 Image Sampling and Quantization
Understand spatial resolution, intensity resolution and aliasing implications.
277 CS-LEARN-277 Image Sensing and Acquisition
Understand the pipeline from physical scene and sensor to digital image.
278 CS-LEARN-278 CCD and CMOS Sensors
Compare common image-sensor technologies conceptually by architecture and performance trade-offs.
279 CS-LEARN-279 Pixel Relationships
Understand neighborhoods, adjacency, connectivity and regions.
280 CS-LEARN-280 Intensity Transformations
Use point operations conceptually for enhancement.
281 CS-LEARN-281 Histograms
Understand intensity distributions and histogram-based enhancement.
282 CS-LEARN-282 Spatial Filtering
Apply neighborhood operations for smoothing, sharpening and feature enhancement.
283 CS-LEARN-283 Noise and Smoothing
Understand common noise effects and filtering trade-offs.
284 CS-LEARN-284 Edge Detection
Understand gradient/change-based detection of significant boundaries.
285 CS-LEARN-285 Point and Line Detection
Understand local masks/operators for detecting isolated points and lines.
286 CS-LEARN-286 Boundary Detection
Understand extracting region boundaries from image structure.
287 CS-LEARN-287 Thresholding and Segmentation
Partition images using intensity or feature criteria.
288 CS-LEARN-288 Morphological Operations
Understand shape-oriented processing using structuring elements.
289 CS-LEARN-289 Erosion
Shrink foreground regions and remove small structures according to a structuring element.
290 CS-LEARN-290 Dilation
Expand foreground regions and bridge small gaps according to a structuring element.
291 CS-LEARN-291 Opening and Closing
Combine erosion/dilation for noise removal, gap filling and shape preservation.
292 CS-LEARN-292 Skeletonization and Thinning
Reduce shapes toward structural representations while preserving relevant topology.
293 CS-LEARN-293 Image Restoration versus Enhancement
Distinguish perceptual improvement from model-based recovery.
294 CS-LEARN-294 Image Processing Applications
Connect techniques to medical imaging, remote sensing, inspection, documents and computer vision.
Web Engineering
24 modules295 CS-LEARN-295 Web Architecture
Understand browser, server, network, application and data tiers.
296 CS-LEARN-296 Client-Server Web Model
Trace requests and responses between clients and web servers.
297 CS-LEARN-297 HTML
Understand semantic document structure and forms conceptually.
298 CS-LEARN-298 CSS
Understand presentation, layout and separation of content from styling.
299 CS-LEARN-299 JavaScript
Understand client-side behavior, events and dynamic document interaction.
300 CS-LEARN-300 DOM
Understand the document object model as a programmable tree representation.
301 CS-LEARN-301 Client-Side Programming Patterns
Compare organization of browser-side code for maintainability and performance.
302 CS-LEARN-302 Server-Side Programming
Understand request processing, business logic, sessions and database interaction.
303 CS-LEARN-303 Web Application Architecture
Compare layered, MVC-style and service-oriented organization.
304 CS-LEARN-304 State and Sessions
Understand why HTTP is stateless and how applications maintain user state safely.
305 CS-LEARN-305 Cookies
Understand browser-stored state, scope and privacy/security considerations.
306 CS-LEARN-306 Web Forms and Validation
Use both client-side usability checks and authoritative server-side validation.
307 CS-LEARN-307 Database-Backed Web Applications
Understand safe data access, transactions and separation of concerns.
308 CS-LEARN-308 REST APIs
Understand resource-oriented interfaces, HTTP methods, representations and statelessness.
309 CS-LEARN-309 GraphQL Orientation
Understand schema-driven querying and trade-offs compared with REST-style APIs.
310 CS-LEARN-310 API Design Trade-offs
Evaluate payload efficiency, caching, coupling, versioning, authorization and maintainability.
311 CS-LEARN-311 JSON and Data Exchange
Understand structured web data representation and serialization.
312 CS-LEARN-312 Web Security Fundamentals
Understand authentication, authorization, input validation, secure sessions and transport security defensively.
313 CS-LEARN-313 Injection Prevention
Use parameterized data access and validation as defensive principles.
314 CS-LEARN-314 Cross-Site Scripting Prevention
Understand output encoding, content handling and browser security controls defensively.
315 CS-LEARN-315 Web Performance
Analyze latency, caching, payload size, database access and rendering costs.
316 CS-LEARN-316 Web Accessibility and Usability
Design interfaces that remain usable and accessible across users and devices.
317 CS-LEARN-317 Web Testing
Test functionality, compatibility, performance, security and usability systematically.
318 CS-LEARN-318 Web Deployment and Maintenance
Understand configuration, logging, monitoring, backups and controlled releases.
Exam Method & Evaluation
27 modules319 CS-LEARN-319 How to Answer a Programming Question
State assumptions, present readable code or pseudocode, trace important cases and discuss complexity or edge cases.
320 CS-LEARN-320 How to Answer an Algorithm Question
Define the problem, give algorithm/pseudocode, demonstrate with an example, prove or justify correctness where needed and state complexity.
321 CS-LEARN-321 How to Answer a Data-Structure Question
Define structure, illustrate representation, explain operations and compare time/space trade-offs.
322 CS-LEARN-322 How to Answer an Architecture Question
Use a labeled block diagram and trace data/control flow rather than listing component names.
323 CS-LEARN-323 How to Answer an Operating-System Question
Identify the resource/problem, explain the OS mechanism, show states or algorithm where relevant and evaluate trade-offs.
324 CS-LEARN-324 How to Answer a Database Question
Move from data requirements to model/schema/query/transaction behavior and explain integrity and performance implications.
325 CS-LEARN-325 How to Answer a Networking Question
Identify layer, protocol responsibility, packet/data flow and performance/reliability trade-offs.
326 CS-LEARN-326 How to Answer a Software-Engineering Question
Connect process or design principle to project context, quality attributes and lifecycle consequences.
327 CS-LEARN-327 How to Answer an Image-Processing Question
State image representation, operator/algorithm, effect on pixels or morphology and application/limitations.
328 CS-LEARN-328 How to Answer a Web-Engineering Question
Separate client, server, API and data responsibilities and discuss security/performance implications.
329 CS-LEARN-329 Diagram Discipline
Every architecture, tree, graph, process-state, network or image-processing diagram must be labeled and explained in the text.
330 CS-LEARN-330 Code Trace Discipline
For code questions, trace representative input and identify boundary cases rather than assuming code correctness.
331 CS-LEARN-331 Complexity Table
Maintain a verified table of common search, sort and data-structure operation complexities with assumptions.
332 CS-LEARN-332 Terminology Precision
Do not interchange process/thread, program/process, encryption/hashing, database/table, internet/web, or compiler/interpreter.
333 CS-LEARN-333 Legacy versus Current Technology
When the official syllabus contains legacy technologies such as DES, explain their syllabus significance while clearly distinguishing modern security practice.
334 CS-LEARN-334 Common Programming Errors
Watch for uninitialized state, bounds errors, pointer misuse, wrong loop conditions, uncontrolled recursion and incorrect parameter semantics.
335 CS-LEARN-335 Common Algorithm Errors
Avoid giving code without complexity, claiming average complexity as worst case, or using binary search on unsorted data.
336 CS-LEARN-336 Common Systems Errors
Avoid confusing virtual memory with secondary storage, deadlock with starvation, TCP with IP, or process scheduling with thread synchronization.
337 CS-LEARN-337 Common Database Errors
Avoid normalization by memorized decomposition without dependencies and SQL joins without explicit relationship logic.
338 CS-LEARN-338 Common Web Errors
Avoid treating client-side validation as security and distinguish authentication from authorization.
339 CS-LEARN-339 Computer Science Formula and Complexity Bank
Maintain one verified revision sheet for number systems, performance measures, algorithm complexity, scheduling and network calculations.
340 CS-LEARN-340 Computer Science Error Log
Classify mistakes as concept, code, algorithm, complexity, diagram, terminology, protocol/layer, database design, security or time management.
341 CS-LEARN-341 Past-Paper-Led but Syllabus-Controlled Preparation
Past papers reveal depth and recurring applications, while the official syllabus remains the controlling coverage document.
342 CS-LEARN-342 Paper-I Time Management
Balance foundational theory, programming and algorithm/data-structure work according to actual marks and question demands.
343 CS-LEARN-343 Paper-II Time Management
Balance systems, database/network, engineering, image and web topics according to the actual annual paper.
344 CS-LEARN-344 RAHBAR Computer Science Rubric
Score conceptual accuracy, algorithm/code correctness, complexity, diagrams, systems reasoning, terminology, application and presentation. This is a training rubric, not an official FPSC marking formula.
345 CS-LEARN-345 The RAHBAR Computer Science Standard
The target is a candidate who can reason from bits and programs through algorithms, systems, databases, networks and web applications, explaining both mechanism and engineering trade-offs.
Past-Paper Analysis
15 modules346 CS-AN-01 How to Read Computer Science Past Papers
Classify every requirement by Paper-I/Paper-II, syllabus domain, marks, command word, code/pseudocode need, diagram need and algorithmic or systems reasoning.
347 CS-AN-02 Programming Trend Matrix
Track fundamentals, control structures, functions, arrays, pointers, files and language-level reasoning by required depth.
348 CS-AN-03 OOP Trend Matrix
Map classes, encapsulation, inheritance, polymorphism, templates, exceptions and object-oriented design questions.
349 CS-AN-04 Algorithms Trend Matrix
Track search, sort, recursion, complexity, heuristic and other algorithmic questions by proof, trace and complexity demand.
350 CS-AN-05 Data-Structures Trend Matrix
Map lists, stacks, queues, hashing, trees, heaps and graphs by representation, operation and complexity.
351 CS-AN-06 Architecture Trend Matrix
Track CPU, instruction execution, memory hierarchy, I/O, pipelining and parallelism questions.
352 CS-AN-07 Operating-Systems Trend Matrix
Map processes, threads, scheduling, synchronization, deadlock, memory, virtual memory and file systems.
353 CS-AN-08 Database Trend Matrix
Track ER modeling, relational model, SQL, normalization, transactions, concurrency, recovery and distributed concepts.
354 CS-AN-09 Networking Trend Matrix
Map models/layers, addressing, routing, transport, protocols, wireless and defensive security.
355 CS-AN-10 Software-Engineering Trend Matrix
Track process, requirements, design, testing, quality, maintenance, estimation and risk.
356 CS-AN-11 Image-Processing Trend Matrix
Map sampling, enhancement, filtering, detection, segmentation and morphology questions.
357 CS-AN-12 Web-Engineering Trend Matrix
Track client/server architecture, HTML/CSS/JavaScript, server-side systems, APIs, security and performance.
358 CS-AN-13 Code-versus-Theory Demand
Identify where the examiner expects executable-style logic, pseudocode, trace tables, diagrams or conceptual prose.
359 CS-AN-14 Complexity-Demand Analysis
Record every question requiring time/space analysis and the assumptions behind best, average or worst-case claims.
360 CS-AN-15 Five-Year Diagnostic Dashboard
Record year, paper, topic, marks, artifact required, complexity/diagram demand and personal score to drive targeted repair.
Model Solution & Approach
48 modules361 CS-MODEL-01 Model Method: Programming Problem
Extract inputs, outputs and constraints; design the algorithm; write readable code/pseudocode; trace representative cases; state complexity where relevant.
362 CS-MODEL-02 Model Method: Loop Trace
Build a trace table for variables and conditions and verify termination before stating output.
363 CS-MODEL-03 Model Method: Recursion
Define base case, recursive reduction and stack behavior and derive time/space cost where required.
364 CS-MODEL-04 Model Method: Pointer Question
Draw memory/address relationships before explaining dereference, update or aliasing behavior.
365 CS-MODEL-05 Model Method: OOP Design
Identify objects, responsibilities and relationships; apply encapsulation and justify inheritance/composition choices.
366 CS-MODEL-06 Model Method: Polymorphism
Show interface/base behavior, overriding and runtime dispatch with a compact example.
367 CS-MODEL-07 Model Method: Template/Generic Question
Separate type-independent algorithm logic from type parameterization and explain reuse.
368 CS-MODEL-08 Model Method: Algorithm Analysis
Define input size, identify dominant operations, derive growth and express the bound correctly.
369 CS-MODEL-09 Model Method: Searching
State data preconditions, give algorithm, trace an example and compare complexity.
370 CS-MODEL-10 Model Method: Sorting
Give algorithm/pseudocode, trace key passes, state best/average/worst behavior and space/stability where relevant.
371 CS-MODEL-11 Model Method: Linked List
Draw node/link state before and after insertion/deletion and handle boundary cases.
372 CS-MODEL-12 Model Method: Stack or Queue
State ADT operations, representation and operation complexity and demonstrate one application.
373 CS-MODEL-13 Model Method: Hashing
Choose hash mapping, show collision resolution and discuss load factor/clustering implications.
374 CS-MODEL-14 Model Method: Tree Traversal
Draw the tree and produce traversal sequence systematically.
375 CS-MODEL-15 Model Method: Binary Search Tree
Trace search/insertion/deletion and explain how shape affects complexity.
376 CS-MODEL-16 Model Method: AVL Rotation
Identify imbalance, classify rotation case and redraw the balanced tree step by step.
377 CS-MODEL-17 Model Method: Heap
Show array/tree correspondence and trace heapify or priority operation.
378 CS-MODEL-18 Model Method: Graph Traversal
State representation, initialize visited structure and trace BFS/DFS in deterministic order.
379 CS-MODEL-19 Model Method: Heuristic Search
Define state, goal, cost and heuristic and distinguish heuristic guidance from guaranteed optimality.
380 CS-MODEL-20 Model Method: Number-System Problem
Write positional weights and perform conversions or signed representation stepwise.
381 CS-MODEL-21 Model Method: CPU/Instruction Cycle
Use a labeled datapath/block diagram and trace fetch-decode-execute movement.
382 CS-MODEL-22 Model Method: Cache Question
Identify locality, mapping and hit/miss behavior and discuss latency trade-offs.
383 CS-MODEL-23 Model Method: Pipeline Question
Draw stages over cycles, identify hazard and show mitigation.
384 CS-MODEL-24 Model Method: Scheduling
Create a Gantt chart, compute completion/turnaround/waiting/response metrics and compare policies.
385 CS-MODEL-25 Model Method: Synchronization
Identify shared resource and critical section, then show how the primitive enforces required properties.
386 CS-MODEL-26 Model Method: Deadlock
Test the four conditions, distinguish prevention/avoidance/detection and justify the selected strategy.
387 CS-MODEL-27 Model Method: Paging
Separate logical page/offset from physical frame/offset and show translation clearly.
388 CS-MODEL-28 Model Method: Page Replacement
Trace reference string frame by frame and count faults consistently.
389 CS-MODEL-29 Model Method: ER Design
Extract entities, attributes, keys, relationships and cardinalities before drawing the model.
390 CS-MODEL-30 Model Method: Normalization
Identify functional dependencies, candidate keys and anomalies, then decompose with stated normal form.
391 CS-MODEL-31 Model Method: SQL Query
Translate the requirement into relations, joins, filters, grouping and output columns before writing SQL.
392 CS-MODEL-32 Model Method: Transaction Question
Use ACID and concurrency anomalies to explain why the mechanism is needed.
393 CS-MODEL-33 Model Method: Database Recovery
Trace failure point, log/checkpoint state and required undo/redo conceptually.
394 CS-MODEL-34 Model Method: OSI/TCP-IP Question
Identify layer responsibility and trace encapsulation from application data to transmitted units.
395 CS-MODEL-35 Model Method: IP/Subnet Problem
Identify address/prefix, derive network and host ranges and verify binary boundaries.
396 CS-MODEL-36 Model Method: Routing Question
Separate route selection from packet forwarding and explain table decisions.
397 CS-MODEL-37 Model Method: TCP-versus-UDP
Compare connection, reliability, ordering, overhead and application requirements using one consistent table.
398 CS-MODEL-38 Model Method: Software Process
Match process model to requirement stability, risk, feedback and delivery constraints.
399 CS-MODEL-39 Model Method: Requirements Question
Separate functional and quality requirements and write testable statements.
400 CS-MODEL-40 Model Method: Software Testing
Identify test level, basis, cases, expected results and coverage objective.
401 CS-MODEL-41 Model Method: Image Filtering
State neighborhood/operator, apply it conceptually to pixels and explain smoothing/sharpening effect.
402 CS-MODEL-42 Model Method: Edge Detection
Explain intensity change, operator response and threshold/interpretation limitations.
403 CS-MODEL-43 Model Method: Morphology
Define foreground and structuring element and trace erosion/dilation or compound operation.
404 CS-MODEL-44 Model Method: Web Architecture
Separate browser, server, application and database responsibilities and trace a request-response cycle.
405 CS-MODEL-45 Model Method: REST/API Question
Identify resources, methods, representations, statelessness and security/versioning trade-offs.
406 CS-MODEL-46 Model Method: Web Security Answer
Describe the vulnerability only at defensive conceptual level, then emphasize validation, parameterization, encoding, authorization and secure configuration.
407 CS-MODEL-47 Model Method: Comparative Technical Answer
Compare alternatives on architecture, operation, complexity/performance, advantages, limitations and use cases.
408 CS-MODEL-48 Model Method: Full Computer Science Answer
Combine precise terminology, diagram/code/pseudocode, mechanism, complexity/performance and engineering trade-offs under the exact command word.
Programming, Algorithm, Systems Practice & Evaluation
57 modules409 CS-PR-01 Programming Trace Drill
Trace short programs manually and predict output before running them.
410 CS-PR-02 Control-Flow Drill
Convert problem statements into selection and iteration structures without coding first.
411 CS-PR-03 Function and Parameter Drill
Predict value/reference effects and variable scope across calls.
412 CS-PR-04 Recursion Drill
Draw call trees/stacks for recursive functions and identify base-case failures.
413 CS-PR-05 Array Drill
Solve traversal, insertion/search and two-dimensional indexing tasks.
414 CS-PR-06 Pointer Memory Drill
Draw addresses and values for pointer expressions without unsafe experimentation.
415 CS-PR-07 OOP Class-Design Drill
Design a small class hierarchy and justify every public/private decision.
416 CS-PR-08 Inheritance-versus-Composition Drill
For several relationships choose is-a or has-a and explain maintainability consequences.
417 CS-PR-09 Polymorphism Trace Drill
Predict runtime method selection in a compact inheritance example.
418 CS-PR-10 Algorithm Complexity Drill
Derive complexity of loops, nested loops, divide-and-conquer and common operations.
419 CS-PR-11 Search Drill
Implement/trace linear and binary search and state preconditions.
420 CS-PR-12 Sorting Drill
Trace bubble, insertion, selection, merge, quick and heap sorting on the same small data set.
421 CS-PR-13 Linked-List Drill
Draw insertion/deletion at head, middle and tail including empty-list cases.
422 CS-PR-14 Stack Drill
Use a stack for expression or call-related reasoning.
423 CS-PR-15 Queue Drill
Trace circular/linked queue operations and boundary conditions.
424 CS-PR-16 Hashing Drill
Insert keys using linear probing and chaining and compare collision behavior.
425 CS-PR-17 Tree Traversal Drill
Produce preorder, inorder, postorder and level order from unseen trees.
426 CS-PR-18 BST Drill
Perform insertion, search and deletion and analyze tree height.
427 CS-PR-19 AVL Drill
Repair LL, RR, LR and RL imbalance cases.
428 CS-PR-20 Heap Drill
Build a heap and trace insert/delete operations.
429 CS-PR-21 Graph Drill
Construct adjacency list/matrix and trace BFS and DFS.
430 CS-PR-22 Number-System Drill
Convert binary, octal, decimal and hexadecimal and practise two's-complement representation.
431 CS-PR-23 Instruction-Cycle Diagram Drill
Draw CPU, registers, buses and memory and trace one conceptual instruction.
432 CS-PR-24 Cache Drill
Classify accesses as hits/misses in a simplified mapping exercise.
433 CS-PR-25 Pipeline Drill
Identify structural, data and control hazards in a staged instruction sequence.
434 CS-PR-26 Scheduling Drill
Solve FCFS, SJF, priority and round-robin cases with Gantt charts and metrics.
435 CS-PR-27 Synchronization Drill
Identify race conditions and select an appropriate conceptual synchronization primitive.
436 CS-PR-28 Deadlock Drill
Test scenarios against the four necessary conditions and classify management strategy.
437 CS-PR-29 Paging Drill
Translate sample virtual addresses using page/frame data.
438 CS-PR-30 Page-Replacement Drill
Trace FIFO and LRU and compare page-fault counts.
439 CS-PR-31 File-System Drill
Compare allocation/directory approaches by access, fragmentation and reliability.
440 CS-PR-32 ER Modeling Drill
Turn a short real-world description into an ER model.
441 CS-PR-33 Normalization Drill
Normalize a relation from dependencies through the required normal form.
442 CS-PR-34 SQL Drill
Write select/join/group/subquery solutions from relational requirements.
443 CS-PR-35 Transaction-Anomaly Drill
Identify dirty read, lost update or related concurrency problem conceptually.
444 CS-PR-36 Network-Layer Drill
Match protocols/devices/functions to correct layers.
445 CS-PR-37 Subnetting Drill
Solve prefix/network/host-range questions with binary verification.
446 CS-PR-38 TCP-UDP Drill
Choose transport for several applications and justify each choice.
447 CS-PR-39 Software-Requirements Drill
Rewrite vague requirements into measurable functional/non-functional statements.
448 CS-PR-40 Testing Drill
Design unit, integration and system tests for a small feature.
449 CS-PR-41 Image-Processing Drill
Apply small conceptual masks and explain output effects without relying on memorized labels.
450 CS-PR-42 Morphology Drill
Trace erosion, dilation, opening and closing on simple binary shapes.
451 CS-PR-43 Web Request Drill
Trace browser-to-server-to-database-to-response flow.
452 CS-PR-44 Web Security Classification Drill
Identify defensive categories such as injection, XSS and broken authorization and state safe mitigations without exploit steps.
453 CS-PR-45 REST Drill
Design a small resource-oriented interface and justify methods/status behavior conceptually.
454 CS-PR-46 Diagram Accuracy Audit
Check labels, direction, layers, states and explanatory text on every systems diagram.
455 CS-PR-47 Pseudocode Audit
Check initialization, loop bounds, conditions, termination and output for every algorithm.
456 CS-PR-48 Complexity Audit
For each algorithm state input size, case assumption, time and auxiliary space.
457 CS-PR-49 Terminology Drill
Correct common confusions such as process/program, thread/process, internet/web, encryption/hashing and authentication/authorization.
458 CS-PR-50 Two-Question Paper-I Drill
Attempt one programming/OOP and one algorithms/data-structures question consecutively.
459 CS-PR-51 Two-Question Paper-II Drill
Attempt one systems and one database/network/software/web question consecutively.
460 CS-PR-52 Official Past-Paper Simulation
Attempt an official Paper-I or Paper-II under its original annual instructions and audit technical accuracy afterward.
461 CS-PR-53 Computer Science Error Log
Classify errors as concept, syntax, algorithm, complexity, diagram, architecture, protocol, schema, security or time.
462 CS-PR-54 RAHBAR Computer Science Rubric
Score concept, code/pseudocode, algorithm correctness, complexity, diagrams, terminology, engineering trade-offs and presentation. This is not an official FPSC marking formula.
463 CS-PR-55 Four-Week Paper-I Cycle
Week 1 computing/programming; Week 2 OOP; Week 3 algorithms/data structures; Week 4 mixed timed repair.
464 CS-PR-56 Four-Week Paper-II Cycle
Week 1 architecture/OS; Week 2 database/networks; Week 3 software/image/web; Week 4 mixed timed repair.
465 CS-PR-57 Final Technical Currency Check
Before examination, distinguish syllabus-required legacy material from current practice and verify any current standards or technology claims used in answers.