UGC Computer Science

The UGC NET 2024 exam is scheduled for June 16, 2024. The exam mode is offline, and the duration is 3 hours. It consists of two papers, Paper 1 with 100 marks and Paper 2 with 200 marks. There is no negative marking in this exam. Candidates who clear the UGC NET 2024 exam can apply for Assistant Professor and JRF positions in Indian universities and colleges.

UGC Computer Science

Programme Details

Experience transformative learning with our dedicated team of educators at Pathfinder Academy. We combine passionate expertise with personalized guidance to empower students of all backgrounds. Our highly-qualified teachers, boasting years of experience, tailor their approach to meet individual needs, fostering scientific exploration and competitive confidence.


Testing Methodology

Commencement of Registration

Commencement of Programme

Early access

Duration of programme

Schedule of classes

Medium

Provision of tests

Scholarships

Personal Mentorship

Interview Guidance

Offline classroom

25 th June 2024

1 st July, 2024 -Noida, NCR

25 th June 2024 onwards

1 Year(5days/week)

9:30 AM to 2:00 PM

A hybrid of English only

Bimonthly (objective patterns)

Get Upto 90%* Scholarship

Included | By faculty members

Included | By field expertes

Computer Science

Offline/online Coaching

Course Fee

₹25000

Including GST + Book + Test Series


Payment and Registration

Pay now for Free access to recorded lectures till June 2024 exam


Success Redefined



Raised image
Chandrashekar

Biology Educator

IISC Bengaluru
Raised image
Kumar Shiv

Maths Educator

IIT Dhanbad
Raised image
Abhilash

Maths Educator

NIT College
Raised image
Vinay

Physics educator

NIT Trichy

Paper 1

  • Teaching: Concept, Objectives, Levels of teaching (Memory, Understanding and Reflective), Characteristics and basic requirements.
  • Learner’s characteristics: Characteristics of adolescent and adult learners (Academic, Social, Emotional and Cognitive), Individual differences.
  • Factors affecting teaching related to: Teacher, Learner, Support material, Instructional facilities, Learning environment and Institution.
  • Methods of teaching in Institutions of higher learning: Teacher centred vs. Learner centred methods; Off-line vs. On-line methods (Swayam, Swayamprabha, MOOCs etc.)
  • Teaching Support System: Traditional, Modern and ICT based.
  • Evaluation Systems: Elements and Types of evaluation, Evaluation in Choice Based Credit System in Higher education, Computer based testing, Innovations in evaluation systems.
  • Research: Meaning, Types, and Characteristics, Positivism and Postpositivistic approach to research.
  • Methods of Research: Experimental, Descriptive, Historical, Qualitative and Quantitative methods.
  • Steps of Research.
  • Thesis and Article writing: Format and styles of referencing.
  • Application of ICT in research. • Research ethics.
  • A passage of text be given. Questions be asked from the passage to be answered.
  • Communication: Meaning, types and characteristics of communication.
  • Effective communication: Verbal and Non-verbal, Inter-Cultural and group communications, Classroom communication
  • Barriers to effective communication
  • Mass-Media and Society.
  • Types of reasoning.
  • Number series, Letter series, Codes and Relationships.
  • Mathematical Aptitude (Fraction, Time & Distance, Ratio, Proportion and Percentage, Profit and Loss, Interest and Discounting, Averages etc.).
  • Understanding the structure of arguments: argument forms, structure of categorical propositions, Mood and Figure, Formal and Informal fallacies, Uses of language, Connotations and denotations of terms, Classical square of opposition.
  • Evaluating and distinguishing deductive and inductive reasoning.
  • Analogies.
  • Venn diagram: Simple and multiple use for establishing validity of arguments.
  • Indian Logic: Means of knowledge.
  • Pramanas: Pratyaksha (Perception), Anumana (Inference), Upamana (Comparison), Shabda (Verbal testimony), Arthapatti (Implication) and Anupalabddhi (Non-apprehension).
  • Structure and kinds of Anumana (inference), Vyapti (invariable relation), Hetvabhasas (fallacies of inference).
  • Sources, acquisition and classification of Data.
  • Quantitative and Qualitative Data.
  • Graphical representation (Bar-chart, Histograms, Pie-chart, Table-chart and Line-chart) and mapping of Data.
  • Data Interpretation.
  • Data and Governance.
  • Basics of Internet, Intranet, E-mail, Audio and Video-conferencing.
  • Digital initiatives in higher education.
  • ICT and Governance.
    • ss
  • Development and environment: Millennium development and Sustainable development goals.
  • Human and environment interaction: Anthropogenic activities and their impacts on environment.
  • Environmental issues: Local, Regional and Global; Air pollution, Water pollution, Soil pollution, Noise pollution, Waste (solid, liquid, biomedical, hazardous, electronic), Climate change and its Socio-Economic and Political dimensions.
  • Impacts of pollutants on human health.
  • Natural and energy resources: Solar, Wind, Soil, Hydro, Geothermal, Biomass, Nuclear and Forests.
  • Natural hazards and disasters: Mitigation strategies.
  • Environmental Protection Act (1986), National Action Plan on Climate Change, International agreements/efforts -Montreal Protocol, Rio Summit, Convention on Biodiversity, Kyoto Protocol, Paris Agreement, International Solar Alliance.
  • Institutions of higher learning and education in ancient India.
  • Evolution of higher learning and research in Post Independence India.
  • Oriental, Conventional and Non-conventional learning programmes in India.
  • Professional, Technical and Skill Based education.
  • Value education and environmental education.
  • Policies, Governance, and Administration.

