Syllabus

UGC NET Computer Science Syllabus 2026: All 10 Units, Books & Tips

UGC NET Computer Science Syllabus 2026: सभी 10 Units, Books और Tips

Englishहिंदी
📌

Quick Summary

  • •Computer Science Paper 2 covers 10 units — Discrete Structures & Optimization, Computer System Architecture, Programming Methodology, Data Structures & File Structures, Systems & Software, DBMS, Computer Networks & Internet, AI & Machine Learning, Software Engineering, and Security & Cryptography — 100 MCQ, 200 marks
  • •Data Structures (Unit 4), DBMS (Unit 6), and Computer Networks (Unit 7) are highest-yield areas
  • •No negative marking — attempt all 100

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

DetailValue
Subject Code87
Total Questions100 MCQ
Total Marks200
Negative MarkingNone — attempt all 100 questions
Units10 units, ~10 questions each

Unit-Wise Syllabus — Computer Science Paper 2

UnitNameKey Topics
1Discrete Structures & OptimizationSets, 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
2Computer System ArchitectureNumber 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
3Programming MethodologyAlgorithm 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
4Data Structures & File StructuresArrays, 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)
5Systems & SoftwareOperating 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)
6Database Management SystemsData 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
7Computer Networks & Internet TechnologiesOSI 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
8Artificial Intelligence & Machine LearningAI 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
9Software EngineeringSDLC 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)
10Security & CryptographyCryptography 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

TopicBookAuthor
Data Structures & AlgorithmsIntroduction to Algorithms (CLRS)Cormen, Leiserson, Rivest & Stein
Operating SystemsOperating System Concepts (Dinosaur Book)Silberschatz, Galvin & Gagne
Database ManagementDatabase System ConceptsSilberschatz, Korth & Sudarshan
Computer NetworksData Communications & NetworkingForouzan
Computer ArchitectureComputer Organisation & ArchitectureTanenbaum or William Stallings
Software EngineeringSoftware Engineering: A Practitioner's ApproachRoger Pressman

Preparation Strategy

AreaApproach
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 PapersCS 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 StructureSearchInsertDeleteKey Characteristic
Array (sorted)O(log n) binary searchO(n)O(n)Random access O(1); fixed size
Singly Linked ListO(n)O(1) at headO(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 HeapO(n)O(log n)O(log n)Extract min/max in O(log n); Heapsort
AVL TreeO(log n)O(log n)O(log n)Self-balancing; balance factor |−1, 0, +1|

OS Concepts — CPU Scheduling Algorithm Comparison

AlgorithmTypeKey PropertyDrawback
FCFSNon-preemptiveSimple; first come first servedConvoy effect — short jobs wait behind long ones
SJF (Shortest Job First)Non-preemptiveOptimal average waiting time among non-preemptiveStarvation of long jobs; burst time must be known
SRTF (Preemptive SJF)PreemptiveOptimal among all algorithms for min. average waiting timeHigh context switch overhead; starvation possible
Round RobinPreemptiveTime quantum; fair allocation; no starvationHigher turnaround time if quantum too small; context switch overhead
Priority SchedulingBothHighest priority process runs firstStarvation of low-priority processes; solved by ageing

Network Protocols — Layer-Wise Reference (OSI Model)

LayerNameKey ProtocolsFunction
7ApplicationHTTP, FTP, SMTP, DNS, DHCP, SSH, TelnetUser-facing services; interacts with user applications
6PresentationSSL/TLS, JPEG, MPEGEncryption, compression, data format translation
5SessionNetBIOS, RPC, SQL (session)Session establishment, maintenance, termination
4TransportTCP (reliable, connection-oriented), UDP (unreliable, connectionless)End-to-end reliability, flow control, error recovery
3NetworkIP (IPv4/IPv6), ICMP, RIP, OSPF, BGPLogical addressing, routing across networks
2Data LinkEthernet (802.3), Wi-Fi (802.11), ARP, PPPFrame transmission, MAC addressing, error detection
1PhysicalRS-232, DSL, Ethernet cables, Fibre OpticBit 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.

ConceptKey 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
4NFBCNF + 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)
SerializabilityConflict serializability: precedence graph acyclic → conflict serializable; ensures isolation property
Indexing: B+ TreeBalanced tree; all data in leaf nodes; range queries efficient; most RDBMS default index structure

