CareerCraftCareerCraft Labs
ENहिं
Start free

Paper 2 · code 87National Testing Agency (for UGC)

Start UGC NET Computer Science and Applications preparation free Like it? Continue at just ₹29/month — less than ₹1 a day

All 10 units of the NTA syllabus in 61 chapters, with Paper 1 in the same course.

First chapter + 1 full mock test free — no card needed

Start freeRead the free chapter
  • 61chapters
  • 10syllabus units
  • 100question Paper 2 mock
  • EN + हिंevery chapter in both

Exam pattern

Paper 2 pattern

UGC NET Paper 2 — Computer Science and Applications

  • 100 questions
  • 200 marks
  • 120 minutes
  • +2 per right answer
  • no negative marking
  • Unit 1 — Discrete Structures and Optimization10 Qs · 20 marks
  • Unit 2 — Computer System Architecture10 Qs · 20 marks
  • Unit 3 — Programming Languages and Computer Graphics10 Qs · 20 marks
  • Unit 4 — Database Management Systems10 Qs · 20 marks
  • Unit 5 — System Software and Operating System10 Qs · 20 marks
  • Unit 6 — Software Engineering10 Qs · 20 marks
  • Unit 7 — Data Structures and Algorithms10 Qs · 20 marks
  • Unit 8 — Theory of Computation and Compilers10 Qs · 20 marks
  • Unit 9 — Data Communication and Computer Networks10 Qs · 20 marks
  • Unit 10 — Artificial Intelligence (AI)10 Qs · 20 marks

What you get

Everything for UGC NET Computer Science and Applications, in one course

  • Chapters in English and Hindi61 chapters on the official syllabus, each ending in a quiz that explains every answer.
  • Mock tests in the real patternTimed and marked the way the exam is, negative marking included, with a section-by-section report.
  • Revision and weak-area analyticsSee which topics cost you marks, and revise them on a spaced schedule.
  • AI mentorPremiumAsk a doubt in English or Hindi, any hour, and get a plain answer.

Try it now

Try a real Computer Science and Applications question

A real question from the course. No sign-up needed.

From the chapter: Mathematical Induction, Discrete Probability and Bayes' Theorem

A proof by mathematical induction on P(n) for n ≥ 1 is INCOMPLETE if it:

Show the answer and why

Answer: A.

A proof needs both the base case AND a generally-quantified inductive step; verifying only the base case, or only a specific instance rather than an arbitrary k, leaves the chain of implications unestablished.

Syllabus

UGC NET Computer Science and Applications syllabus, unit by unit

Open a unit to see its chapters. The course’s free chapter is Paper 1’s first.

Unit 1 — Discrete Structures and Optimization7 chapters
  1. Mathematical Induction, Discrete Probability and Bayes' Theorem
  2. Optimization — Linear Programming, Integer Programming, Transportation, Assignment and PERT-CPM
  3. Propositional and First-Order Logic
  4. Sets, Relations, Functions, Partial Orders and Lattices
  5. Monoids and Groups
  6. Graph Theory — Connectivity, Matching and Colouring
  7. Combinatorics — Counting, Recurrences and Generating Functions
Unit 2 — Computer System Architecture8 chapters
  1. Number Representations and Computer Arithmetic
  2. Boolean Algebra, Minimisation and Combinational Circuits
  3. Sequential Circuits — Flip-Flops, Counters and Timing
  4. Machine Instructions, Addressing Modes and the Data Path
  5. Cache, Main Memory and Secondary Storage
  6. Instruction Pipelining, Hazards and the I/O Interface
  7. Register Transfer Language, Microoperations and Programming the Basic Computer
  8. Pipeline and Vector Processing, and Multiprocessors
Unit 3 — Programming Languages and Computer Graphics6 chapters
  1. Language Design, Translation Issues and Elementary Data Types
  2. Programming in C
  3. Object-Oriented Programming and C++
  4. Web Programming
  5. Computer Graphics Fundamentals
  6. 2D and 3D Geometric Transformations, Viewing and Rendering