Paper 2

  • Mathematical Logic: Propositional and Predicate Logic, Propositional Equivalences, Normal Forms, Predicates and Quantifiers, Nested Quantifiers, Rules of Inference..
  • Sets and Relations: Set Operations, Representation and Properties of Relations, Equivalence Relations, Partially Ordering..
  • Counting, Mathematical Induction and Discrete Probability: Basics of Counting, Pigeonhole Principle, Permutations and Combinations, Inclusion- Exclusion Principle, Mathematical Induction, Probability, Bayes’ Theorem..
  • Group Theory: Groups, Subgroups, Semi Groups, Product and Quotients of Algebraic Structures, Isomorphism, Homomorphism, Automorphism, Rings, Integral Domains, Fields, Applications of Group Theory.
  • Graph Theory: Simple Graph, Multigraph, Weighted Graph, Paths and Circuits, Shortest Paths in Weighted Graphs, Eulerian Paths and Circuits, Hamiltonian Paths and Circuits, Planner graph, Graph Coloring, Bipartite Graphs, Trees and Rooted Trees, Prefix Codes, Tree Traversals, Spanning Trees and Cut-Sets.
  • Boolean Algebra: Boolean Functions and its Representation, Simplifications of Boolean Functions..
  • Optimization: Linear Programming - Mathematical Model, Graphical Solution, Simplex and Dual Simplex Method, Sensitive Analysis; Integer Programming, Transportation and Assignment Models, PERT-CPM: Diagram Representation, Critical Path Calculations, Resource Levelling, Cost Consideration in Project Scheduling.
  • Digital Logic Circuits and Components: Digital Computers, Logic Gates, Boolean Algebra, Map Simplifications, Combinational Circuits, Flip-Flops, Sequential Circuits, Integrated Circuits, Decoders, Multiplexers, Registers and Counters, Memory Unit..
  • Data Representation: Data Types, Number Systems and Conversion, Complements, Fixed Point Representation, Floating Point Representation, Error Detection Codes, Computer Arithmetic - Addition, Subtraction, Multiplication and Division Algorithms..
  • Register Transfer and Microoperations: Register Transfer Language, Bus and Memory Transfers, Arithmetic, Logic and Shift Microoperations.
  • Basic Computer Organization and Design: Stored Program Organization and Instruction Codes, Computer Registers, Computer Instructions, Timing and Control, Instruction Cycle, Memory-Reference Instructions, Input-Output, Interrupt.
  • Programming the Basic Computer: Machine Language, Assembly Language, Assembler, Program Loops, Subroutines, Input-Output Programming..
  • Microprogrammed Control: Control Memory, Address Sequencing, Design of Control Unit..
  • Central Processing Unit: General Register Organization, Stack Organization, Instruction Formats, Addressing Modes, RISC Computer, CISC Computer..
  • Pipeline and Vector Processing: Parallel Processing, Pipelining, Arithmetic Pipeline, Instruction Pipeline, Vector Processing Array Processors..
  • Input-Output Organization: Peripheral Devices, Input-Output Interface, Asynchronous Data Transfer, Modes of Transfer, Priority Interrupt, DMA, Serial Communication..
  • Memory Hierarchy: Main Memory, Auxillary Memory, Associative Memory, Cache Memory, Virtual Memory, Memory Management Hardware.
  • Multiprocessors: Characteristics of Multiprocessors, Interconnection Structures, Interprocessor Arbitration, Interprocessor Communication and Synchronization, Cache Coherence, Multicore Processors..
  • Language Design and Translation Issues: Programming Language Concepts, Paradigms and Models, Programming Environments, Virtual Computers and Binding Times, Programming Language Syntax, Stages in Translation, Formal Transition Models.
  • Elementary Data Types: Properties of Types and Objects; Scalar and Composite Data Types.
  • Programming in C: Tokens, Identifiers, Data Types, Sequence Control, Subprogram Control, Arrays, Structures, Union, String, Pointers, Functions, File Handling, Command Line Argumaents, Preprocessors.
  • Object Oriented Programming: Class, Object, Instantiation, Inheritance, Encapsulation, Abstract Class, Polymorphism.
  • Programming in C++: Tokens, Identifiers, Variables and Constants; Data types, Operators, Control statements, Functions Parameter Passing, Virtual Functions, Class and Objects; Constructors and Destructors; Overloading, Inheritance, Templates, Exception and Event Handling; Streams and Files; Multifile Programs..
  • Web Programming: HTML, DHTML, XML, Scripting, Java, Servlets, Applets..
  • Computer Graphics: Video-Display Devices, Raster-Scan and Random-Scan Systems; Graphics Monitors, Input Devices, Points and Lines; Line Drawing Algorithms, Mid-Point Circle and Ellipse Algorithms; Scan Line Polygon Fill Algorithm, Boundary-Fill and Flood- Fill.
  • 2-D Geometrical Transforms and Viewing: Translation, Scaling, Rotation, Reflection and Shear Transformations; Matrix Representations and Homogeneous Coordinates; Composite Transforms, Transformations Between Coordinate Systems, Viewing Pipeline, Viewing Coordinate Reference Frame, Window to View-Port Coordinate Transformation, Viewing Functions, Line and Polygon Clipping Algorithms..
  • 3-D Object Representation, Geometric Transformations and Viewing: Polygon Surfaces, Quadric Surfaces, Spline Representation, Bezier and B-Spline Curves; Bezier and B-Spline Surfaces; Illumination Models, Polygon Rendering Methods, Viewing Pipeline and Coordinates; General Projection Transforms and Cipping.
  • Database System Concepts and Architecture: Data Models, Schemas, and Instances; Three-Schema Architecture and Data Independence; Database Languages and Interfaces; Centralized and Client/Server Architectures for DBMS.
  • Data Modeling: Entity-Relationship Diagram, Relational Model - Constraints, Languages, Design, and Programming, Relational Database Schemas, Update Operations and Dealing with Constraint Violations; Relational Algebra and Relational Calculus; Codd Rules..
  • SQL: Data Definition and Data Types; Constraints, Queries, Insert, Delete, and Update Statements; Views, Stored Procedures and Functions; Database Triggers, SQL Injection..
  • Normalization for Relational Databases: Functional Dependencies and Normalization; Algorithms for Query Processing and Optimization; Transaction Processing, Concurrency Control Techniques, Database Recovery Techniques, Object and Object-Relational Databases; Database Security and Authorization.
  • Enhanced Data Models: Temporal Database Concepts, Multimedia Databases, Deductive Databases, XML and Internet Databases; Mobile Databases, Geographic Information Systems, Genome Data Management, Distributed Databases and Client-Server Architectures.
  • Data Warehousing and Data Mining: Data Modeling for Data Warehouses, Concept Hierarchy, OLAP and OLTP; Association Rules, Classification, Clustering, Regression, 4 Support Vector Machine, K-Nearest Neighbour, Hidden Markov Model, Summarization, Dependency Modeling, Link Analysis, Sequencing Analysis, Social Network Analysis..
  • Big Data Systems: Big Data Characteristics, Types of Big Data, Big Data Architecture, Introduction to Map-Reduce and Hadoop; Distributed File System, HDFS.
  • NOSQL: NOSQL and Query Optimization; Different NOSQL Products, Querying and Managing NOSQL; Indexing and Ordering Data Sets; NOSQL in Cloud..
  • System Software: Machine, Assembly and High-Level Languages; Compilers and Interpreters; Loading, Linking and Relocation; Macros, Debuggers
  • Basics of Operating Systems: Operating System Structure, Operations and Services; System Calls, Operating-System Design and Implementation; System Boot.
  • Process Management: Process Scheduling and Operations; Interprocess Communication, Communication in Client–Server Systems, Process Synchronization, Critical-Section Problem, Peterson’s Solution, Semaphores, Synchronization.
  • Threads: Multicore Programming, Multithreading Models, Thread Libraries, Implicit Threading, Threading Issues.
  • CPU Scheduling: Scheduling Criteria and Algorithms; Thread Scheduling, Multiple- Processor Scheduling, Real-Time CPU Scheduling
  • Deadlocks: Deadlock Characterization, Methods for Handling Deadlocks, Deadlock Prevention, Avoidance and Detection; Recovery from Deadlock.
  • Memory Management: Contiguous Memory Allocation, Swapping, Paging, Segmentation, Demand Paging, Page Replacement, Allocation of Frames, Thrashing, Memory-Mapped Files.
  • Storage Management: Mass-Storage Structure, Disk Structure, Scheduling and Management, RAID Structure.
  • File and Input/Output Systems: Access Methods, Directory and Disk Structure; File- System Mounting, File Sharing, File-System Structure and Implementation; Directory Implementation, Allocation Methods, Free-Space Management, Efficiency and Performance; Recovery, I/O Hardware, Application I/O Interface, Kernel I/O Subsystem, Transforming I/O Requests to Hardware Operations.
  • Security: Protection, Access Matrix, Access Control, Revocation of Access Rights, Program Threats, System and Network Threats; Cryptography as a Security Tool, User Authentication, Implementing Security Defenses
  • Virtual Machines: Types of Virtual Machines and Implementations; Virtualization.
  • Linux Operating Systems: Design Principles, Kernel Modules, Process Management, Scheduling, Memory Management, File Systems, Input and Output; Interprocess Communication, Network Structure
  • Windows Operating Systems: Design Principles, System Components, Terminal Services and Fast User Switching; File System, Networking.
  • Distributed Systems: Types of Network based Operating Systems, Network Structure, Communication Structure and Protocols; Robustness, Design Issues, Distributed File Systems.
  • Software Process Models: Software Process, Generic Process Model – Framework Activity, Task Set and Process Patterns; Process Lifecycle, Prescriptive Process Models, Project Management, Component Based Development, Aspect-Oriented Software Development, Formal Methods, Agile Process Models – Extreme Programming (XP), Adptive Software Development, Scrum, Dynamic System Development Model, Feature Driven Development, Crystal, Web Engineering.
  • Software Requirements: Functional and Non-Functional Requirements; Eliciting Requirements, Developing Use Cases, Requirement Analysis and Modelling; Requirements Review, Software Requirment and Specification (SRS) Document
  • Software Design: Abstraction, Architecture, Patterns, Separation of Concerns, Modularity, Information Hiding, Functional Independence, Cohesion and Coupling; Object-Oriented Design, Data Design, Architectural Design, User Interface Design, Component Level Design
  • Software Quality: McCall’s Quality Factors, ISO 9126 Quality Factors, Quality Control, Quality Assurance, Risk Management, Risk Mitigation, Monitoring and Management (RMMM); Software Reliability
  • Estimation and Scheduling of Software Projects: Software Sizing, LOC and FP based Estimations; Estimating Cost and Effort; Estimation Models, Constructive Cost Model (COCOMO), Project Scheduling and Staffing; Time-line Charts
  • Software Testing: Verification and Validation; Error, Fault, Bug and Failure; Unit and Integration Tesing; White-box and Black-box Testing; Basis Path Testing, Control Structure Testing, Deriving Test Cases, Alpha and Beta Testing; Regression Testing, Performance Testing, Stress Testing
  • Software Configuration Management: Change Control and Version Control; Software Reuse, Software Re-engineering, Reverse Engineering
  • Data Structures: Arrays and their Applications; Sparse Matrix, Stacks, Queues, Priority Queues, Linked Lists, Trees, Forest, Binary Tree, Threaded Binary Tree, Binary Search Tree, AVL Tree, B Tree, B+ Tree, B* Tree, Data Structure for Sets, Graphs, Sorting and Searching Algorithms; Hashing
  • Performance Analysis of Algorithms and Recurrences:Time and Space Complexities; Asymptotic Notation, Recurrence Relations.
  • Design Techniques: Divide and Conquer; Dynamic Programming, Greedy Algorithms, Backtracking, Branch and Bound.
  • Lower Bound Theory: Comparison Trees, Lower Bounds through Reductions
  • Graph Algorithms: Breadth-First Search, Depth-First Search, Shortest Paths, Maximum Flow, Minimum Spanning Trees.
  • Complexity Theory: P and NP Class Problems; NP-completeness and Reducibility
  • Selected Topics: Number Theoretic Algorithms, Polynomial Arithmetic, Fast Fourier Transform, String Matching Algorithms.
  • Advanced Algorithms: Parallel Algorithms for Sorting, Searching and Merging, Approximation Algorithms, Randomized Algorithms
  • Theory of Computation: Formal Language, Non-Computational Problems, Diagonal Argument, Russels’s Paradox.
  • Regular Language Models: Deterministic Finite Automaton (DFA), Non-Deterministic Finite Automaton (NDFA), Equivalence of DFA and NDFA, Regular Languages, Regular Grammars, Regular Expressions, Properties of Regular Language, Pumping Lemma, Non- Regular Languages, Lexical Analysis.
  • Context Free Language: Pushdown Automaton (PDA), Non-Deterministic Pushdown Automaton (NPDA), Context Free Grammar, Chomsky Normal Form, Greibach Normal Form, Ambiguity, Parse Tree Representation of Derivation Trees, Equivalence of PDA’s and Context Free Grammars; Properties of Context Free Language
  • Turing Machines (TM): Standard Turing Machine and its Variations; Universal Turing Machines, Models of Computation and Church-Turing Thesis; Recursive and Recursively- Enumerable Languages; Context-Sensitive Languages, Unrestricted Grammars, Chomsky Hierarchy of Languages, Construction of TM for Simple Problems
  • Unsolvable Problems and Computational Complexity: Unsolvable Problem, Halting Problem, Post Correspondence Problem, Unsolvable Problems for Context-Free Languages, Measuring and Classifying Complexity, Tractable and Intractable Problems
  • Syntax Analysis: Associativity, Precedence, Grammar Transformations, Top Down Parsing, Recursive Descent Predictive Parsing, LL(1) Parsing, Bottom up Parsing, LR Parser, LALR(1) Parser.
  • Semantic Analysis: Attribute Grammar, Syntax Directed Definitions, Inherited and Synthesized Attributes; Dependency Graph, Evaluation Order, S-attributed and L-attributed Definitions; Type-Checking
  • Run Time System: Storage Organization, Activation Tree, Activation Record, Stack Allocation of Activation Records, Parameter Passing Mechanisms, Symbol Table.
  • Intermediate Code Generation: Intermediate Representations, Translation of Declarations, Assignments, Control Flow, Boolean Expressions and Procedure Calls
  • Code Generation and Code Optimization: Control-flow, Data-flow Analysis, Local Optimization, Global Optimization, Loop Optimization, Peep-Hole Optimization, Instruction Scheduling.
  • Data Communication: Components of a Data Communication System, Simplex, Half- Duplex and Duplex Modes of Communication; Analog and Digital Signals; Noiseless and Noisy Channels; Bandwidth, Throughput and Latency; Digital and Analog Transmission; Data Encoding and Modulation Techniques; Broadband and Baseband Transmission; Multiplexing, Transmission Media, Transmission Errors, Error Handling Mechanisms
  • Computer Networks: Network Topologies, Local Area Networks, Metropolitan Area Networks, Wide Area Network, Wireless Networks, Internet
  • Network Models: Layered Architecture, OSI Reference Model and its Protocols; TCP/IP Protocol Suite, Physical, Logical, Port and Specific Addresses; Switching Techniques
  • Functions of OSI and TCP/IP Layers: Framing, Error Detection and Correction; Flow and Error Control; Sliding Window Protocol, HDLC, Multiple Access – CSMA/CD, CSMA/CA, Reservation, Polling, Token Passing, FDMA, CDMA, TDMA, Network Devices, Backbone Networks, Virtual LANs. IPv4 Structure and Address Space; Classful and Classless Addressing; Datagram, Fragmentation and Checksum; IPv6 Packet Format, Mapping Logical to Physical Address (ARP), Direct and Indirect Network Layer Delivery; Routing Algorithms, TCP, UDP and SCTP Protocols; Flow Control, Error Control and Congestion Control in TCP and SCTP.
  • World Wide Web (WWW): Uniform Resource Locator (URL), Domain Name Service (DNS), Resolution - Mapping Names to Addresses and Addresses to Names; Electronic Mail Architecture, SMTP, POP and IMAP; TELNET and FTP
  • Network Security: Malwares, Cryptography and Steganography; Secret-Key Algorithms, Public-Key Algorithms, Digital Signature, Virtual Private Networks, Firewalls.
  • Mobile Technology: GSM and CDMA; Services and Architecture of GSM and Mobile Computing; Middleware and Gateway for Mobile Computing; Mobile IP and Mobile Communication Protocol; Communication Satellites, Wireless Networks and Topologies; Cellular Topology, Mobile Adhoc Networks, Wireless Transmission and Wireless LANs; Wireless Geolocation Systems, GPRS and SMS
  • Cloud Computing and IoT: SaaS, PaaS, IaaS, Public and Private Cloud; Virtualization, Virtual Server, Cloud Storage, Database Storage, Resource Management, Service Level Agreement, Basics of IoT
  • Approaches to AI: Turing Test and Rational Agent Approaches; State Space Representation of Problems, Heuristic Search Techniques, Game Playing, Min-Max Search, Alpha Beta Cutoff Procedures.
  • Knowledge Representation: Logic, Semantic Networks, Frames, Rules, Scripts, Conceptual Dependency and Ontologies; Expert Systems, Handling Uncertainty in Knowledge
  • Planning: Components of a Planning System, Linear and Non Linear Planning; Goal Stack Planning, Hierarchical Planning, STRIPS, Partial Order Planning.
  • Natural Language Processing: Grammar and Language; Parsing Techniques, Semantic Analysis and Prgamatics.
  • Multi Agent Systems: Agents and Objects; Agents and Expert Systems; Generic Structure of Multiagent System, Semantic Web, Agent Communication, Knowledge Sharing using Ontologies, Agent Development Tools.
  • Fuzzy Sets: Notion of Fuzziness, Membership Functions, Fuzzification and Defuzzification; Operations on Fuzzy Sets, Fuzzy Functions and Linguistic Variables; Fuzzy Relations, Fuzzy Rules and Fuzzy Inference; Fuzzy Control System and Fuzzy Rule Based Systems
  • Genetic Algorithms (GA): Encoding Strategies, Genetic Operators, Fitness Functions and GA Cycle; Problem Solving using GA.
  • Artificial Neural Networks (ANN): Supervised, Unsupervised and Reinforcement Learning; Single Perceptron, Multi Layer Perceptron, Self Organizing Maps, Hopfield Network.