Computer Networks: Key Protocols by Layer

LayerProtocols 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.

UGC NET Computer Science Syllabus 2026: सभी 10 Units, Books और Preparation Tips

Computer Science (Code 87) UGC NET का highly technical subject है। B.Tech, MCA और M.Tech graduates इसमें appear करते हैं। Paper 2 में algorithms, data structures, OS, DBMS, networks, AI और security शामिल हैं — 100 MCQ, 200 marks, no negative marking।

📋 NTA UGC NET June 2026 — Apply Online — Last date: 20 May 2026

Paper 2 Exam Pattern

DetailValue
Subject Code87
Total Questions100 MCQ
Total Marks200
Negative Markingबिल्कुल नहीं

Unit-Wise Syllabus

UnitTopicKey Areas
1Discrete Structures & OptimizationSets, relations, graph theory, combinatorics, linear programming, simplex method
2Computer System ArchitectureNumber systems, Boolean algebra, logic gates, CPU organization, cache, pipelining, RISC vs CISC
3Programming MethodologyAlgorithm paradigms (greedy, DP, backtracking), Big-O complexity, OOP concepts, recursion
4Data Structures & File StructuresArrays, linked lists, stacks, queues, trees (BST, AVL, B-tree), graphs, hashing, sorting
5Systems & SoftwareOS: CPU scheduling, deadlock, memory management (paging, virtual memory); automata theory; compiler design
6Database Management SystemsER model, SQL, normalisation (1NF–BCNF), ACID properties, concurrency control, B-tree indexing
7Computer NetworksOSI 7 layers, TCP/IP, IP addressing, routing protocols, HTTP/FTP/DNS/SMTP, network security
8AI & Machine LearningSearch algorithms (A*), knowledge representation, ML types, decision trees, k-NN, neural networks basics
9Software EngineeringSDLC models, Agile/Scrum, UML, software testing, COCOMO model, design patterns
10Security & CryptographyDES, AES, RSA, digital signatures, SSL/TLS, types of attacks (DoS, SQL injection, XSS), firewalls

Important Books

TopicBookAuthor
DS & AlgorithmsIntroduction to Algorithms (CLRS)Cormen et al.
Operating SystemsOS Concepts (Dinosaur Book)Silberschatz, Galvin & Gagne
DBMSDatabase System ConceptsSilberschatz, Korth & Sudarshan
NetworksData Communications & NetworkingForouzan

Preparation Tips

Units 4 (Data Structures) और 6 (DBMS) सबसे ज़्यादा yield देते हैं — tree traversals, graph algorithms, SQL queries और normalisation problems regular आते हैं। Unit 7 (Networks) में OSI model layers, IP subnetting calculations और protocol names (कौन सा protocol क्या करता है) important हैं। Unit 5 (OS) में CPU scheduling algorithm questions (waiting time, turnaround time calculate करना) consistent आते हैं।

Data Structures — Complexity Quick Reference

Data StructureSearchInsertKey Point
Sorted ArrayO(log n)O(n)Random access O(1)
BST (balanced)O(log n)O(log n)Left < root < right property
Hash TableO(1) avgO(1) avgCollision पर worst case O(n)
Min/Max HeapO(n)O(log n)Extract min/max O(log n)
AVL TreeO(log n)O(log n)Self-balancing; balance factor |−1, 0, +1|

CPU Scheduling Algorithms

AlgorithmTypeKey Property
FCFSNon-preemptiveSimple; convoy effect (short jobs wait behind long ones)
SJFNon-preemptiveOptimal average waiting time; starvation possible
Round RobinPreemptiveTime quantum; fair; no starvation
PriorityBothHighest priority पहले; ageing से starvation solve

OSI Model — Layer-Wise Protocols

LayerNameKey Protocols
7ApplicationHTTP, FTP, SMTP, DNS, DHCP, SSH
4TransportTCP (reliable, connection-oriented), UDP (unreliable)
3NetworkIP, ICMP, RIP, OSPF, BGP
2Data LinkEthernet (802.3), Wi-Fi (802.11), ARP
1PhysicalRS-232, DSL, Ethernet cables, Fibre Optic

