UGC NET Computer Science Syllabus 2024 PDF Download

UGC NET is a competitive exam that is conducted by NTA (National Testing Agency). Computer Science and Applications is one of the popular branches of UGC NET. In this article, we are going to discuss the syllabus of Computer Science and Applications and different terms related to Computer Science and Applications.

UGC (University Grants Commission) has already published the syllabus of Computer Science and Applications. Here, we will discuss the exam and its pattern as well as the syllabus in detail.

UGC NET Syllabus 2024

UGC NET Computer Science Syllabus 2024

The syllabus of any Competitive Exam is the most necessary thing to know before preparing for the exam. This rule also works for UGC NET Computer Science as well.

Below is the detailed overview pattern of this exam. Simply, in this exam, there will be 2 papers consisting of a total of 150 questions for 300 marks, that have to be submitted in 3 hours.

UGC NET Computer Science Exam Pattern 2024
Question Type	Multiple Choice Questions (MCQs)
Number of Papers	No of Papers: 2 Paper 1: General Paper 2: Computer Science Subject
Total Marks	Paper 1: 100 Marks Paper 2: 200 Marks Total Marks: 300
Number of Questions	Paper 1: 50 Questions Paper 2: 100 Question Total Questions: 150
Time Duration	3 Hours
Negative Marking	No

UGC NET 2024 Computer Science Marking Scheme

UGC NET Computer Science Paper has a specific marking scheme. Some of the basic and important key points are discussed below.

• Exam Pattern: UGC NET Computer Science comprised of two papers: Paper 1 and Paper 2. Paper 1 consists of Teaching and Research Aptitude whereas Paper 2 is dependent on the subject chosen by candidate.
• Total Marks: Paper 1 is of 100 marks whereas Paper 2 is of 200 marks. Hence, total marks of UGC NET Computer Science is of 300 marks.
• Type of Questions: Both Paper contains objective type Multiple Choice Questions (MCQs).
• Marking Scheme: UGC NET has a proper marking scheme, where for every correct answer, candidate is awarded with 2 marks and for every incorrect response or unanswered question, 0 marks will be awarded. There is no negative marking in UGC NET Exam.
• Paper 1: Paper 1 consists of 50 questions each of them having 2 marks in case of correct response. Syllabus of Paper 1 consists of Teaching, Research Aptitude, Reasoning Ability, General Awareness, etc.
• Paper 2: Paper 2 is dependent on the subject chosen by the candidate. Like for Computer Science and Applications, there will be 100 questions, for each correct response, candidate will be awarded with 2 marks. There will be no negative marking.
• Qualifying Criteria: To achieve a qualification in UGC NET Exam, candidates must score minimum 40% marks in both Paper 1 and Paper 2 for gaining eligibility for Assistant Professorship.

UGC NET Computer Science Syllabus 2024 Section Wise

UGC NET has a wide range of syllabus that comes under computer science and applications. Below mentioned is the detailed syllabus of UGC NET Computer Science that include subjects like Data Structure and Algorithms, Operating Systems, Databses, Software Engineering, Computer Networks, etc.

Below is a list of the units included in the UGC NET Computer Science Syllabus 2024:

• Discrete Structures and Optimization
• Computer System Architecture
• Programming Languages and Computer Graphics
• Database Management Systems
• System Software and Operating System
• Software Engineering
• Data Structures and Algorithms Data Structures
• Theory of Computation and Compilers
• Data Communication and Computer Networks
• Artificial Intelligence (AI)

UGC NET Computer Science Detailed Syllabus 2024

You will get detailed syllabus of each subject below in the table.

Unit – 1: Discrete Structures and Optimization
Mathematical Logic	Propositional and Predicate Logic Propositional Equivalences Normal Forms Predicates and Quantifiers Nested Quantifiers Rules of Inference
Set 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 Domain 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

Unit – 2 : Computer System Architecture
Digital Logic Circuits and Componentsdetail	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

Unit – 3 : Programming Languages and Computer Graphics
Language Design and Translation Issues	Programming Language Concepts Programming Environments Virtual Computers and Binding Times Programming Language Syntax Stages in Translation Formal Transition Models
Elementary Data Types	Properties of Types and Object 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 Inheritance Encapsulation Abstract Class Polymorphism
Programming in C++	Tokens 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

Unit – 4: Database Management Systems
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, Insert,Delete,Update Statements Views, Stored Procedures 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 Databases, XML and Internet Databases; Mobile Databases Geographic Information Systems, Genome Data Management, Distributed Databases and Client-Server Architectures.
Data Warehousing and Data Miningel	Data Modeling for Data Warehouses, Concept Hierarchy, OLAP and OLTP; Association Rules, Classification, Clustering, Regression, Support Vector Machine, K-Nearest Neighbour, Hidden Markov Modele, 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 Query Optimization Different NOSQL Products Querying and Managing NOSQL Indexing and Ordering Data Sets NOSQL in Cloud.