UGC NET Exam Pattern For Computer Science 2024

UGC NET exam pattern comprises two papers- Paper 1 and 2. As per the prescribed UGC NET 2025 exam pattern, both papers contain multiple-choice questions (MCQs). Candidates need to complete both papers in a single duration of three hours. Have a look at the detailed UGC NET exam pattern 2025 below. Negative marking 0.5 marks.



UGC NET Computer Science

UGC NET Paper Number of Questions Marks
Paper 1 50 100
Paper 2 100 200
Total 150 300

UGC NET Application Form 2025 Important Dates

The UGC NET application form for 2025 is expected to be released in April 2025, along with its notification. The UGC NET 2025 exam is scheduled from June 10 to 21, 2025, for which admit cards will be issued in May 2025.



UGC NET Application Form 2025 Important Dates
UGC NET 2025 Notification (June Session) 20th April 2025
UGC NET 2025 Online Application Process Started 20th April 2025
UGC NET 2025 Online Application Process Ends 19th May 2025
Correction in the Particulars of Application Form online only 21 May 2025 to 23 May 2025
UGC NET Exam Date 2025 18th June 2025
UGC NET Admit Card 2025 Expected in May 2025


UGC NET 2025 Apply Online

The UGC NET 2025 application form for the UGC NET 2025 exam is available on the official website. Candidates need to double-check the information they enter in their online application forms to avoid issues. After submitting the UGC NET 2025 online application form, the Confirmation Page will be generated only when the candidate completes the payment process successfully. The direct link to apply online is provided below.

