Next Exam
announced
Date: 14 December 2026
Registration
Official Websites:
Result & Answer Key
completed
Answer Key Date: 17 September 2026
Answer Key Download Url: https://ugcnet.nta.nic.in/
UGC NET COMPUTER SCIENCE
Avatto > > UGC NET COMPUTER SCIENCE
UGC NET COMPUTER SCIENCE
UGC NET Computer Science is an NTA-conducted national exam for Assistant Professor, JRF, and PhD eligibility. It assesses programming, algorithms, databases, operating systems, computer networks, software engineering, and data structures through objective-type questions.
Latest Updates & News
UGC NET June 2026 e-Certificates Released
NTA has released the digital e-certificates for candidates who qualified in the UGC NET June 2026 exam across JRF, Assistant Professor, and PhD admission categories. Candidates can download their certificate from the official portal.
UGC NET December 2026 Exam Dates Out
The National Testing Agency has announced the tentative exam schedule for the December 2026 Cycle. According to the NTA calendar, the exams will be conducted from December 14 to December 19, 2026.
UGC NET June 2026 Re-Exam Results Declared
The NTA has declared the results and category-wise cut-off marks for English, Commerce, and Sociology subjects re-conducted on September 9 and 10, 2026. Qualified candidates can check their scores on the official portal.
Ready to Test Your Knowledge?
Don't just read the syllabus master it. Access our database of hundreds of free interactive practice questions.
Launch Practice Questions Previous Year Papers Launch QuizEligibility
Post Graduation
- Master's degree in Computer Science & Applications or an equivalent discipline from a UGC-recognized university.
- Candidates must have secured at least 55% marks (without rounding off) in their Master's degree.
- Candidates belonging to SC/ST/OBC-NCL/PwD/PwBD/Third Gender categories require at least 50% marks.
- Final Year Students can apply provisionally.
Age Limit for JRF
- General Category - 30 Years
- Others - 35 Years
Age Limit for Assistant Professor
- No limit
Nationality
- The candidate must be an Indian citizen (or otherwise eligible under the conditions specified by the NTA/UGC).
Eligible Postgraduate Degrees
- M.Sc. Computer Science /M.Sc. Information Technology (IT)
- Master of Computer Applications (MCA)
- M.Tech./ME in Computer Science & Engineering
- M.Tech./ME in Information Technology
- M.Tech./ME in Software Engineering
- M.Tech./ME in Artificial Intelligence / Data Science (or related Computer Science specializations)
- Other equivalent postgraduate degrees in Computer Science & Applications recognized by UGC.
Paper Pattern
Paper 1
50
Questions
100
MM
3hrs
Duration
MCQ
Type
Paper 2
100
Questions
200
MM
3hrs
Duration
MCQ
Type
Key Points
2 Marks
Marks per Question
Computer-Based Test (CBT)
Exam Mode
English & Hindi (except language papers)
Question Language
Compulsory
All Questions
📋
Complete Syllabus Breakdown
Click on individual units below to reveal the specific topics and underlying concepts.
Paper II Syllabus (Computer Science & Applications)
Unit I: Discrete Structures & Optimization
- Mathematical Logic & Graph Theory
- Sets, Relations & Functions
- Combinatorics & Discrete Probability
- Linear Programming & Optimization Techniques
Unit II: Computer System Architecture
- Number Systems & Boolean Algebra
- Logic Gates & CPU Organization
- Combinational & Sequential Circuits
- Memory Hierarchy & Cache Memory
- Pipelining , RISC & CISC Architecture
Unit III: Programming Languages & Computer Graphics
- Programming Paradigms
- Object-Oriented Programming
- Data Types & Control Structures
- Recursion & Algorithms
Unit IV: Database Management Systems (DBMS)
- ER Model & Relational Model
- SQL & Normalization
- Transactions & Concurrency Control
- Database Security & Distributed Databases
Unit V: System Software & Operating Systems
- Assemblers, Loaders & Linkers
- Process Management , Threads
- CPU Scheduling , Deadlocks
- Memory Management
- File Systems, Virtual Memory
Unit VI: Software Engineering
- Software Development Life Cycle (SDLC)
- Software Process Models
- Requirements Engineering
- Software Design & Testing
- Software Maintenance & Project Management
- Software Quality Assurance
Unit VII: Data Structures & Algorithms
- Linked Lists & Arrrays
- Stacks & Queues
- Trees & Graphs
- Searching & Sorting
- Algorithm Design Techniques
- Time & Space Complexity
Unit VIII: Theory of Computation & Compiler Design
- Finite Automata , Regular Expressions
- Context-Free Grammars , Pushdown Automata
- Turing Machines , Lexical Analysis
- Parsing Techniques
- Code Generation & Optimization
Unit IX: Data Communication & Computer Networks
- OSI & TCP/IP Models
- Network Devices , Routing Algorithms
- Transport Layer , Network Security
- Wireless Networks , Internet Protocols
- Network Performance
Unit X: Artificial Intelligence
- Intelligent Agents , Search Algorithms
- Knowledge Representation , Expert Systems
- Machine Learning Basics , Neural Networks
- Natural Language Processing (NLP) , Fuzzy Logic
📋
SHORT QUESTIONS
What is Text Mining?
Text Mining/ Text data mining is used for text analysis. It refers to the process of extracting rich information from text.
What are the applications of Data Mining?
The information gathered from Data Mining and Analysis can be used in the following application:-
- Fraud Analytics
- Market Analysis
- Customer Retention
- Product Control
Timeline
14 December 2026
ANNOUNCED
📢
UGC NET December 2026 Cycle Exam
14 December 2026
Cut Offs
Year: June 2026
Category
Cut Off
Unreserved (UR) - Junior Research Fellowship (JRF)
214
Unreserved (UR) - Assistant Professor
180
Unreserved (UR) - PhD Only
158
OBC-NCL - Junior Research Fellowship (JRF)
200
OBC-NCL - Assistant Professor
162
OBC-NCL - PhD Only
146
EWS - Junior Research Fellowship (JRF)
200
EWS - Assistant Professor
162
EWS - PhD Only
142
SC - Junior Research Fellowship (JRF)
188
SC - Assistant Professor
156
SC - PhD Only
140
ST - Junior Research Fellowship (JRF)
182
ST - Assistant Professor
154
ST - PhD Only
138
Accessibility
Oversized Widget
Saved in this browser. Nothing changes for anyone else.