UGC NET Computer Science and Applications — Paper 2, subject code 87
Paper 2 pattern
Syllabus, unit by unit
Every chapter below is free to read, in English and Hindi.
Unit 1 — Discrete Structures and Optimization
- Mathematical Induction, Discrete Probability and Bayes' Theorem
- Optimization — Linear Programming, Integer Programming, Transportation, Assignment and PERT-CPM
- Propositional and First-Order Logic
- Sets, Relations, Functions, Partial Orders and Lattices
- Monoids and Groups
- Graph Theory — Connectivity, Matching and Colouring
- Combinatorics — Counting, Recurrences and Generating Functions
Unit 2 — Computer System Architecture
- Number Representations and Computer Arithmetic
- Boolean Algebra, Minimisation and Combinational Circuits
- Sequential Circuits — Flip-Flops, Counters and Timing
- Machine Instructions, Addressing Modes and the Data Path
- Cache, Main Memory and Secondary Storage
- Instruction Pipelining, Hazards and the I/O Interface
- Register Transfer Language, Microoperations and Programming the Basic Computer
- Pipeline and Vector Processing, and Multiprocessors
Unit 3 — Programming Languages and Computer Graphics
Unit 4 — Database Management Systems
Unit 5 — System Software and Operating System
Unit 6 — Software Engineering
Unit 7 — Data Structures and Algorithms
- Arrays, Stacks, Queues and Linked Lists
- Trees, Binary Search Trees, Heaps and Graph Representations
- Asymptotic Complexity, Recurrences, Searching, Sorting and Hashing
- Divide and Conquer, Greedy, and Dynamic Programming
- Graph Traversals, Minimum Spanning Trees and Shortest Paths
- Advanced Trees: AVL, B-Tree, B+/B* Tree and Threaded Binary Trees
- Backtracking, Branch-and-Bound and Lower Bound Theory
- Complexity Theory: P, NP and NP-Completeness
- Selected and Advanced Algorithms
Unit 8 — Theory of Computation and Compilers
- Regular Expressions, Finite Automata and Regular Languages
- Context-Free Grammars, Push-Down Automata and the Pumping Lemmas
- Turing Machines, Decidability and Undecidability
- Lexical Analysis and Parsing
- Syntax-Directed Translation, Runtime Environments and Intermediate Code
- Local Optimisation and Data Flow Analysis
- Formal Language Foundations and Unsolvable Problems
Unit 9 — Data Communication and Computer Networks
Frequently asked questions
Is this UGC NET Computer Science and Applications course free?
Yes. All 61 chapters are free to read in English and Hindi. A free account adds the practice questions with scoring, the Paper-2 mock test, spaced revision and the AI mentor.
Does it cover the whole Computer Science and Applications syllabus?
All 10 units of the NTA syllabus (subject code 87) are written, in 61 chapters, from the official document unit by unit.
What is the UGC NET Paper 2 exam pattern for Computer Science and Applications?
100 questions for 200 marks, with no negative marking. Paper 1 and Paper 2 are taken in one sitting of three hours; the mock test here rehearses Paper 2 in 120 minutes.
Official sources
CareerCraft Labs is a private study platform. It is not a government body and is not affiliated with, endorsed by, or authorised by any examination authority. We do not accept applications, conduct examinations, or issue government results.
Notifications, syllabi, exam dates and results are official only on the conducting body's own website. Always verify there before you act on anything you read here.
- NTA — UGC NETugcnet.nta.ac.in
- University Grants Commissionwww.ugc.gov.in