डेटाबेस प्रबंधन: सामान्यीकरण और लेनदेन

DBMS कंप्यूटर साइंस पेपर II में सर्वाधिक अंकदायी इकाइयों में से एक है।

अवधारणामुख्य परिभाषा / नियम
1NFदोहराव समूह समाप्त; सभी गुण अपरमाणु; प्रत्येक पंक्ति विशिष्ट रूप से पहचानने योग्य
2NF1NF + आंशिक निर्भरता नहीं; प्रत्येक non-prime गुण पूर्ण PK पर निर्भर
3NF2NF + सकर्मक निर्भरता नहीं; non-prime गुण केवल PK पर निर्भर
BCNFहर गैर-तुच्छ FD X→Y में X एक सुपरकी होनी चाहिए
ACIDपरमाणुता, संगति, पृथकता, स्थायित्व — लेनदेन की चार संपत्तियाँ
B+ Tree इंडेक्ससंतुलित वृक्ष; सभी डेटा पत्ती-नोड्स में; रेंज क्वेरी के लिए कुशल

UGC NET कंप्यूटर विज्ञान: कृत्रिम बुद्धिमत्ता और मशीन लर्निंग

AI/ML अब UGC NET CS पाठ्यक्रम का अनिवार्य हिस्सा है। नीचे परीक्षा में पूछे जाने वाले प्रमुख AI अवधारणाओं का सारांश दिया गया है।

AI/ML क्षेत्रमूल अवधारणामुख्य एल्गोरिदम / तकनीकें
Supervised Learningलेबल किए डेटा से सीखनाClassification (SVM, Decision Tree, KNN) और Regression (Linear, Polynomial) — output ज्ञात है
Unsupervised Learningबिना लेबल के पैटर्न खोजनाK-Means Clustering, Hierarchical Clustering, PCA (dimensionality reduction) — output अज्ञात
Reinforcement Learningपुरस्कार/दंड से सीखनाAgent → Environment → Action → Reward; Q-Learning, Markov Decision Process (MDP)
Neural Networksजैविक न्यूरॉन से प्रेरित मॉडलPerceptron → MLP → Deep Learning; Activation functions: Sigmoid, ReLU, Softmax
Natural Language Processingमानव भाषा को समझना/उत्पन्न करनाTokenization, POS tagging, Named Entity Recognition, BERT, Transformer Architecture
Search Algorithmsसमस्या-समाधान के लिए अवस्था-स्थान खोजBFS, DFS (uninformed); A*, Greedy Best-First (informed/heuristic); Heuristic function h(n)

परीक्षा टिप: Turing Test, LISP भाषा, Expert Systems (MYCIN, DENDRAL), और Knowledge Representation (Semantic Networks, Frames, Ontology) भी पाठ्यक्रम में शामिल हैं। इन पर एक-दो प्रश्न अवश्य आते हैं।

अक्सर पूछे जाने वाले प्रश्न

Q: क्या B.Tech graduates के लिए UGC NET CS suitable है?

हाँ — B.Tech (CS/IT) और MCA graduates primary candidates हैं। Syllabus standard 4-year CS engineering curriculum से closely aligned है। BCA graduates को Units 1 और 5 (formal languages, automata theory) पर extra study करनी चाहिए।

Q: क्या exam में code लिखना होता है?

नहीं — सभी questions MCQ हैं। Code नहीं लिखना, लेकिन algorithm complexity, OOP concepts, data structure operations conceptually समझने होंगे। Mental code tracing ज़रूरी है।

Q: AI & ML unit (Unit 8) में cutting-edge topics (ChatGPT, LLMs) आते हैं?

नहीं — syllabus foundational AI (search algorithms, game trees) और classical ML (decision trees, k-NN, SVM) पर focused है। Deep learning basics (perceptron, backpropagation) include हैं। Latest GPT-4/LLM content tested नहीं होता।

Q: GATE CS clear किया है तो UGC NET CS कितना easy होगा?

बहुत easier — GATE significantly harder depth पर test करता है। UGC NET breadth over depth पर focused है। GATE clear candidates के लिए UGC NET CS mainly previous paper practice की बात है।

UGC NET Computer Science Syllabus 2026: All 10 Units, Books & Tips - Syllabus | RojgarDekho

