PREPARATION GUIDE
How To Prepare
Software Systems
Complete preparation strategy for the SS Special Test — C Programming, OOP & Software Engineering, Database Systems, and Core Systems. GATE score is NOT accepted for M.E. SS.
Preparation Strategy
50 questions across 4 subjects in 60 minutes — C Programming dominates with 30-40% of the paper. Master C first, then expand.
Critical Rule: M.E. Software Systems admits ONLY through BITS HD Test — GATE score is NOT accepted for SS. This test is your single shot. C Programming alone is ~15-20 questions (30-40%). If you master C, you've already secured a huge chunk of marks.
01
Phase 1: C Programming
~15-20 Questions — Highest weight!
Pointers, macros, fork(), storage classes, unions, file I/O. These appear EVERY year. Practice output-prediction questions daily.
02
Phase 2: OOP & Software Engineering
~10-12 Questions — Theory-heavy
Testing methods, design patterns, SDLC models, COCOMO. Purely conceptual — no coding, just definitions and classifications.
03
Phase 3: Database Systems
~8 Questions — Overlaps with CS
Normalization, SQL joins, ER model, 2PL transactions. Same DBMS topics as CS paper — reuse your CS prep here.
04
Phase 4: Core Systems
~10 Questions — OS + Networking
Process management, scheduling, memory, TCP/IP basics. Foundational systems knowledge — focus on concepts over details.
Time Management: 60 minutes for 50 questions = 1.2 min/question. Faster pace than CS paper. C Programming questions are often output-prediction — trace code mentally, don't guess. If stuck beyond 60 seconds, skip and return.
From BITS PYQs: Pointers, macros with side effects, fork() output, and storage classes are asked EVERY year. These 4 topics alone can give you 8-12 questions. Master them before anything else.
1. C Programming (Structured + Advanced)
Critical — ~15-20 Qs, 10 BITS PYQs, GATE V2: 127 Qs
The single most important subject for SS. Pointers, macros, fork(), storage classes, unions — these appear every year without fail.
Key Topics & PYQ Patterns
Pointers & Address Arithmetic
*p = value at address p. &x = address of x. p+1 moves by sizeof(*p) bytes. Array name = pointer to first element.
BITS PYQ: "Swap function with pointers — predict output." Passing by pointer allows modification of original values.
BITS PYQ: "Swap function with pointers — predict output." Passing by pointer allows modification of original values.
Macros (#define) — Text Substitution
Macros do LITERAL text replacement. No parentheses = bugs! #define f(A,B) A+B means f(2,3) becomes 2+3, not (2+3).
BITS PYQ: "#define f(A,B) A+B, #define g(A,B) f(A,B)/f(A,B)" → expand step by step, watch side effects!
BITS PYQ: "#define f(A,B) A+B, #define g(A,B) f(A,B)/f(A,B)" → expand step by step, watch side effects!
fork() System Call
Creates child process (copy of parent). Returns 0 to child, PID to parent. Variables are COPIED — child's changes don't affect parent.
BITS PYQ: "int x=5; fork(); if(pid!=0) print x; else x++;" → Parent prints 5 (child modifies its OWN copy)
BITS PYQ: "int x=5; fork(); if(pid!=0) print x; else x++;" → Parent prints 5 (child modifies its OWN copy)
Storage Classes
register: CPU register, CANNOT use &. static: retains value between calls. auto: default local. extern: defined elsewhere.
BITS PYQs: "Can't use & operator?" → register. "Maintains value between calls?" → static int
BITS PYQs: "Can't use & operator?" → register. "Maintains value between calls?" → static int
Union vs Structure (sizeof)
Union: all members share memory, size = LARGEST member. Struct: sequential, size = sum + padding.
BITS PYQ: "union{int a;char c;double d;} with int=4,char=2,double=5. Size?" → 5 bytes (largest member)
BITS PYQ: "union{int a;char c;double d;} with int=4,char=2,double=5. Size?" → 5 bytes (largest member)
File I/O Functions
fflush: flush buffer to file. fseek: move pointer (random access). fgets: read line. ftell: current position. fforword: DOES NOT EXIST.
BITS PYQs: "Not standard C function?" → fforword(). "Diff fflush vs fseek?"
BITS PYQs: "Not standard C function?" → fforword(). "Diff fflush vs fseek?"
2. OOP & Software Engineering
High — ~10-12 Qs, 13 BITS PYQs
Purely conceptual — no coding questions. Focus on definitions, classifications, and distinguishing between similar terms.
Key Topics & PYQ Patterns
Testing Methods
White/Clear box: see internals. Black box: only I/O. "Color box" does NOT exist. Beta testing: done by CUSTOMERS.
BITS PYQs: "Not a testing method?" → Color box. "Who does beta testing?" → Customers
BITS PYQs: "Not a testing method?" → Color box. "Who does beta testing?" → Customers
Design Patterns & Architecture
Patterns: Factory, Singleton, Observer, Strategy. Architectures: Pipes&Filters, Microkernel, Layered. Facade is a PATTERN not architecture.
BITS PYQs: "Not a software architecture?" → Facade (it's a design pattern)
BITS PYQs: "Not a software architecture?" → Facade (it's a design pattern)
SDLC Models & COCOMO
Waterfall: NOT for changing requirements. COCOMO II: Algorithmic approach. UML Sequence: shows class lifecycle.
BITS PYQs: "Waterfall bad for?" → Accommodating changes. "COCOMO II approach?" → Algorithmic
BITS PYQs: "Waterfall bad for?" → Accommodating changes. "COCOMO II approach?" → Algorithmic
OOP Concepts & Design Principles
Good design = High Cohesion + Low Coupling. Inheritance: IS-A. Composition: HAS-A. Polymorphism: same interface, different behavior.
BITS PYQs: "Good software design features?" → High cohesion, low coupling
BITS PYQs: "Good software design features?" → High cohesion, low coupling
3. Database Systems
High — ~8 Qs, 12 BITS PYQs, GATE V2: 284 Qs
Same DBMS topics as the CS paper. If you've prepared for CS Test II, you're already covered. Focus on normalization, SQL, and transactions.
Key Topics & PYQ Patterns
Normalization
1NF: atomic. 2NF: no partial dependency. 3NF: no transitive. BCNF: every determinant is candidate key. BCNF = ZERO redundancy.
BITS PYQ: "Relation decomposed into BCNF — redundancy level?" → Zero/None
BITS PYQ: "Relation decomposed into BCNF — redundancy level?" → Zero/None
SQL Joins & Queries
Valid joins: INNER, LEFT, RIGHT, FULL OUTER, CROSS. "PRODUCT" and "UNION" are NOT join types (they're set operations).
BITS PYQs: "Not a valid SQL join?" → Union/Product
BITS PYQs: "Not a valid SQL join?" → Union/Product
ER Model & Schema Levels
3 levels: External (highest, user view), Conceptual (middle), Physical (lowest). M:N attributes go IN the relationship.
BITS PYQ: "Highest abstraction?" → External. "M:N attribute location?" → In relationship
BITS PYQ: "Highest abstraction?" → External. "M:N attribute location?" → In relationship
Transactions (2PL, Strict 2PL)
Strict 2PL: holds all locks until commit → prevents cascading rollbacks. Wait-Die: older waits, younger dies → deadlock-free.
BITS PYQs: "No cascading rollbacks?" → Strict 2PL. "Deadlock-free?" → Wait and Die
BITS PYQs: "No cascading rollbacks?" → Strict 2PL. "Deadlock-free?" → Wait and Die
4. Core Systems (OS + Networking)
High — ~10 Qs
Foundational systems knowledge covering operating system concepts and computer networking basics. Focus on processes, scheduling, memory management, and TCP/IP.
Key Topics & PYQ Patterns
Process & Scheduling
Waiting Time = Turnaround - Burst. SJF non-preemptive, SRTF preemptive. FCFS, Round Robin.
BITS PYQ: "Calculate waiting time using SJF scheduling."
BITS PYQ: "Calculate waiting time using SJF scheduling."
Deadlock
4 conditions: Mutual Exclusion, Hold & Wait, No Preemption, Circular Wait. Break ANY one to prevent.
BITS PYQ: "Banker's algorithm — find safe sequence."
BITS PYQ: "Banker's algorithm — find safe sequence."
Memory & Page Replacement
FIFO: replace oldest. LRU: replace least recently used. Count page faults step by step.
BITS PYQ: "Given reference string, count FIFO vs LRU page faults."
BITS PYQ: "Given reference string, count FIFO vs LRU page faults."
TCP/IP & Networking
OSI: 7 layers. TCP: reliable, connection-oriented. UDP: unreliable, connectionless. Subnetting: borrow host bits for network.
BITS PYQ: "Which layer handles routing?" → Network layer
BITS PYQ: "Which layer handles routing?" → Network layer
Final Tips for Software Systems
50 questions in 60 minutes — C Programming is your make-or-break subject.
Scoring Strategy:
• C Programming = ~15-20 questions. Pointers, macros, fork() are asked EVERY year. Master these 3 first.
• OOP/SE is pure theory — memorize testing types, design patterns vs architectures, SDLC models.
• Database overlaps with CS paper DBMS — if you prepared for CS, reuse that knowledge.
• Core Systems = OS + networking basics. Focus on concepts, not deep implementation details.
• Time: 1.2 min/question. Faster than CS paper. Don't get stuck on tricky C output questions — skip and return.
• C Programming = ~15-20 questions. Pointers, macros, fork() are asked EVERY year. Master these 3 first.
• OOP/SE is pure theory — memorize testing types, design patterns vs architectures, SDLC models.
• Database overlaps with CS paper DBMS — if you prepared for CS, reuse that knowledge.
• Core Systems = OS + networking basics. Focus on concepts, not deep implementation details.
• Time: 1.2 min/question. Faster than CS paper. Don't get stuck on tricky C output questions — skip and return.
- C Programming is king — 30-40% of the paper. Practice output-prediction questions daily. Trace code by hand.
- Macros are tricky — #define does literal text substitution. Always expand manually. Watch for operator precedence bugs.
- fork() creates copies — child gets its own copy of all variables. Changes in child don't affect parent. Draw the process tree.
- Design patterns vs Architecture — Factory, Singleton, Observer = patterns. Pipes&Filters, Layered = architectures. Facade is a PATTERN.
- BCNF = zero redundancy — most asked DBMS concept. Know all normal forms and their conditions.
- GATE score NOT accepted — SS has no shortcut. This test is your only path. Give it full attention.
- Marking: +3/-1/0 — if unsure between 2 options, attempt. If no idea at all, SKIP.
Recommended Resources
Free resources to cover everything. No paid courses needed.
Free Practice Sources
• GateOverflow PYQs ↗ — All CS PYQs with solutions (DBMS + OS overlap)
• BITS HD PYQ Analysis ↗ — SS section with topic-wise breakdown
• GATE PYQs (Volume 2) ↗ — ~3000+ CS Questions PDF
• BITS HD PYQ Analysis ↗ — SS section with topic-wise breakdown
• GATE PYQs (Volume 2) ↗ — ~3000+ CS Questions PDF
+3
Correct Answer
-1
Wrong Answer
0
Unattempted