Unit 4 — Database Management Systems5 chapters
  1. ER Model, Relational Algebra, Tuple Calculus and SQL
  2. Functional Dependencies, Normal Forms and Integrity Constraints
  3. File Organisation, B+ Trees, Transactions and Concurrency Control
  4. Database Architecture and Enhanced Data Models
  5. Data Warehousing, Data Mining, Big Data and NoSQL
Unit 5 — System Software and Operating System5 chapters
  1. System Calls, Processes, Threads and CPU Scheduling
  2. IPC, Synchronisation and Deadlock
  3. Memory Management, Virtual Memory and File Systems
  4. System Software, Security and Virtual Machines
  5. Linux, Windows and Distributed Operating Systems
Unit 6 — Software Engineering3 chapters
  1. Software Process Models and Requirements Engineering
  2. Software Design and Software Quality
  3. Software Testing and Configuration Management
Unit 7 — Data Structures and Algorithms9 chapters
  1. Arrays, Stacks, Queues and Linked Lists
  2. Trees, Binary Search Trees, Heaps and Graph Representations
  3. Asymptotic Complexity, Recurrences, Searching, Sorting and Hashing
  4. Divide and Conquer, Greedy, and Dynamic Programming
  5. Graph Traversals, Minimum Spanning Trees and Shortest Paths
  6. Advanced Trees: AVL, B-Tree, B+/B* Tree and Threaded Binary Trees
  7. Backtracking, Branch-and-Bound and Lower Bound Theory
  8. Complexity Theory: P, NP and NP-Completeness
  9. Selected and Advanced Algorithms
Unit 8 — Theory of Computation and Compilers7 chapters
  1. Regular Expressions, Finite Automata and Regular Languages
  2. Context-Free Grammars, Push-Down Automata and the Pumping Lemmas
  3. Turing Machines, Decidability and Undecidability
  4. Lexical Analysis and Parsing
  5. Syntax-Directed Translation, Runtime Environments and Intermediate Code
  6. Local Optimisation and Data Flow Analysis
  7. Formal Language Foundations and Unsolvable Problems
Unit 9 — Data Communication and Computer Networks5 chapters
  1. Layering, Switching and the Data Link Layer
  2. IP Addressing, Fragmentation, Routing and the Support Protocols
  3. Transport and Application Layers
  4. Data Communication Fundamentals
  5. Mobile Technology, Cloud Computing and IoT
Unit 10 — Artificial Intelligence (AI)6 chapters
  1. Search, Game Playing and Rational Agents
  2. Knowledge Representation and Expert Systems
  3. Planning, Natural Language Processing and Multi-Agent Systems
  4. Fuzzy Sets and Fuzzy Logic
  5. Genetic Algorithms
  6. Artificial Neural Networks

Price

Start free. Upgrade when you are ready.

  • Basic₹29/monthless than ₹1 a day · every UGC NET chapter, mocks and PYQs
  • Free₹0first chapter + 1 full mock, no card
  • Premium₹399 oncethen ₹29/month · AI mentor, answer writing, unlimited mocks
Start UGC NET free

Prices include GST. Cancel anytime. Fees worked out per day →

FAQ

Frequently asked questions

What does the UGC NET Computer Science and Applications course cost?

The first chapter of the UGC NET course is free. All 61 chapters of this subject, in English and Hindi, unlock with the UGC NET plan — ₹29 a month, less than ₹1 a day, cancel anytime — with scored practice, the Paper-2 mock test and spaced revision. Premium adds 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.

Related

Other Paper 2 subjects

Start UGC NET Computer Science and Applications today

First chapter + 1 full mock test free — no card needed. Then the whole course is ₹29 a month — less than ₹1 a day. Cancel anytime.

Start free

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.

Start free