Share this article

Related Articles

View All
UGC NET English Syllabus 2026: All 10 Units, Books & Strategy - Syllabus | RojgarDekhoSyllabus

UGC NET English Syllabus 2026: All 10 Units, Books & Strategy

English Paper 2 covers 10 units — British Poetry, British Drama, British Fiction, American Literature, Post-Colonial Literatures, Indian Writing in English, Literary Theory & Criticism, Cultural Studies & New Literatures, Language & Linguistics, and Research Methodology — 100 MCQ, 200 marks. Literary Theory (Unit 7) and British Literature (Units 1–3) are the highest-yield areas. No negative marking — attempt all 100.

UGC NET Hindi Syllabus 2026: All 10 Units, Books & Preparation Guide - Syllabus | RojgarDekhoSyllabus

UGC NET Hindi Syllabus 2026: All 10 Units, Books & Preparation Guide

Hindi Paper 2 covers 10 units — Hindi Bhasha aur Lipi ka Vikas, Bhasha Vigyan, Hindi Sahitya ka Itihas, Aadikal aur Bhaktikal, Ritikal, Adhunik Kal Kavya, Adhunik Kal Gadya, Pramukh Kavi aur Lekhak, Alochna, and Anuvaad Vigyan — 100 MCQ, 200 marks. Hindi Sahitya ka Itihas (Units 3–5) and major writers and critics (Units 8–9) are the highest-yield areas in previous papers. No negative marking — attempt all 100.

UGC NET Management Syllabus 2026: All 10 Units, Books & Strategy - Syllabus | RojgarDekhoSyllabus

UGC NET Management Syllabus 2026: All 10 Units, Books & Strategy

Management Paper 2 covers 10 units — Organisational Behaviour & HRM, Business Policy & Strategic Analysis, Accounting for Managers, Financial Management, Marketing Management, Operations & Supply Chain, Quantitative Techniques, Business Environment, Information Systems, and Entrepreneurship & Ethics — 100 MCQ, 200 marks. OB & HRM (Unit 1) and Financial Management (Unit 4) are highest-yield areas. No negative marking — attempt all 100.

UGC NET Education Syllabus 2026: All 10 Units, Books & Strategy - Syllabus | RojgarDekhoSyllabus

UGC NET Education Syllabus 2026: All 10 Units, Books & Strategy

Education Paper 2 covers 10 units — Philosophical & Sociological Perspectives, Psychological Perspectives, Educational Management, Curriculum Studies, Teacher Education, Distance & Adult Education, Educational Technology & ICT, Research Methods & Statistics, Environmental Education, and Guidance & Counselling — 100 MCQ, 200 marks. Educational Psychology (Unit 2) and Research Methods (Unit 8) are the most question-dense areas. No negative marking — attempt all 100.

UGC NET Commerce Syllabus 2026: All 10 Units, Books & Strategy - Syllabus | RojgarDekhoSyllabus

UGC NET Commerce Syllabus 2026: All 10 Units, Books & Strategy

Commerce Paper 2 covers 10 units — Business Environment & Entrepreneurship, Business Management & HR, Accounting & Auditing, Business Economics, Business Finance, Marketing Management, Business Statistics & Research, Banking & Financial Institutions, IT in Business, and Business Law — 100 MCQ, 200 marks. Accounting (Unit 3), Finance (Unit 5), and Marketing (Unit 6) are the highest-yield units. No negative marking — attempt all 100.

UGC NET History Syllabus 2026: All 10 Units, Books & Strategy - Syllabus | RojgarDekhoSyllabus

UGC NET History Syllabus 2026: All 10 Units, Books & Strategy

History Paper 2 covers 10 units spanning prehistoric cultures, ancient India, early medieval period, later medieval India, early modern period, colonial encounter, nationalism and freedom struggle, post-independence India, world history, and historiography — 100 MCQ, 200 marks. Colonial India (Units 6–7) and early medieval period (Units 3–4) are high-frequency areas in previous papers. No negative marking — attempt all 100 questions.

Quick Links / त्वरित लिंक

Latest SSC JobsLatest Railway JobsLatest UPSC JobsLatest Banking JobsUP Govt JobsBihar Govt JobsLatest Admit CardsLatest ResultsPSU JobsArticles