Steps to Fill UGC NET Application Form 2025

To apply for the UGC NET 2025 examination in the June 2025 cycle and become eligible for Junior Research Fellowship (JRF) and/or Assistant Professor posts, candidates must follow the steps given below in the online application process. Before appearing in the UGC NET 2025 exam, it is recommended that candidates thoroughly review the UGC NET Eligibility Criteria 2025.
  • Step 1: Visit the official website @ugcnet.nta.nic.in by clicking on the provided UGC NET Application Form 2025 link.
  • Step 2: If you are a new user, initiate the registration process by clicking on the “New Registration” button. Alternatively, if you are a returning user, input your details and click on the “SIGN IN” button.
  • Step 3: Enter the necessary information, including the Application Number, Password, and Security PIN, then proceed by clicking the login button.
  • Step 4: Choose your preferred Exam Centre and the medium of the exam for UGC NET 2025.
  • Step 5: Provide your Aadhar card number, select your gender and category, and indicate your employment and qualifying exam status.
  • Step 6: Complete the section on Educational Details, including your most recent qualification, percentage, etc.
  • Step 7: Provide your communication address, phone number and email ID.
  • Step 8: Upload your photo and signature in jpg/jpeg format with a white background.
  • Step 9: Navigate to the payment page and make the payment for the UGC NET 2025 Exam through online mode.
  • Step 10: Click on the “SUBMIT” button and download the confirmation page for future reference.

