๐ ISRO VSSC
Technical Assistant (Computer Science) – Complete Syllabus 2025
Based on
Official Previous Year Question Papers
The Indian
Space Research Organisation (ISRO), through the Vikram Sarabhai Space Centre
(VSSC), conducts recruitment for the post of Technical Assistant (Computer
Science). Candidates preparing for this exam often face one major challenge
— lack of a clear, officially published syllabus.
To bridge that
gap, we have carefully analyzed two official VSSC question papers (Advt. No.
335 and Post No. 1546) to give you a complete, detailed, and exam-accurate
syllabus.
๐ง Overview of the Exam Pattern
- Total Questions: 80
- Duration: 90 minutes
- Type: Objective-type multiple choice
questions (MCQs)
- Negative Marking: 0.25 marks deducted for one wrong question
- Syllabus Level: Engineering/Diploma level in
Computer Science
- Download previous year questions---https://drive.google.com/file/d/1J0H-UyzbWyDey7xMMCFQdZenbkpKqqYz/view?usp=sharing
๐ Subject-Wise Detailed Syllabus
1. Programming (C, C++, Java, Python)
This is one of
the most heavily covered subjects. Expect both concept-based and code-based
questions.
Topics Covered:
- C, C++, and Java Syntax
- Input/Output Functions (e.g., cout, printf)
- Function types: Inline, Virtual,
Recursive
- Memory allocation, Arrays &
Pointers
- Object-Oriented Programming:
Constructors, Polymorphism
- Code output analysis
- Operator Overloading (including
limitations)
- String manipulation and logic
2. Data Structures
Questions are
frequently code-driven or based on memory/time complexity.
Topics Covered:
- Arrays, Stacks, Queues (circular,
priority)
- Linked Lists (Singly/Doubly)
- Trees: Binary Tree, BST, AVL Tree
(rotations, traversals)
- Graph Representations (Adjacency
List/Matrix)
- Heaps: Min/Max Heap, Heapify
operations
- Hash Tables: Hash functions,
Linear Probing
3. Algorithms
A crucial
subject where both logic and implementation are tested.
Topics Covered:
- Sorting Algorithms: Bubble, Quick,
Merge, Heap
- Searching: Linear, Binary
- Greedy Algorithms
- Divide and Conquer Techniques
- Time and Space Complexity Analysis
- Dynamic Programming Concepts
4. Operating Systems
Expect
conceptual, process-based, and scenario-based questions.
Topics Covered:
- Process Scheduling: FCFS, SJF,
Round Robin, Priority
- Process Synchronization: Mutex,
Semaphore
- Deadlock Prevention, Avoidance
- Paging and Page Replacement
- Memory Management: Fragmentation,
Segmentation
- File Systems and Disk Scheduling
- Thread pools and thread behavior
5. Database Management Systems (DBMS)
Most questions
are SQL-based or related to transaction behavior.
Topics Covered:
- SQL Queries: SELECT, JOIN (INNER,
OUTER), GROUP BY
- Integrity Constraints: Primary,
Foreign Keys
- B+ Trees and Indexing
(clustered/unclustered)
- Transactions: ACID Properties
- Normal Forms (1NF to 3NF, BCNF)
- Referential Integrity
- Relational Algebra (basics)
6. Computer Networks
Both
theoretical and applied networking knowledge is tested.
Topics Covered:
- OSI & TCP/IP Models
- IP Addressing: Classes, Subnetting
- Protocols: TCP, UDP, FTP, DNS,
DHCP
- SSL Handshake & Secure
Communication
- Routing: Static, Dynamic,
Interface Matching
- Throughput & Bandwidth
Calculations
7. Digital Logic & Computer Architecture
A strong focus
on logical reasoning and bit-level calculations.
Topics Covered:
- Number Systems: Binary, Octal,
Decimal, Hexadecimal
- Logic Gates: AND, OR, NOT, XOR,
NAND
- Boolean Algebra and Karnaugh Maps
- Combinational Circuits: MUX, DEMUX
- Sequential Circuits: Flip-Flops,
Counters
- Cache Memory: Direct, Set
Associative, LRU
- Instruction Formats and CPU Cycle
Estimation
8. Software Engineering
Few but
important questions from this area.
Topics Covered:
- SDLC Models: Waterfall, Agile,
Prototype
- Testing Types: Alpha, Beta,
Regression, White-box
- Cyclomatic Complexity
- Requirement Engineering
- Module Coupling & Cohesion
9. Compiler Design & Automata Theory
Typically 2–3
logic-based questions.
Topics Covered:
- FSMs: DFA, NFA, Mealy, Moore
- Lexical Analysis & Tokens
- Syntax Analysis and Regular
Expressions
- Backtracking and Parsing
10. Discrete Mathematics & Applied Mathematics
Expect
numerical and logical reasoning types.
Topics Covered:
- Sets, Relations, Functions
- Matrices & Linear Algebra
- Permutations and Combinations
- Probability Theory
- Graph Theory Basics (trees,
spanning trees)
11. Cybersecurity
Some conceptual
and scenario-based questions.
Topics Covered:
- Symmetric & Asymmetric
Encryption (RSA, Blowfish)
- SSL/TLS Handshake
- Firewalls & Secure Communication
- Phishing and Network Threats
- Hamming Code and CRC
12. Web Technologies & Miscellaneous
Usually 1–2
marks only.
Topics Covered:
- HTTP Status Codes (403, 404, 500)
- URL & FTP Operations
- SMTP, TCP Connections
- Real-life applications like
ChatGPT, Bhashini
๐ Subject-Wise Approximate Weightage
|
Subject |
Weightage (Approx. out of 80 Qs) |
|
Programming |
20–25 Qs |
|
Data
Structures & Algorithms |
20–22 Qs |
|
Operating
Systems |
10–12 Qs |
|
DBMS |
10–12 Qs |
|
Networks |
8–10 Qs |
|
Architecture
& Logic |
8–10 Qs |
|
Software
Engg. & Compiler |
4–6 Qs |
|
Cybersecurity |
3–5 Qs |
|
Discrete
Maths |
3–4 Qs |
๐ Final Tips for Aspirants
- Focus on concept clarity + code
output based questions.
- Practice previous year
questions to understand the framing.
- Learn shortcuts for
calculations in logic and matrix problems.
- Revise SQL and core OS topics
thoroughly — they’re high scoring.
- Use standard textbooks like:
- Let Us C by Yashwant Kanetkar
- Data Structures by Narasimha Karumanchi
- Operating System Concepts by Galvin
- Database Systems by Elmasri & Navathe
๐งพ Conclusion
The ISRO VSSC
Technical Assistant (Computer Science) exam tests depth of understanding,
logical application, and real coding knowledge. With this detailed syllabus
built from actual questions, you can now streamline your preparation
with full confidence.
Prepare well,
stay consistent, and reach for the stars — literally!
Comments
Post a Comment