UGC NET Computer Science Syllabus 2026: Download Official PDF & Exam Pattern

The UGC NET (University Grants Commission National Eligibility Test) is a premier national-level examination in India, conducted by the National Testing Agency (NTA). It serves as the gateway for candidates aspiring to secure Assistant Professor roles or Junior Research Fellowship (JRF) positions in prestigious Indian universities and colleges. This computer-based test (CBT) is held biannually in June and December. Candidates preparing for the Computer Science discipline for the upcoming June session can utilize this guide to navigate the official UGC NET Computer Science Syllabus 2026.

UGC NET Computer Science Syllabus & Exam Pattern 2026 

If you are gearing up for the UGC NET Exam in Computer Science, securing the latest syllabus is the first step toward a strategic study plan. To help you maximize your study time, we have compiled the comprehensive UGC NET Syllabus for the Computer Science stream, featuring detailed insights for both Paper 1 and Paper 2.

UGC NET Computer Science Syllabus and Exam Pattern 2026
Organization	National Testing Agency
Exam Name	UGC NET 2026
Subject	Computer Science
Mode of Exam	Online-CBT (Computer-Based Test)
Types of Questions	Multiple Choice Questions
Time Duration	3 Hours (Paper 1- 1 Hour & Paper2- 2 Hour
Number of Papers	Paper 1 & Paper 2 (Computer Science)
Number of Questions	Paper 1- 50 Paper 2 (Computer Science)- 100
Marks	Paper 1- 100 Paper 2 (Computer Science)- 200
Negative Marking	No

UGC NET Answer Key 2026 - Access and Download Here

UGC NET Computer Science Syllabus 2026

Review the detailed breakdown of the UGC NET Computer Science Syllabus 2026 provided below to align your preparation with the official exam requirements:

Unit - 1: Discrete Structures and Optimization

Mathematical Logic: Propositional and Predicate Logic, Equivalences, Normal Forms, Quantifiers, and Rules of Inference.
Sets and Relations: Operations, Properties, Equivalence Relations, and Partial Ordering.
Counting, Induction, and Probability: Pigeonhole Principle, Permutations and Combinations, Mathematical Induction, and Bayes’ Theorem.
Group Theory: Groups, Subgroups, Isomorphisms, Rings, Fields, and Algebraic Structures.
Graph Theory: Paths, Circuits, Shortest Paths, Eulerian/Hamiltonian Paths, Graph Coloring, Trees, and Spanning Trees.
Boolean Algebra: Function representation and simplification.
Optimization: Linear Programming, Simplex Method, Transportation Models, and PERT-CPM for project scheduling.

Unit - 2: Computer System Architecture

Digital Logic Circuits: Logic Gates, Boolean Algebra, Combinational/Sequential Circuits, Multiplexers, and Counters.
Data Representation: Number Systems, Fixed and Floating-Point Arithmetic, and Error Detection Codes.
Register Transfer and Microoperations: Bus and Memory Transfers, Shift Microoperations.
Basic Computer Organization and Design: Instruction Cycles, Memory-Reference Instructions, and Interrupts.
Programming the Basic Computer: Machine and Assembly Language, Assemblers.
Microprogrammed Control: Design of control units and sequencing.
Central Processing Unit: Addressing Modes, RISC vs. CISC architectures.
Pipeline and Vector Processing: Parallel and Instruction Pipelining.
Input-Output Organization: DMA, Interrupts, and Serial Communication.
Memory Hierarchy: Cache, Virtual Memory, and Management.
Multiprocessors: Cache Coherence and Multicore architecture.

Unit - 3: Programming Languages and Computer Graphics

Language Design and Translation: Paradigms, Syntax, and Formal Models.
Elementary Data Types: Scalar and Composite objects.
Programming in C: Arrays, Pointers, Structures, and File Handling.
Object Oriented Programming: Class, Inheritance, Encapsulation, and Polymorphism.
Programming in C++: Constructors, Templates, and Exception Handling.
Web Programming: HTML, XML, Java, and Scripting.
Computer Graphics: Drawing Algorithms, 2D/3D Geometric Transformations, Viewing Pipelines, and Clipping.

Unit – 4: Database Management Systems

Database System Concepts: Data Models, Schemas, and Architecture.
Data Modeling: ER Diagrams and Relational Algebra.
SQL: Queries, Stored Procedures, Triggers, and Security.
Normalization: Functional Dependencies, Concurrency Control, and Recovery.
Enhanced Data Models: Multimedia, Distributed, and Mobile Databases.
Data Warehousing and Mining: OLAP, Clustering, Association Rules, and Social Network Analysis.
Big Data Systems: Hadoop, Map-Reduce, and NoSQL architecture.

Unit- 5: System Software and Operating System

System Software: Compilers, Interpreters, and Macros.
Operating Systems: Processes, Synchronization, and Deadlocks.
Memory Management: Paging, Segmentation, and Replacement algorithms.
Storage and File Systems: Disk Scheduling, RAID, and I/O Management.
Security: Protection, Cryptography, and Authentication.
Linux and Windows: Kernel, Process Management, and Networking basics.
Distributed Systems: Protocols and File Systems.

Unit – 6: Software Engineering 

Software Process Models: Agile, Scrum, XP, and Web Engineering.
Software Requirements: SRS, Use Cases, and Analysis.
Software Design: Modularity, Cohesion, Coupling, and UI Design.
Software Quality: QA, Risk Management, and Reliability.
Estimation and Scheduling: COCOMO, Project Staffing, and Time-line charts.
Software Testing: White-box/Black-box testing, Unit, Integration, and Regression testing.
Software Configuration Management: Version Control and Re-engineering.

Unit – 7: Data Structures and Algorithms 

Data Structures: Stacks, Queues, Linked Lists, Trees, and Graphs.
Algorithm Performance: Time/Space Complexity and Recurrence Relations.
Design Techniques: Divide and Conquer, Dynamic Programming, and Greedy Algorithms.
Graph Algorithms: BFS, DFS, Shortest Paths, and Minimum Spanning Trees.
Complexity Theory: P, NP, and Reducibility.
Advanced Algorithms: Randomized and Approximation algorithms.

Unit – 8: Theory of Computation and Compilers 

Theory of Computation: DFA, NDFA, Regular Languages, and Pumping Lemma.
Context Free Language: PDA, Grammars, and Chomsky Normal Form.
Turing Machines: Recursive Languages and Halting Problem.
Compiler Design: Parsing (LL/LR), Semantic Analysis, and Code Generation/Optimization.

Unit – 9: Data Communication and Computer Networks 

Data Communication: Modulation, Multiplexing, and Transmission Media.
Computer Networks: OSI and TCP/IP models, Routing, and Switching.
Network Layers: IPv4/IPv6, Flow Control, and Congestion Control.
WWW: DNS, E-mail, FTP, and TELNET.
Network Security: Firewalls, VPNs, and Digital Signatures.
Mobile Tech & Cloud: GSM, Wireless LANs, SaaS, PaaS, and IoT basics.

Unit – 10: Artificial Intelligence (AI)

Approaches to AI: Heuristic Search, Game Playing, and Alpha-Beta Pruning.
Knowledge Representation: Logic, Scripts, and Expert Systems.
Planning & NLP: STRIPS, Parsing, and Semantic Analysis.
Multi-Agent Systems: Ontologies and Communication.
Fuzzy Logic & Genetic Algorithms: Membership Functions, Fuzzy Inference, and GA Cycles.
Neural Networks: Perceptrons and Supervised/Unsupervised Learning.