UGC NET Application Form 2025 (Upload Photograph and Signature)

Applicants must upload their scanned images and signature in JPEG format, following the specifications mentioned in the table below.

UGC NET Application Fee 2025

Candidates must pay the UGC NET Application Fee to submit their application forms successfully. The application fee payment should be made online through the SBI/HDFC/Syndicate/ICICI/Paytm payment gateway, utilizing debit card/credit card/net banking/UPI. The UGC NET Application Fee for different categories in 2025 is as follows.



Application Fee 2025
General Rs 1150/-
General-EWS/OBC Rs 600/-
SC/ST/PwD Rs 325/-



Eligibility Criteria 2025

Candidates who wish to take the exam should carefully review the eligibility criteria on the NTA’s official website. In addition to providing information on the exam dates, the educational authority also publishes eligibility criteria,

Which are based on the following:

  1. Age Limit and Relaxation
  2. Educational Qualifications
Educational Qualification
Eligibility Criteria 2025
Particulars Details
Educational Qualifications Master’s Degree
Age Limit • 30 years for Junior Research Fellowship
• No age limit for Assistant Professorship
Number of Attempts No limit on attempts
Nationality Indian
Subject Eligibility Subject of Post-Graduation as chosen by the candidate


Educational Qualification

Candidates must have the specified educational qualifications to be eligible to apply for the UGC NET exam in 2025. Aside from age, the educational background of the candidate is another critical eligibility criterion to consider. For a general overview of the UGC NET 2025 educational qualification required to participate in the exam, see the table below:

