UGC NET – Computer Science & Applications
Category: COMPUTER SCIENCE | 12th October 2025, Sunday
Exam Pattern (UGC NET Computer Science)
| Paper | Total Questions | Marks | Duration | Nature |
| Paper 1 | 50 | 100 | 60 Minutes | Common / General (for All Subjects) |
| Paper 2 | 100 | 200 | 120 Minutes | Subject-specific (Computer Science) |
* Each Correct Answer Carries 2 Marks.
* There Is No Negative Marking For Incorrect Answers.
* The Total Aggregate Is 300 Marks Across Both Papers. ([UGC NET Online][4])
Paper 1: Common / General Syllabus
This Paper Examines teaching & Research Aptitude, Reasoning, General Awareness, Etc. The Typical Topics Include:
1. Teaching Aptitude
2. Research Aptitude
3. Reading Comprehension
4. Communication
5. Reasoning (including Mathematical Reasoning)
6. Logical Reasoning
7. Data Interpretation
8. Information & Communication Technology (ICT)
9. People, Development & Environment
10. Higher Education System: Governance, Polity, And Administration
You Should Cover Basics Of Pedagogy, Research Methods, Analytical Reasoning, Comprehension, And General Awareness Relevant To Higher Education.
Paper 2: Computer Science & Applications Syllabus
This Is The Core Part For The Computer Science Subject. Below Is A Breakdown Of The **10 Major Units** And Key Topics Under Each.
Unit 1: Discrete Structures And Optimization
- Mathematical Logic: Propositional & Predicate Logic, Equivalences, Normal Forms, Rules Of Inference
- Sets, Relations, Partial Orders, Equivalence Relations
- Counting, Permutations & Combinations, Inclusion–Exclusion, Pigeonhole Principle, Discrete Probability, Bayes Theorem
- Mathematical Induction
- Graph Theory: Basic Graphs, Paths, Circuits, Trees, Spanning Trees, Graph Coloring, Shortest Paths
- Boolean Algebra & Its Simplification
- Optimization: Linear Programming, Simplex Method, Integer Programming, Transportation & Assignment Models, PERT/CPM, Resource Leveling, Critical Path Analysis
Unit 2: Computer System Architecture
- Logic Circuits, Combinational & Sequential Circuits, Flip-flops
- Data Representation (binary, Two’s Complement, Floating Point)
- Register Transfer, Micro-operations
- Basic Computer Organization: Instruction Set, Addressing Modes, CPU, Memory, I/O
- Assembly Language, Machine Language, Programs In Basic Computers
- Microprogrammed Control
- Pipelining, Parallel Processing
- Memory Hierarchy, Cache, Virtual Memory, DMA & I/O Organization
Unit 3: Programming Languages And Computer Graphics
- Language Design Issues, Translation, Compilation Phases
- Elementary Data Types, Binding Times, Static Vs Dynamic, Syntax, Binding
- Object Oriented Programming (OOP) Concepts
- Programming Environment, Paradigms
- Graphics: 2D & 3D Geometric Transformations, Viewing, Objects, Representation & Modeling
Unit 4: Database Management Systems
- Basic DBMS Concepts, Architecture, Data Models
- Relational Model, SQL, Normalization (1NF, 2NF, 3NF, BCNF, 4NF)
- Query Processing And Optimization
- Transaction Management, Concurrency Control, Recovery
- Distributed Databases, Data Warehousing & Data Mining
- NoSQL, Object-oriented Database Systems
Unit 5: System Software And Operating Systems
- System Software: Assemblers, Loaders, Linkers, Macro Processors
- Operating System Fundamentals, Process Scheduling, Threads
- Synchronization, Deadlocks
- Storage Management, File Systems, Memory Management
- I/O Systems, Kernel Concepts, System Calls
Unit 6: Software Engineering
- Software Development Life Cycle Models
- Requirements Analysis And Specification
- Software Design (modular, Architectural)
- Coding, Testing (unit, Integration), Debugging
- Maintenance, Metrics, Software Reliability & Quality
- Project Management: Estimation, Scheduling, Risk, Configuration Management
Unit 7: Data Structures & Algorithms
- Complexity Analysis (time, Space, Recurrence Relations)
- Fundamental Data Structures: Arrays, Stacks, Queues, Linked Lists, Trees, Graphs
- Algorithms: Sorting, Searching, Dynamic Programming, Greedy Methods, Divide & Conquer
- Graph Algorithms: Shortest Path, MST, Connectivity
- Advanced Algorithms: String Matching, Computational Geometry, Etc.
Unit 8: Theory Of Computation & Compilers
- Automata Theory (DFA, NFA, PDA), Regular Expressions, Context-free Grammar
- Turing Machines, Decidability, Undecidability
- Complexity Classes (P, NP, NP-complete)
- Lexical Analysis, Parsing, Syntax-directed Translation
- Code Generation & Optimization
Unit 9: Data Communication & Computer Networks
- Basics Of Data Communication, Transmission Media, Signal Modulation
- OSI & TCP/IP Models And Protocols
- Network Devices, Routing, Congestion Control
- Wireless Networks, Mobile Computing
- Network Security, Cryptography, Network Management
Unit 10: Artificial Intelligence (AI)
- Search Techniques, Heuristic Search, Constraint Satisfaction
- Knowledge Representation, Inference, Propositional & Predicate Logic
- Neural Networks, Genetic Algorithms
- Natural Language Processing, Multi-agent Systems
If You Like, I Can Send You A PDF Version Of This Syllabus Or Break Down weightages And Important Topics for Each Unit. Do You Want Me To Share Those?
Tags:
UGC Net Syllabus, UGC NET – Computer Science & Applications