Unit – 5 : System Software and Operating System
System Software	Machine, Assembly and High-Level Languages; Compilers and Interpreters; Loading, Linking and Relocation; Macros, Debuggers.
Basic 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 MultipleProcessor 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; FileSystem 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 System	Design Principles, Kernel Modules, Process Management, Scheduling, Memory Management, File Systems, Input and Output; Interprocess Communication, Network Structure.
Windows Operating System	Design Principles, System Components, Terminal Service and Fast User Switching; File System, Networking.
Distributed System	Distributed Systems Types of Network based Operating Systems Network Structure Communication Structure and Protocols; Robustness, Design Issues, Distributed File Systems.

Unit – 6 : Software Engineering
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	Software Testing: Verification and Validation; Error, Fault, Bug and Failure; Unit and Integration Testing; 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.

Unit – 7 : Data Structures and Algorithms
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 Algorithm 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 Algorithm	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 Algorithm	Advanced Algorithms: Parallel Algorithms for Sorting Searching and Merging Approximation AlgorithmsRandomized Algorithms

Unit – 8 : Theory of Computation and Compilers
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 Language Regular Grammars Regular Expressions Properties of Regular Language Pumping Lemma NonRegular 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 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 RecursivelyEnumerable 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.

Unit – 9 : Data Communication and Computer Networks
Data Communication	Components of a Data Communication System Simplex, HalfDuplex 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 Network	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.
Fucntions 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 Fucntions 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. 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 nd IoT IPv6 Packet Format, Mapping Logical to Physical Address (ARP), Direct and Indirect Network Layer Delivery; Routing Algorithms TCP UDP SCTP Protocols Flow Control, Error Control and Congestion Control in TCP and SCTP.
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 nd IoT	SaaS PaaS IaaS Public and Private Cloud Virtualization Virtual Server Cloud Storage Database Storage Resource Management Service Level Agreement Basics of IoT

Unit – 10 : Artificial Intelligence (AI)
Approaches to AI	Turing Test ,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
NLP	Grammar and Language Parsing Techniques Semantic Analysis and Pragmatics.
Multi Agent System	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 Algorithm(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

Download PDF – UGC NET Computer Science Syllabus 2021

Here is the download link to get the official UGC NET Computer Science Syllabus. The code of this subject is (087). Candidate can easily download the updated syllabus of UGC NET Computer Science as mentioned by the official authority. Candidates are advised to prepare the topic according to given syllabus that helps to gain good marks in UGC NET Exam. The direct link to download syllabus is given below:

Download UGC NET 2024 Computer Science Syllabus PDF

Tips to Score More in UGC NET Computer Science

There are several ways to score more in UGC NET Computer Science Exam. Some of the important ways to score more in UGC NET Paper are mentioned below:

• Understanding Syllabus and Exam Pattern: Understanding Syllabus and Exam Pattern not only helps in UGC NET, but in every exam. It helps candidates to get a good score in the exam. Candidates must go to syllabus and exam pattern before start preparing for the partclular exam.
• Proper Study Plan: Proper Study Plan is a key to achieve result in any exam. Study Plan is dependent on particular candidate, how much he/she is able to study and execute his/her efforts.
• Focus on Concepts: It is always advisable to every candidate to focus on Concepts rather than just practicing questions. Concepts help in gaining good score when question is a bit hard.
• Solve PYQs: PYQs help you in understanding what type of questions come in exam and it also helps in managing time to be given for each question. Every candidate must solve previous year questions before going to actual exam.
• Go with Mock Test Series: Mock Tests gives you a idea of exam before the actual exam. It also helps in management of time during the actual exam, which is a very important skill in the exam.
• Revision: Revision is the important part of preparation for any candidate. It helps in remembering the concepts easily.
• Time Management: Time Management is a skill that has to be gained by each candidate doing preparation for any exam whether UGC NET or any other.
• Stay Updated: Always stay updated with the dates of the exam, schedule of the examination, etc so that you can adapt to changes in case if it happens.
• Clarify Doubts: Always clear with your doubts if you are getting any rather it is of questions, exam schedules, preparation, etc. It will help you in getting more closer towards success.

UGC NET 2024 CS Syllabus – FAQs

Q1. Where can I find the UGC NET 2024 Computer Science and Applications syllabus?

Ans. You can find the syllabus on the official UGC NET website.

Q2. Is there any change in the 2024 syllabus compared to previous years?

Check the official website for updates on syllabus changes.

Q3. Can I download the syllabus in PDF format?

Yes, you can usually download it in PDF from our site and also from the official website.

Q4. What should I focus on while preparing for the exam?

Focus on topics like data structures, algorithms, networks, and programming languages as per the syllabus.

Q5. Can I get previous years’ question papers for practice?

Yes, previous years’ question papers are available online for practice.

Q6. How can I stay updated with any changes or notifications?

Ans. Visit the official UGC NET website and subscribe for updates to stay informed.