Category Eligibility Criteria
General/ Unreserved/ General-EWS candidates Candidates in this category must secure a minimum of 55% marks in their Master’s Degree or an equivalent examination from universities/institutions recognized by UGC. Subjects such as Computer Science and Applications, Electronic Science, etc., are eligible for the UGC NET Test.
Other Backward Classes (OBC) OBC candidates, falling under the Non-Creamy Layer, along with SC, ST, PwD, and Third Gender category, require a minimum of 50% marks in their Master’s degree or an equivalent examination to qualify for the UGC NET Test.
Master’s Degree Aspiring candidates currently pursuing a Master’s degree or those who have appeared for their qualifying Master’s degree exams are eligible to apply for the UGC NET Test. However, admission is provisional, and confirmation of eligibility for JRF/Assistant Professor roles is contingent upon completing the Master’s Degree.
Third Gender Category Candidates from the Third Gender category benefit from the same fee, age, and eligibility criteria relaxations as candidates in the SC/ST/PwD categories for the UGC NET Test.
Ph.D. degree holders Ph.D. degree holders, completing their Master’s level examination by 19th September 1991 (regardless of result declaration date), are eligible for a 5% reduction in aggregate marks for the UGC NET Test.
Post-Graduate diploma/ certificate from Indian/ Foreign University Candidates holding a post-graduate diploma/certificate from an Indian University or a Foreign University must ensure its equivalence to a Master’s degree from a recognized Indian university through the Association of Indian Universities (AIU), New Delhi, before applying for the UGC NET Test.




