HPSC System Analyst Syllabus and Exam Pattern 2026 - Overview
| Particulars | Details |
|---|---|
| Conducting Body | Haryana Public Service Commission (HPSC) |
| Posts | System Analyst/Senior Programmer; Jr. System Analyst/Programmer (HSIIDC) |
| Advertisement Numbers | 16/2026 (System Analyst/Senior Programmer); 17/2026 (Jr. System Analyst/Programmer, HSIIDC) |
| Exam Name | Subject Knowledge Test |
| Total Marks (Subject Knowledge Test) | 150 |
| Duration | 3 hours |
| Type of Paper | Subjective |
| Medium of Exam | English |
| Qualifying Marks for Interview | Minimum 35% |
| Weightage of Subject Knowledge Test | 87.5% |
| Weightage of Interview | 12.5% |
| Selection Stages | Subject Knowledge Test, Interview |
| Official Website | hpsc.gov.in |
Subject Knowledge Test Pattern
| Particulars | Details |
|---|---|
| Total Marks | 150 |
| Duration | 3 hours |
| Type of Questions | Subjective |
| Medium | English |
| Qualifying Marks (Overall) | 35% |
| Weightage in Final Merit | 87.5% |
1. Engineering Mathematics
- Linear Algebra: Matrices, determinants, system of linear equations, eigenvalues and eigenvectors, LU decomposition
- Calculus: Limits, continuity and differentiability, maxima and minima, mean value theorem, integration
2. Digital Logic
- Boolean algebra
- Combinational and sequential circuits
- Minimization
- Number representations and computer arithmetic (fixed and floating point)
3. Computer Organization and Architecture
- Machine instructions and addressing modes
- ALU, data-path and control unit
- Instruction pipelining, pipeline hazards
- Memory hierarchy - cache, main memory and secondary storage
- I/O interface (interrupt and DMA mode)
4. Programming and Data Structures
- Programming in C
- Recursion
- Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs
5. Algorithms
- Searching, sorting, hashing
- Asymptotic worst case time and space complexity
- Algorithm design techniques - greedy, dynamic programming and divide-and-conquer
- Graph traversals, minimum spanning trees, shortest paths
6. Theory of Computation
- Regular expressions and finite automata
- Context-free grammars and push-down automata
- Regular and context-free languages, pumping lemma
- Turing machines and undecidability
7. Compiler Design
- Lexical analysis, parsing, syntax-directed translation
- Runtime environments
- Intermediate code generation
- Local optimisation; data flow analyses - constant propagation, liveness analysis, common sub-expression elimination
8. Operating System
- System calls, processes, threads, inter-process communication, concurrency and synchronization
- Deadlock
- CPU and I/O scheduling
- Memory management and virtual memory
- File systems
9. Databases
- ER-model
- Relational model - relational algebra, tuple calculus, SQL
- Integrity constraints, normal forms
- File organization, indexing (e.g., B and B+ trees)
- Transactions and concurrency control
10. Computer Networks
- Concept of layering - OSI and TCP/IP protocol stacks
- Basics of packet, circuit and virtual circuit switching
- Data link layer - framing, error detection, medium access control, Ethernet bridging
- Routing protocols - shortest path, flooding, distance vector and link state routing
- Transport layer - flow control and congestion control, UDP, TCP, sockets
- Application layer protocols - DNS, SMTP, HTTP, FTP, Email