UGC NET Computer Science Syllabus 2026: All 10 Units, Books & Preparation Strategy
Computer Science (Code 87) is one of the most technical subjects in UGC NET. Paper 2 covers the core CS curriculum — algorithms, data structures, operating systems, DBMS, networks, AI, and security — 100 questions, 200 marks, no negative marking. If you have a BE/B.Tech or MCA/M.Tech background, much of this overlaps directly with your degree curriculum. Here is the complete unit-wise syllabus for June 2026.
📋 NTA UGC NET June 2026 — Apply Online — Application open 29 Apr – 20 May 2026
Paper 2 Exam Pattern
| Detail | Value |
|---|---|
| Subject Code | 87 |
| Total Questions | 100 MCQ |
| Total Marks | 200 |
| Negative Marking | None — attempt all 100 questions |
| Units | 10 units, ~10 questions each |
Unit-Wise Syllabus — Computer Science Paper 2
| Unit | Name | Key Topics |
|---|---|---|
| 1 | Discrete Structures & Optimization | Sets, relations, functions, propositional & predicate logic, graph theory (types, Eulerian/Hamiltonian paths, spanning trees, shortest path algorithms), combinatorics (permutations, combinations, pigeonhole principle), linear programming, simplex method |
| 2 | Computer System Architecture | Number systems (binary, octal, hex, conversions), Boolean algebra, logic gates, combinational circuits (adders, multiplexers, decoders), sequential circuits (flip-flops, registers, counters), CPU organization (ALU, CU, registers), instruction cycle, memory hierarchy, cache, pipelining, RISC vs CISC |
| 3 | Programming Methodology | Algorithm design paradigms (greedy, divide & conquer, dynamic programming, backtracking, branch & bound), complexity analysis (Big-O, worst/average/best case), recursion, OOP concepts (encapsulation, inheritance, polymorphism, abstraction), C/C++ and Java basics, functional programming concepts |
| 4 | Data Structures & File Structures | Arrays, linked lists, stacks, queues (circular queue, dequeue, priority queue), trees (binary tree, BST, AVL tree, B-tree, B+ tree, red-black tree, heap), graphs (BFS, DFS, Dijkstra, Kruskal, Prim), hashing (hash functions, collision resolution), sorting algorithms, file organisation (sequential, indexed, direct) |
| 5 | Systems & Software | Operating system concepts (process management, CPU scheduling — FCFS/SJF/Round Robin/Priority, inter-process communication, deadlock detection & prevention, memory management — paging, segmentation, virtual memory, page replacement algorithms), formal languages & automata (FA, PDA, TM, regular expressions, context-free grammars), compiler design (lexical analysis, parsing, code generation) |
| 6 | Database Management Systems | Data models (ER model, relational model), relational algebra & calculus, SQL (DDL/DML/DCL), normalisation (1NF–BCNF), functional dependencies, indexing (B-tree, hash index), transaction management (ACID properties, concurrency control — 2PL, serialisability), recovery techniques (log-based, shadow paging), distributed databases, NoSQL basics |
| 7 | Computer Networks & Internet Technologies | OSI model (7 layers and functions), TCP/IP protocol suite, IP addressing (IPv4, IPv6, subnetting, CIDR), routing protocols (RIP, OSPF, BGP), transport layer (TCP vs UDP, congestion control), application layer protocols (HTTP, FTP, SMTP, DNS, DHCP), network security basics, wireless networks (WiFi, cellular), cloud computing concepts |
| 8 | Artificial Intelligence & Machine Learning | AI concepts (search strategies — BFS/DFS/A*, heuristic search, game playing — minimax, alpha-beta pruning), knowledge representation (first-order logic, semantic networks, frames), machine learning types (supervised, unsupervised, reinforcement), key ML algorithms (linear regression, decision trees, k-means, k-NN, naive Bayes, SVM basics), neural networks (perceptron, backpropagation, deep learning basics), natural language processing basics |
| 9 | Software Engineering | SDLC models (waterfall, spiral, incremental, prototyping), agile methodologies (Scrum, XP), requirements engineering, software design (coupling, cohesion, design patterns — Creational/Structural/Behavioural), UML diagrams, software testing (unit, integration, system, acceptance testing; white-box, black-box techniques), software metrics, software project management (COCOMO model) |
| 10 | Security & Cryptography | Cryptography fundamentals (symmetric — DES, AES; asymmetric — RSA, Diffie-Hellman), hash functions (MD5, SHA), digital signatures, public key infrastructure (PKI), network security protocols (SSL/TLS, IPSec, SSH), types of attacks (DoS, SQL injection, XSS, man-in-the-middle, phishing), firewalls, IDS/IPS, cybersecurity policies |
Important Books for UGC NET Computer Science
| Topic | Book | Author |
|---|---|---|
| Data Structures & Algorithms | Introduction to Algorithms (CLRS) | Cormen, Leiserson, Rivest & Stein |
| Operating Systems | Operating System Concepts (Dinosaur Book) | Silberschatz, Galvin & Gagne |
| Database Management | Database System Concepts | Silberschatz, Korth & Sudarshan |
| Computer Networks | Data Communications & Networking | Forouzan |
| Computer Architecture | Computer Organisation & Architecture | Tanenbaum or William Stallings |
| Software Engineering | Software Engineering: A Practitioner's Approach | Roger Pressman |
Preparation Strategy
| Area | Approach |
|---|---|
| Units 4 & 6 (DS & DBMS) | These two units together are the highest yield in CS Paper 2. Data structure traversal questions (tree traversals, graph algorithms), SQL query writing (SELECT with joins, GROUP BY), and normalisation problems are numerical/analytical and appear every year. |
| Unit 7 (Networks) | OSI model layers (know each layer's function and protocols), IP subnetting calculations, TCP vs UDP differences, and protocol names (which protocol does what) are highly testable. Practise subnetting problems. |
| Unit 5 (OS) | CPU scheduling algorithm questions (calculate waiting time, turnaround time for FCFS/SJF/Round Robin), page replacement algorithms (FIFO, LRU, Optimal — count page faults), and deadlock condition questions appear consistently. |
| Previous Papers | CS Paper 2 tests specific technical facts and calculations. Previous papers reveal which algorithms, which SQL concepts, which network protocols, and which OS scheduling scenarios are repeatedly tested — essential preparation resource. |
Data Structures — Complexity Quick Reference
Unit 4 questions frequently ask about time complexity of operations on different data structures. This table covers the most tested combinations:
| Data Structure | Search | Insert | Delete | Key Characteristic |
|---|---|---|---|---|
| Array (sorted) | O(log n) binary search | O(n) | O(n) | Random access O(1); fixed size |
| Singly Linked List | O(n) | O(1) at head | O(n) | Dynamic size; no random access |
| Binary Search Tree (balanced) | O(log n) | O(log n) | O(log n) | BST property: left < root < right |
| Hash Table (avg case) | O(1) | O(1) | O(1) | Worst case O(n) on collision; load factor |
| Min/Max Heap | O(n) | O(log n) | O(log n) | Extract min/max in O(log n); Heapsort |
| AVL Tree | O(log n) | O(log n) | O(log n) | Self-balancing; balance factor |−1, 0, +1| |
OS Concepts — CPU Scheduling Algorithm Comparison
| Algorithm | Type | Key Property | Drawback |
|---|---|---|---|
| FCFS | Non-preemptive | Simple; first come first served | Convoy effect — short jobs wait behind long ones |
| SJF (Shortest Job First) | Non-preemptive | Optimal average waiting time among non-preemptive | Starvation of long jobs; burst time must be known |
| SRTF (Preemptive SJF) | Preemptive | Optimal among all algorithms for min. average waiting time | High context switch overhead; starvation possible |
| Round Robin | Preemptive | Time quantum; fair allocation; no starvation | Higher turnaround time if quantum too small; context switch overhead |
| Priority Scheduling | Both | Highest priority process runs first | Starvation of low-priority processes; solved by ageing |
Network Protocols — Layer-Wise Reference (OSI Model)
| Layer | Name | Key Protocols | Function |
|---|---|---|---|
| 7 | Application | HTTP, FTP, SMTP, DNS, DHCP, SSH, Telnet | User-facing services; interacts with user applications |
| 6 | Presentation | SSL/TLS, JPEG, MPEG | Encryption, compression, data format translation |
| 5 | Session | NetBIOS, RPC, SQL (session) | Session establishment, maintenance, termination |
| 4 | Transport | TCP (reliable, connection-oriented), UDP (unreliable, connectionless) | End-to-end reliability, flow control, error recovery |
| 3 | Network | IP (IPv4/IPv6), ICMP, RIP, OSPF, BGP | Logical addressing, routing across networks |
| 2 | Data Link | Ethernet (802.3), Wi-Fi (802.11), ARP, PPP | Frame transmission, MAC addressing, error detection |
| 1 | Physical | RS-232, DSL, Ethernet cables, Fibre Optic | Bit transmission over physical medium |
Database Management: Key Concepts and Normal Forms
DBMS is one of the highest-scoring units in Computer Science Paper II. Questions on normalisation, SQL, and transaction management appear every year.
| Concept | Key Definition / Rule |
|---|---|
| 1NF (First Normal Form) | Eliminate repeating groups; all attributes atomic; each row uniquely identifiable |
| 2NF (Second Normal Form) | 1NF + no partial dependency; every non-prime attribute fully functionally dependent on whole primary key |
| 3NF (Third Normal Form) | 2NF + no transitive dependency; non-prime attributes depend only on the primary key |
| BCNF (Boyce-Codd NF) | Stronger than 3NF: for every non-trivial FD X→Y, X must be a superkey |
| 4NF | BCNF + no multi-valued dependencies (MVDs); eliminates independent multi-valued facts |
| Transaction Properties (ACID) | Atomicity (all-or-nothing), Consistency (valid state), Isolation (concurrent = serial), Durability (committed = permanent) |
| Serializability | Conflict serializability: precedence graph acyclic → conflict serializable; ensures isolation property |
| Indexing: B+ Tree | Balanced tree; all data in leaf nodes; range queries efficient; most RDBMS default index structure |
Computer Networks: Key Protocols by Layer
| Layer | Protocols and Functions |
|---|---|
| Application (Layer 7) | HTTP/HTTPS (web), FTP (file transfer), SMTP/POP3/IMAP (email), DNS (name resolution), DHCP (IP assignment), Telnet, SSH |
| Transport (Layer 4) | TCP (reliable, connection-oriented, flow & congestion control), UDP (unreliable, connectionless, fast — DNS, streaming) |
| Network (Layer 3) | IP (IPv4/IPv6), ICMP (ping/traceroute), OSPF, BGP, RIP — routing and logical addressing |
| Data Link (Layer 2) | Ethernet (IEEE 802.3), Wi-Fi (IEEE 802.11), MAC addressing, ARP, PPP, HDLC — framing & error detection |
| Physical (Layer 1) | Bit transmission; cables (UTP, STP, fibre), radio, hubs, repeaters; encoding schemes |
Frequently Asked Questions
Q: Is UGC NET Computer Science suitable for B.Tech graduates?
Yes — B.Tech (CS/IT) and MCA graduates are the primary candidates. The syllabus aligns with a standard 4-year CS engineering curriculum. BCA graduates may find some advanced topics (formal languages, complexity theory) less familiar from their degree — additional study in Units 1 and 5 is recommended.
Q: Are programming questions asked in the exam (writing code)?
No — all questions are MCQ. You won't write code, but questions test programming concepts: algorithm complexity, OOP definitions, recursion outcomes, and data structure operations. You need to be able to trace code mentally to determine output or identify errors.
Q: How important is the AI & ML unit (Unit 8) given how fast the field is moving?
The syllabus is relatively stable. Questions focus on foundational AI (search algorithms, knowledge representation, game trees) and classical ML (decision trees, k-NN, SVM, naive Bayes) rather than current deep learning architectures. Deep learning basics (perceptron, backpropagation) are included — but cutting-edge GPT/LLM content is not tested.
Q: What is the difficulty level of Cryptography (Unit 10) questions?
Moderate — questions test conceptual understanding (symmetric vs asymmetric encryption difference, what RSA achieves, when to use digital signatures) rather than mathematical derivations. Know the key algorithm names, their key sizes, and their use cases. RSA, AES, SHA, SSL/TLS are the most tested.
Q: Which competitive exams have similar preparation to UGC NET CS?
GATE CS has similar topic coverage but is much harder in depth — GATE tests at a significantly higher analytical level. UGC NET CS requires breadth over depth. If you've cleared GATE CS, UGC NET CS is accessible with focused previous paper practice. If you're preparing UGC NET without GATE background, standard textbooks (CLRS, Galvin, Korth) at their introductory level are sufficient.