Age Limit

The age limit and relaxation criteria for the Junior Research Fellowship (JRF) and Assistant Professorship in UGC NET 2025 are as follows:

  1. The maximum age for applying for the Junior Research Fellowship (JRF) is 30 years.
  2. There is no specified maximum age limit for applying for the role of Assistant Professor.
  3. Candidates belonging to the Scheduled Castes (SC), Scheduled Tribes (ST), Other Backward Classes (OBC), and Persons with Disabilities (PwD), as well as women candidates, are granted a relaxation of five years in the age limit.
  4. Candidates with research experience will receive age limit relaxation equivalent to the time spent on research in the relevant subject of their Post-Graduation degree.
  5. Individuals holding an LLM degree are eligible for a three-year relaxation in the age criteria.


Age Limit
Category Upper Age Limit
JRF (Junior Research Fellowship) Not more than 30 years as of the 1st day of the month in which the examination is concluded.
Assistant Professor No upper age limit for applying to UGC NET 2025 for the role of Assistant Professor.


The UGC NET 2025 provides age relaxations to candidates, as shown in the table below. It is important to note that these age relaxations only apply to candidates applying for the JRF category.



UGC NET 2025 Age Relaxation
Category Age Relaxations
Candidates pursuing LLM degree 3 years
Ex-Army personnel (Service length up to the first day of the month of the UGC-NET) 5 years
SC/ST/OBC (non-creamy layer)/Female/Transgender 5 years
Research candidates (with a valid certificate from the appropriate authority) 5 years

