UGC NET Computer Science 2024 [Complete Details] Latest Syllabus, Best Books, Exam Pattern, Eligibility, Previous Year Question Paper
In This Blog, We Discuss All Important Details of UGC NET Computer Science Exam Like Syllabus, Books, Exam Pattern, Eligibility Criterion,Previous year Paper & Many More Details
UGC NET Computer Science Exam 2024 is one of The Important Subjects of the UGC NET Exam, More Then 1lakh Students Appeared Every Year in the Exam. This Exam is As Pretigous GATE CS The Syllabus Also Quite Similar But As Level of Difficulty, The Gate Exam is Much Harder than Qualified UGC NET Computer Science Exam. The Two Main Reason the First Reason is Syllabus is Less Then Gate & Second Reason in UGC NET Computer Science Exam No Negative Marking.
- In This Blog, We Discuss All Important Details of UGC NET Computer Science Exam Like Syllabus, Books, Exam Pattern, Eligibility Criterion,Previous year Paper & Many More Details
- UGC NET Computer Science 2024 Exam Highlights-
- UGC NET Computer Science Latest Syllabus 2024-
- Unit -1 Discrete Structures and Optimization
- Unit – 2 Computer System Architecture
- 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
- Unit – 8 : Theory of Computation and Compilers
- Unit – 9 : Data Communication and Computer Networks
- Unit – 10 : Artificial Intelligence (AI)
- Most Important Topics for UGC NET Computer Science Asked Questions in 2019 & 2020 Exam
- UGC NET Latest Books for UGC NET Computer Science 2024-
- UGC NET Computer Science Exam Pattern 2024 Exam –
- UGC NET Marking Scheme 2024
- UGC NET Computer Science Eligibility Criteria 2024
- UGC NET Age Limit and Relaxation 2024
- UGC NET Exemptions for Assistant Professor
- UGC NET Exam Computer Science 2023 Official Cut-off –
- Who Can Apply for UGC NET Computer Science Exam?
- UGC NET Computer Science Previous Year Question Paper 2019 & 2020
- UGC NET Computer Science Study Notes 2024 Exam [Preview]
- How to Prepare for UGC NET Computer Science Exam 2024 –
- UGC NET Computer Science 4-Month’s Preparation Plan 2024
- Frequently Asked Questions [FAQ] Computer Science-
- Question 1. What is the Weightage of Paper-1 Subject in UGC NET Computer Science Paper-2 ?
- Question 2. How Many Questions Comes from Each Unit of UGC NET Computer Science Subject ?
- Question 3- What is the Cut-off of UGC NET Computer Science ?
- Question 4 -What are the Best Books for UGC NET Computer Science Subject ?
- Question -6 How can I revise the UGC NET Computer Science Syllabus?
- Question -7 Does Online Test Series Help to Crack UGC NET Computer Science Exam ?
- Question – 8 What is the UGC NET Computer Science minimum Educational Qualification?
- Question -9 What type of questions are asked in UGC NET Computer Science ?
- Question -10 Is the UGC NET Computer Science Syllabus difficult?
- Question -11 What is the UGC NET Computer Science paper pattern?
UGC NET Computer Science 2024 Exam Highlights-
Particulars | Details |
Name of the Exam | National Eligibility Test (NET) |
Conducting Body | National Testing Agency (NTA) |
Frequency of the Exam | Twice a Year |
Mode of Examination | Online |
Type of Questions | Multiple Choice Questions (MCQs) |
Number of Papers | Paper I Paper II [Computer Science] |
Number of Questions | 150 |
Time Duration | 3 hours |
Negative Marking | No |
Official Website | ugcnet.nta.ni |
Subject | Computer Science |
UGC NET Computer Science Latest Syllabus 2024-
Even though the subject Topics involved are not as complicated as most other subjects, the syllabus itself is chock full packed with information. You will be required to break it down accordingly and approach a holistic way of Covering the Syllabus & Learn Topics in Depth. We’ve provided not only the units but also the chapters as well as the topics included in them. It will help you get an idea of what’s to come in the exams themselves. It would be easier to pickup, up what topics under them are involved.
Unit -1 Discrete Structures and Optimization
This particular unit is all about the fundamentals Use of Mathematical Equations in Computer Science. Most of the topics involved include the Definitions, Principles, and Importance of Computer Sciences, the Logic between Math and Computer Science, theory, algebra, and other topics that emphasize Programming & Mathematical Equations & Theories use in Computer Science. As Per Exam Weightage from This Unit Around 5 to 8 Questions are Asked Every Year.
Chapters | Topics |
---|---|
Mathematical Logic: | Propositional and Predicate Logic, Propositional Equivalences, Normal Forms, Predicates and Quantifiers, Nested Quantifiers, Rules of Inference. |
Sets and Relations | 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. |
Unit – 2 Computer System Architecture
This particular unit is all about the fundamentals of Computer System Architecture & Use in Computer Science . Most of the topics involved the Definitions, the Types, and the Importance of Computer System Architecture, the Define all Achitecture Tools in Details and other topics that emphasize Basic Computer Organization and Design,Units, hardware & CPU use in Computer System Architecture. As Per Exam Weightage from This Unit Around 6 to 8 Questions are Asked Every Year.
Chapters | Topics |
---|---|
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 |
Unit – 3 : Programming Languages and Computer Graphics
This particular unit is all about the fundamentals of Programming Languages & Graphics & Use in Building Program’s . Most of the topics involved the Concepts, Models, the Types of Data, and the Importance of Computer Graphics, the Define all Programming Tools in Details and other topics that emphasize Programming in C,C++ & Web Programming. As Per Exam Weightage from This Unit Around 7 to 10 Questions Asked Every Year.
Chapters | Topics |
---|---|
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 FloodFill. |
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
This particular unit is all about All the fundamentals of Database Management Systems & Data Formations . Most of the topics involved the Concepts of Data, Use of Data, the Types of Data, and the Importance of Big Data Systems, the Define all Data System Tools in Details and other topics that emphasize Normalization for Relational Database,Data Warehousing and Data Mining. As Per Exam Weightage from This Unit Around 8 to 10 Questions Asked Every Year.
Chapters | Topics |
---|---|
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, 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. |
Unit –5 : System Software and Operating System
This particular unit is all about All the fundamentals of Software and Operating System . Most of the topics involved the Concepts of Operating System, Use of Operating System, the Types of Software, and the Importance of Software Systems, the Define all Operating System Tools in Details and other topics that emphasize Storage Management ,File and Input/Output Systems and Virtual Machines. As Per Exam Weightage from This Unit Around 8 to 9 Questions Asked Every Year.
Chapters | Topics |
---|---|
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, 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. Types of Virtual Machines and Implementations; Virtualization. |
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. |
Unit – 6 : Software Engineering
This particular unit is all about All the fundamentals of Software and Models . Most of the topics involved the Concepts of Software Engineering ,Software Testing, Use of Operating System, the Types of Software, and the Importance of Software Systems, the Define all Software Configuration Management in Details and other topics that emphasize Software Testing. As Per Exam Weightage from This Unit Around 7 to 9 Questions Asked Every Year.
Chapters | Topics |
---|---|
Software Process Model | 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. |
Unit – 7 : Data Structures and Algorithms
This particular unit is all about All the fundamentals of Data Structures and Algorithms . Most of the topics involved the Concepts of Data Structures ,Theory, Use of Algorithms, the Types of Design Techniques, and the Importance of Advanced Algorithms, the Define all Data Structure in Details and other topics that emphasize Complexity Theory. As Per Exam Weightage from This Unit Around 7 to 8 Questions Asked Every Year.
Chapters | Topics |
---|---|
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. |
Unit – 8 : Theory of Computation and Compilers
This particular unit is all about All the elaboration of Theory of Computation . Most of the topics involved the Concepts of Compilers ,Theory of Computation, Language Models, the Types of Computational Complexity, and the Importance of Syntax Analysis, the Define all Language Models in Details and other topics that emphasize Turing Machines. As Per Exam Weightage from This Unit Around 8 to 10 Questions Asked Every Year.
Chapters | Topics |
---|---|
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, 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’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 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
This particular unit is all about All the Fundamentals of Data Communication . Most of the topics involved the Concepts of Networks ,Functions ,Technology, Broadband the Types of Functions of OSI, and the Importance of Network Security, the Define all type Cloud Computing in Details and other topics that emphasize World Wide We. As Per Exam Weightage from This Unit Around 8 to 10 Questions Asked Every Year.
Chapters | Topics |
---|---|
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 | 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. |
Unit – 10 : Artificial Intelligence (AI)
This particular unit is all about All the Fundamentals of AI . Most of the topics involved the Concepts of AI ,AI Functions ,AI Technology, Artificial Intelligence the Types & Functions, and the Importance of Artificial Intelligence, the Define all type Genetic Algorithms in Details and other topics that emphasize Language Processing. As Per Exam Weightage from This Unit Around 7 to 10 Questions Asked Every Year.
Chapters | Topics |
---|---|
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 | 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. |
Most Important Topics for UGC NET Computer Science Asked Questions in 2019 & 2020 Exam
- Boolean Algebra
- Eulerian Paths and Circuits
- Bayes’ Theorem
- Hamiltonian Paths and Circuits
- PERT-CPM
- Basic Computer Organization and Design
- Microprogrammed Control
- Memory Management Hardware
- Union, String, Pointers, Functions
- HTML, DHTML
- SQL
- Distributed Databases and Client-Server Architectures
- CPU Scheduling
- Deadlocks
- File and Input/Output Systems
- Linux Operating Systems
- COCOMO
- Reverse Engineering.
- B Tree, B+ Tree, B* Tree,
- Syntax Analysis
- Functions of OSI and TCP/IP Layers
- Artificial Neural Networks (ANN)
Note – Remaining All Topics of All 10 Units Are Important From Each Unit 7 to 8 MCQ Ask in Exam
UGC NET Latest Books for UGC NET Computer Science 2024-
Here are Good Reference Books for UGC NET Computer Science
If You Looking Best & Details Study Notes for UGC NET Computer Science Designed By Expert Faculties to Take Free Demo Click on Link – https://wa.link/2al05s
Click On Above Link or Call/Whats App – 7310762592
UGC NET Computer Science Exam Pattern 2024 Exam –
Total Number of Questions in UGC NET 2024
- UGC NET 2024 will have a total of 150 multiple-choice questions.
- Paper 1 will have 50 questions and Paper 2 will have 100 questions.
- There is No Restriction to move to and fro among the Papers.
- All the questions are compulsory to attempt.
- you will get 2 marks for each correct response
- If a question is found to be incorrect/ambiguous during the critical challenge, only those candidates who have attempted the question and chosen one of the correct answers would be given credit. Only for dropped question(s), if any, marks will be given to all the candidates.
The table below shows the exam pattern of UGC NET Paper 1 and Paper 2:
Particulars | UGC NET Paper-I Overview | UGC NET Paper-II Overview |
Exam mode | Online | Online |
Exam duration | 3 hours (180 minutes) | |
Type of paper | Common for all candidates | Subject-specific questions |
Total questions | 50 | 100 |
Type of questions | MCQs; 4 options with only 1 correct option | MCQs; 4 options with only 1 correct option |
Total marks | 100 | 200 |
Marking scheme | 2 marks for the correct answer 0 for an incorrect answer | 2 marks for the correct answer 0 for an incorrect answer |
Language of paper | English and Hindi | English |
UGC NET Marking Scheme 2024
- A uniform marking scheme is followed in the exam i.e. for both Paper 1 and 2, each correct answer will fetch you 2 marks.
- As per the revised exam pattern of the UGC NET exam, there is no negative marking for incorrect answers.
- Hence, instead of skipping a question, one can use their calculated guess and mark the answer.
The updated marking scheme of UGC NET is given below:
Type of Answer | Marks Allotted |
---|---|
Correct Answer | 2 marks |
Incorrect Answer | 0 mark |
No Answer | 0 mark |
UGC NET Computer Science Eligibility Criteria 2024
Candidates securing at least 55% marks in their Master’s Degree or equivalent from recognized universities in Computer Science Like MSc in Computer Science,MCA,M.tech,etc
- However, candidates belonging to the non-creamy layer of other backward classes (OBC-NC), scheduled caste (SC), scheduled tribe (ST), persons with disability (PwD), and transgender category have to score at least 50% marks.
- Candidates who are pursuing their Master’s degree or are waiting for their result or whose qualifying examinations have been delayed can apply for the test.
- However, such candidates will be admitted provisionally and will be considered for award of JRF or recruitment as Assistant Professor only when they will pass their Master’s Degree with at least 55% marks (50% marks for reserved category).
- Such candidates will also have to complete their Master’s degree within two years from the date of the UGC NET 2023 Result with the required percentage of marks, failing which they will be treated as disqualified.
- Candidates with a Ph.D. degrees whose Master’s level examination was completed before September 19, 1991 (irrespective of the date of declaration of result) will be eligible for a relaxation of 5% in aggregate marks (i.e. from 55% to 50%) for appearing in UGC NET 2021.
- Transgender candidates will be provided the same relaxation in fee, age, and qualifying criteria for NET (i.e. JRF and Assistant Professor) as are available to SC/ ST/ PwD categories. The subject-wise cutoffs for the transgender category will be the lowest among those for SC/ ST/ PwD/ OBC–NCL categories in the respective subject.
- Candidates are suggested to choose the same NET subject for Paper 2 as their specialization in Post Graduation. However, if your post-graduation subject is not covered in the list of 81 NET subjects, you can appear in a related subject.
- Candidates possessing Post Graduation Diploma/ Certificate awarded by Indian University/ Institute or foreign degree/ diploma/ certificate awarded by a foreign University/ institute should in their own interest, ascertain the equivalence of their diploma/ degree/ certificate with Master’s degree of recognized Indian universities from Association of Indian Universities (AIU), New Delhi.
UGC NET Age Limit and Relaxation 2024
UGC NET 2024 Age Limit and Relaxation for Junior Research Fellowship and Assistant Professorship are given below:
- Junior Research Fellow (JRF) Eligibility: Candidates should not be more than 31 years as of October 1, 2024.
- Candidates belonging to OBC-NC, SC, ST, PwD categories, Transgenders, and women applicants are provided a relaxation of up to 5 years.
- Candidates with research experience will also be provided age relaxation equivalent to the years/ period spent on research in the respective subject or Post Graduation Degree.
- Relaxation to researchers can be of up to 5 years and will only be provided on production of a certificate from the appropriate authority.
- Candidates with L.L.M. Degree will be permitted an upper age relaxation of 3 years.
- Candidates who have served in the armed forces will be provided the benefit of relaxation of up to 5 years subject to the length of service in the armed forces up to June 1, 2023.
- Total age relaxation on the above ground(s) shall not exceed five years under any circumstances.
- Assistant Professor: There is no upper age limit to apply for Assistant Professor.
UGC NET Exemptions for Assistant Professor
NET/ SET/ SLET is the minimum eligibility condition for recruitment and appointment of Assistant Professorship in Indian Universities and Colleges. However, certain exemptions from NET/ SET/ SLET will be governed by UGC regulations and amendments notified in the Gazette of India from time to time.
- Candidates who have passed UGC/ CSIR/ JRF examination before 1989 are exempted from appearing in NET.
- Candidates who have cleared States Eligibility Test (SET) accredited by UGC for Assistant Professor held before June 1, 2002, are exempted from appearing in NET and are eligible to apply for Assistant Professor anywhere in India.
- However, candidates qualified in SET held after June 1, 2003, are eligible to apply for the post of Assistant Professor only in the universities and colleges situated in the respective states.
UGC NET Exam Computer Science 2023 Official Cut-off –
UGC NET Computer Science is one of the Favorite subject of the students Among the UGC NET Exam Computer Science Subject’s, In Every Six Months Term Around 45000 to 55000 Students appeared for UGC NET Computer Science this time [December 2023] 45248 students appeared for UGC NET Computer Science and As per the past year cutoff This time Gone little bit High you can check all the details below in Table
Code | Subject Name | Total Appeared | Qualified for NET | Qualified for NET & JRF | Marks for NET | Marks for JRF |
---|---|---|---|---|---|---|
12 | Computer Science | 30337 | 1859 | 267 | Gen- 162 [54%] EWS 148 OBC 144 SC- 136 ST – 134 | Gen- 186 [62%] EWS 176 OBC- 168 SC – 156 ST – 156 |
Download Free Study Notes For UGC NET Paper-1 &2 [Trusted By Thousands of Students ] |
Free Study Kit UGC NET Paper-1 Download |
UGC NET Previous Year Question Paper All Subjects |
UGC NET Study Notes [All Subjects ] |
Join Free Online Classes UGC NET Paper-1 |
Complete Study Plan UGC NET |
UGC NET Latest Syllabus [All Subjects ] |
UGC NET 200 + Free Online Test Series Paper-1 |
Who Can Apply for UGC NET Computer Science Exam?
The Candidate Who has Passed Post Graduation in Computer Science or In Final Year from Any UGC NET Recognized University. There are Some Masters Degree Given Below-
- M.tech in Computer Science
- MCA in Computer Science
- Msc in Computer Science
- Msc in Informatics & Information Sciences.
- Msc in Geographical Information Systems (GIS)
- Msc in Business Information Systems.
- Msc. in AI
- Msc. in Data Science & Big Data.
- Msc. in Health Informatics.
- Msc in Human Computer Interaction.
- & Many More
UGC NET Computer Science Previous Year Question Paper 2019 & 2020
UGC NET Computer Science Study Notes 2024 Exam [Preview]
How to Prepare for UGC NET Computer Science Exam 2024 –
Understand the UGC NET Computer Science exam pattern: The exam pattern of UGC NET Psychology helps you in shaping your preparation in many ways.
- First, it tells you that only multiple-choice questions are asked in the UGC NET Computer Science exam, so there is no point preparing for subjective answers of 5-10 lines. Your preparation needs to be objective oriented. You will have to allot more time to learn specific details and not whole paras.
- Second, since there is no negative marking, it allows you to take risks and go for answers to what you think might be a correct option.
- Third, you get to know how many marks you will be awarded for every write answer – 2 marks for every correct answer. So, you can set an easy target for yourself accordingly
In-depth analysis of the UGC NET Syllabus Paper 1 & Paper 2: The syllabus is no less than the bible to the students.
- Proper analysis of the syllabus is especially important in order to understand what all topics must be covered in order to be able to answer questions that come in the exam.
- The main point behind following the syllabus is that it saves a lot of your time. History as a subject is so vast that there can be no end to what you have to study, but now that you have a well-framed syllabus in your hand you have the advantage to stick to it.
- Work towards time management: From the above tip you must have known by now that you get only 3 hours to complete 150 MCQs without any break. That can be tough for those who are not good in managing time.
- For getting a better hand over completing the paper on time, you will need to solve old UGC NET Computer Science question papers. The more you practice, the more you will get used to handling the questions in time. You should use a stopwatch to calculate your speed and time.
- Secondly, if you will have a look at your syllabus, the first thing which will come to your mind is its length. You do not have to get discouraged by assuming that it’s lengthy and impossible. What you need to do instead is prepare a study schedule for yourself.
- Revision is the secret recipe: Revision is the final touch that you give to your exam preparation to make your foundation more and more concrete. It is very important to revise what you have been studying all along so that you are confident of the syllabus in general and each topic in particular.The best way to revise is to take mock tests and solve practice papers that can be found online and even in bookstores.
- To be even surer of your preparations, you can solve previous year question papers and check your scores to assess your progress.
- One other way to revise is making notes while you are preparing. Once you are done with the syllabus, you can go through your notes where you have noted down all the important points covering each topic. This way when you write your spellings also get stronger and you memorise the names properly.
- Another important tip is that you should always start your revision with sections that are relatively tougher for you so that they also change to stronger topics in time.
- Motivate yourself physically and mentally: The last and the most important thing to complete your preparation properly is your personal well-being. Your physical and mental well-being can be ensured by not over stressing yourself and doing away with any presumptions that an exam is tough and it is very hard to qualify. You need to focus on your eight hours of study and completion of the syllabus,
UGC NET Computer Science 4-Month’s Preparation Plan 2024
This gives you 4 months to prepare for the examination. Now we are fully aware of the fact that a single time-table cannot suit everyone’s preference. So, being mindful of that, we have prepared you a standard plan which you can modify as per your Schedule and daily schedule.
Preparation Time | 4 Months (16 Weeks) |
Total Chapters/ Topics to Prepare | 10 |
Total Sub-Topics | Over 80 + |
Studying Hours Per Day | 4 – 5 Hours |
Number of Days Required to Prepare Each Unit | 10 Days |
Number of Chapters Completed in a Month | 2 Chapters |
Break Days or Extra Days Each Month | 2 – 3 Days* |
Time Taken to Complete Entire Syllabus | 3.5 Months |
Remaining Time | 15 Days |
Days to Solve Sample Papers/ Model Papers/ Mock Tests | 20 Days |
Days Left for Final Revision | 15 Days |
Frequently Asked Questions [FAQ] Computer Science-
Question 1. What is the Weightage of Paper-1 Subject in UGC NET Computer Science Paper-2 ?
Ans – Total 150 Question in Exam .Out of it 100 Questions from UGC NET Computer Science & 50 Questions from Paper-1 ,Each Question of 2 Marks total 300 Marks You Can attempt all 150 MCQ.
Question 2. How Many Questions Comes from Each Unit of UGC NET Computer Science Subject ?
Ans – From Each unit 7 to 10 Questions Asked in Exam of UGC NET Computer Science Each Unit is Equally Important
Question 3- What is the Cut-off of UGC NET Computer Science ?
Ans – the Following Cut-off of UGC NET UGC NET Computer Science
une 2020 Cut off (official).
Category | JRF & Assistant Professor | Assistant Professor Only | ||
Cutoff Marks Percentage | Total | Cutoff Marks Percentage | Total | |
UNRESERVED | 63.33 | 62 | 54.67 | 779 |
EWS | 58.67 | 13 | 49.33 | 146 |
OBC(NCL) | 57.33 | 51 | 48.67 | 641 |
SC | 54.00 | 18 | 46.67 | 249 |
ST | 52.67 | 6 | 45.33 | 67 |
Question 4 -What are the Best Books for UGC NET Computer Science Subject ?
Ans The Following the Best Books for UGC NET Computer Science
Here are Good Reference Books for UGC NET Computer Science
Question 5– Can I get a job after qualifying UGC NET Computer Science ?
Ans- Yes, you will get many career opportunities in the government and private sectors both after qualifying the UGC NET Computer Science exam. You can check the job options from here.
Question -6 How can I revise the UGC NET Computer Science Syllabus?
Ans.) To revise the UGC NET Computer Science Syllabus , first, you should highlight and make short notes while preparing for the exam. It will be easy for you to save time and revise all the topics quickly. You should start the revision from basic concepts
Question -7 Does Online Test Series Help to Crack UGC NET Computer Science Exam ?
Ans- Yes Its Help you a Lot, after clear all Concepts you must Practice MCQ through Online Test Series which Help you Understand your Level of Preparation & You can analyze your Strength & Weakness. Also Compare with other Students’ Score. Check Diwakar education Hub Best Test series Click here
Question – 8 What is the UGC NET Computer Science minimum Educational Qualification?
A student has to complete his or her Post-Graduation in Computer Science,or Any Relevant Subjects .
Question -9 What type of questions are asked in UGC NET Computer Science ?
UGC NET Computer Science Paper includes questions that are Direct/Conceptual(42), Comprehensive(10), Match the following(10), Statements/Definitions Based(2), Assertion and Reasoning Based(6), Chronological Order(6), Multiple Correct Options Based(24).
Question -10 Is the UGC NET Computer Science Syllabus difficult?
Yes. The level of the UGC NET Computer Science Syllabus is difficult.But with hard work & Right Guidance you can Qualified UGC NET Exam Take Free Mentorship Call us -7310762592,7078549303
Question -11 What is the UGC NET Computer Science paper pattern?
UGC NET Computer Science paper will be a total of 150 questions (50 in Paper I and 100 in Paper-II). The total number of marks is 300 (100 for Paper I and 200 for Paper II).
You can also join India’s No.1 Learning Platform for UGC NET, where you will get doubt solutions for all your exam-related queries with the help of experts from all over India. To join the community, you can download the Diwakar Education Hub now.
UGC NET Computer Science Books | UGC NET Computer Science Previous Year Paper |
UGC NET Computer Science Exam Pattern | UGC NET Computer Science Eligiblity Criteria |
Tag:NTA UGC NET Computer Science Books, UGC NET Computer Science & Application Exam, ugc net computer science 2024, ugc net computer science eligibility, ugc net computer science Notes, ugc net computer science pdf, ugc net computer science previous year papers, ugc net computer science sloved paper, ugc net computer science study material, UGC NET Computer Science Syllabus, ugc net computer science syllabus 2023, ugc net computer science syllabus paper 1