Admit card and cut-off marks


Admit card
The UGC NET Admit Card 2025 has been available for download on the official website. Candidates who have successfully registered for the exam can access their UGC NET Admit Card 2024 by logging in to their accounts on the UGC NET portal using their credentials. It is advisable for candidates to download and print their admit cards well in advance and carry them to their respective exam centres on the day of their exam.

Cut-off marks
The cut-off marks are expected and may vary based on various factors such as the number of applicants, difficulty level of the exam, and other factors. The table below provides the UGC NET English Expected Cut Off 2024.



UGC NET Computer Science Expected Cut Off 2024
Sub. Sub. Code Category AS Cut-Off JRF & AS Cut-Off
General 92-94 96-99
EWS 90-91 94-97
English 30 OBC (NCL) 89-90 92-94
SC 85-87 90-92
ST 82-84 87-88
There is no upper age limit for appearing in the UGC NET professorship exam. However, for the Junior Research Fellowship (JRF) position, candidates must be below or equal to 30 years of age. Meeting other criteria is essential for candidates to be eligible for the UGC NET exam.
While paper 1 comprises 50 questions and paper 2 comprises 100 questions, all in MCQ format with each question carrying 2 marks, it is important to note that there is no negative marking in the UGC NET exam.
The UGC NET 2024 exam is scheduled to take place from June 10 to June 21, 2024.
Yes, the UGC NET syllabus is slated to change as the University Grants Commission (UGC) plans to update the syllabus for all 83 subjects in alignment with the National Education Policy (NEP) 2020. The revised NET syllabus is expected to be implemented in June 2024.
The basic eligibility requirement for applicants is to hold a Master's degree in the relevant subject from a recognized university. For the Junior Research Fellowship (JRF), the upper age limit is 30 years, and candidates must have at least 55% marks in their Master's Degree.