UGC NET Computer Science and Applications: Syllabus, Exam Pattern & Sample Questions

Browse Syllabus by Exams

Are you searching for the syllabus of UGC NET Computer Science and Applications? Here you will get the latest syllabus for the National Eligibility Test (UGC-NET) exam. It will surely help you in the effective preparation of NET Computer Science and Applications exam (Paper II, Paper III-A & Paper III-B). CBSE NET Computer Science and Applications exam will be conducted by the Central Board of Secondary Education (CBSE). The syllabus given below is based on the latest pattern of the University Grants Commission (UGC) - Computer Science and Applications curriculum. We suggest you to check our free online mock tests for UGC NET examinations.

We have listed some of the frequently asked questions (FAQs), asked by the UGC NET (Computer Science and Applications) candidates, so that they will get a basic idea of NET (Computer Science and Applications) exam pattern.

Recommended UGC NET Computer Science and Applications: Free mock test

UGC NET Computer Science and Applications Syllabus: Paper III (Part-A)

UGC NET Computer Science and Applications Syllabus: Paper II (Core Group)
Unit Details
Unit - IDiscrete Structures
Unit - IIComputer Arithmetic
Unit - IIIProgramming in C and C++
Unit - IVRelational Database Design and SQL
Unit - VData and File structures
Unit - VIComputer Networks
Unit - VIISystem Software and Compilers
Unit - VIIIOperating Systems (with Case Study of Unix)
Unit - IXSoftware Engineering
Unit - XCurrent Trends and Technologies

UGC NET Computer Science and Applications Syllabus: Paper III (Part-A)

  1. Unit - I
  2. Unit - II
  3. Unit - III
  4. Unit - IV
  5. Unit - V
  6. Unit - VI
  7. Unit - VII
  8. Unit - VIII
  9. Unit - IX
  10. Unit - X

UGC NET Computer Science and Applications Syllabus: (Paper III - Part B)

  1. Elective Paper - I
  2. Elective Paper - II
  3. Elective Paper - III
  4. Elective Paper - IV
  5. Elective Paper - V

UGC NET Computer Science and Applications (Paper II): Detailed Syllabus

Given below is the list of unit wise syllabus for UGC NET (Computer Science and Applications) paper-II.

1. Discrete Structures

  • Sets, Relations, Functions. Pigeonhole Principle, Inclusion-Exclusion Principle, Equivalence and Partial Orderings, Elementary Counting Techniques, Probability. Measures(S) for information and Mutual information.
  • Computability : Models of computation-Finite Automata, Pushdown Automata, Non - determinism and NFA, DPDA and PDAs and Languages accepted by these structures. Grammars, Languages, Non - computability and Examples of non - computable problems.
  • Graph : Definition, walks, paths, trails, connected graphs, regular and bipartite graphs, cycles and circuits. Tree and rooted tree. Spanning trees. Eccentricity of a vertex radius and diameter of a graph. Central Graphs. Centres of a tree. Hamiltonian and Eulerian graphs, Planar graphs.
  • Groups : Finite fields and Error correcting / detecting codes.

2. Computer Arithmetic

  • Propositional (Boolean) Logic, Predicate Logic, Well - formed - formulae (WFF), Satisfiability and Tautology.
  • Logic Families : TTL, ECL and C - MOS gates. Boolean algebra and Minimization of Boolean functions. Flip-flops - types, race condition and comparison. Design of combinational and sequential circuits.
  • Representation of Integers : Octal, Hex, Decimal, and Binary. 2′s complement and 1′s complement arithmetic. Floating point representation.

3. Programming in C and C++

  • Programming in C : Elements of C - Tokens, identifiers, data types in C. Control structures in C. Sequence, selection and iteration(s). Structured data types in C-arrays, struct, union, string, and pointers.
  • O - O Programming Concepts : Class, object, instantiation. Inheritance, polymorphism and overloading.
  • C++ Programming : Elements of C++ - Tokens, identifiers. Variables and constants, Datatypes, Operators, Control statements. Functions parameter passing. Class and objects. Constructors and destructors. Overloading, Inheritance, Templates, Exception handling.

4. Relational Database Design and SQL

  • E-R diagrams and their transformation to relational design, normalization - INF, 2NF, 3NF, BCNF and 4NF. Limitations of 4NF and BCNF.
  • SQL : Data Definition Language (DDL), Data Manipulation Language (DML), Data Control Language (DCL) commands. Database objects like-Views, indexes, sequences, synonyms, data dictionary.

5. Data and File structures

  • Data, Information, Definition of data structure. Arrays, stacks, queues, linked lists, trees, graphs, priority queues and heaps.
  • File Structures : Fields, records and files. Sequential, direct, index-sequential and relative files. Hashing, inverted lists and multi - lists. B trees and B+ trees.

6. Computer Networks

  • Network fundamentals : Local Area Networks (LAN), Metropolitan Area Networks (MAN), Wide Area Networks (WAN), Wireless Networks, Inter Networks.
  • Reference Models : The OSI model, TCP / IP model.
  • Data Communication : Channel capacity. Transmission media-twisted pair, coaxial cables, fibre - optic cables, wireless transmission-radio, microwave, infrared and millimeter waves. Lightwave transmission. Thelephones - local loop, trunks, multiplexing, switching, narrowband ISDN, broadband ISDN, ATM, High speed LANS. Cellular Radio. Communication satellites-geosynchronous and low-orbit.
  • Internetworking : Switch / Hub, Bridge, Router, Gateways, Concatenated virtual circuits, Tunnelling, Fragmentation, Firewalls.
  • Routing : Virtual circuits and datagrams. Routing algorithms. Conjestion control.
  • Network Security : Cryptography-public key, secret key. Domain Name System (DNS) - Electronic Mail and Worldwide Web (WWW). The DNS, Resource Records, Name servers. E-mail-architecture and Serves.

7. System Software and Compilers

  • Assembly language fundamentals (8085 based assembly language programming). Assemblers-2-pass and single-pass. Macros and macroprocessors.
  • Loading, linking, relocation, program relocatability. Linkage editing.
  • Text editors. Programming Environments. Debuggers and program generators.
  • Compilation and Interpretation. Bootstrap compilers. Phases of compilation process. Lexical analysis. Lex package on Unix system.
  • Context free grammars. Parsing and parse trees. Representation of parse (derivation) trees as rightmost and leftmost derivations. Bottom up parsers-shift-reduce, operator precedence, and LR. YACC package on Unix system.
  • Topdown parsers-left recursion and its removal. Recursive descent parser. Predictive parser. Intermediate codes-Quadruples, Triples, Intermediate code generation, Code generation, Code optimization.

8. Operating Systems (with Case Study of Unix)

  • Main functions of operating systems. Multiprogramming, multiprocessing, and multitasking.
  • Memory Management : Virtual memory, paging, fragmentation.
  • Concurrent Processing : Mutual exclusion. Critical regions, lock and unlock.
  • Scheduling : CPU scheduling, I / O scheduling, Resource scheduling. Deadlock and scheduling algorithms. Banker's algorithm for deadlock handling.

UNIX

  • The Unix System : File system, process management, bourne shell, shell variables, command line programming.
  • Filters and Commands : Pr, head, tail, cut, paste, sort, uniq, tr, join, etc., grep, egrep, fgrep, etc., sed, awk, etc.
  • System Calls (like) : Creat, open, close, read, write, iseek, link, unlink, stat, fstat, umask, chmod, exec, fork, wait, system.

9. Software Engineering

  • System Development Life Cycle (SDLC) : Steps, Water fall model, Prototypes, Spiral model.
  • Software Metrics : Software Project Management.
  • Software Design : System design, detailed design, function oriented design, object oriented design, user interface design. Design level metrics.
  • Coding and Testing : Testing level metrics. Software quality and reliability. Clean room approach, software re engineering.
  • The topics of current interest in Computer Science and Computer Applications shall be covered. The experts shall use their judgement from time to time to include the topics of popular interest, which are expected to be known for an application development software professional, currently, they include :
  • Parallel Computing : Parallel virtual machine (pvm) and message passing interface (MPI) libraries and calls. Advanced architectures. Today's fastest computers.
  • Mobile Computing : Mobile connectivity - Cells, Framework, wireless delivery technology and switching methods, mobile information access devices, mobile data internetworking standards, cellular data communication protocols, mobile computing applications. Mobile databases - protocols, scope, tools and technology. M-business.

E - Technologies

  • Electronic Commerce : Framework, Media Convergence of Applications, Consumer Applications, Organisation Applications.
  • Electronic Payment Systems : Digital Token, Smart Cards, Credit Cards, Risks in Electronic Payment System, Designing Electronic Payment Systems.
  • Electronic Data Interchange (EDI) : Concepts, Applications, (Legal, Security and Privacy) issues, EDI and Electronic Commerce, Standardization and EDI, EDI Software Implementation, EDI Envelope for Message Transport, Internet - Based EDI.
  • Digital Libraries and Data Warehousing : Concepts, Types of Digital documents, Issues behind document Infrastructure, Corporate Data Warehouses.
  • Software Agents : Characteristics and Properties of Agents, Technology behind Software Agents (Applets, Browsers and Software Agents).
  • Broadband Telecommunications : Concepts, Frame Relay, Cell Relay, Switched Multimegabit Data Service, Asynchronous Transfer Mode.
    Main concepts in Geographical Information System (GIS), E - cash, E - Business, ERP packages.
  • Data Warehousing : Data Warehouse environment, architecture of a data warehouse methodology, analysis, design, construction and administration.
  • Data Mining : Extracting models and patterns from large databases, data mining techniques, classification, regression, clustering, summarization, dependency modelling, link analysis, sequencing analysis, mining scientific and business data.
  • Windows Programming : Introduction to Windows programming - Win32, Microsoft Foundation Classes (MFC), Documents and views, Resources, Message handling in windows.
  • Simple Applications (in windows) : Scrolling, splitting views, docking toolbars, status bars, common dialogs.
  • Advanced Windows Programming : Multiple Document Interface (MDI), Multithreading. Object linking and Embedding (OLE). Active X controls. Active Template Library (ATL). Network programming.

UGC NET Computer Science and Applications (Paper III-A): Detailed Syllabus

Given below is the list of unit wise syllabus for UGC NET (Computer Science and Applications) Paper-III (A).

Unit - I

  • Combinational Circuit Design, Sequential Circuit Design, Hardwired and Micro Programmed processor design, Instruction formats, Addressing modes, Memory types and organisation, Interfacing peripheral devices, Interrupts.
  • Microprocessor architecture, Instruction set and Programming (8085, P - III / P - IV), Microprocessor applications.

Unit - II

Database Concepts, ER diagrams, Data Models, Design of Relational Database, Normalisation, SQL and QBE, Query Processing and Optimisation, Centralised and Distributed Database, Security, Concurrency and Recovery in Centralised and Distributed Database Systems, Object Oriented Database Management Systems (Concepts, Composite objects, Integration with RDBMS applications), ORACLE.

Unit - III

  • Display systems, Input devices, 2D Geometry, Graphic operations, 3D Graphics, Animation, Graphic standard, Applications.
  • Concepts, Storage Devices, Input Tools, Authoring Tools, Application, Files.

Unit - IV

  • Programming language concepts, paradigms and models.
  • Data : Data types, Operators, Expressions, Assignment. Flow of Control.
  • Control structures, I / O statements, User - defined and built - in functions, Parameter passing.
  • Principles, classes, inheritance, class hierarchies, polymorphism, dynamic binding, reference semantics and their implementation.
  • Principles, functions, lists, types and polymorphisms, higher order functions, lazy evaluation, equations and pattern matching.
  • Principles, horn clauses and their execution, logical variables, relations, data structures, controlling the search order, program development in prolog, implementation of prolog, example programs in prolog.
  • Principles of parallelism, coroutines, communication and execution. Parallel Virtual Machine (PVM) and Message Passing Interface (MPI) routines and calls. Parallel programs in PVM paradigm as well as MPI paradigm for simple problems like matrix multiplication.
  • Preconditions, post-conditions, axiomatic approach for semantics, correctness, denotational semantics.
  • Compiler structure, compiler construction tools, compilation phases.
  • Finite Automata, Pushdown Automata. Non-determinism and NFA, DPDA, and PDAs and languages accepted by these structures. Grammars, Languages - types of grammars - type 0, type 1, type 2, and type 3. The relationship between types of grammars, and finite machines. Pushdown automata and Context Free Grammars. Lexical Analysis-regular expressions and regular languages. LEX package on Unix. Conversion of NFA to DFA. Minimizing the number of states in a DFA Compilation and Interpretation. Bootstrap compilers.
  • Context free grammars. Parsing and parse trees. Representation of parse (derivation) trees as rightmost and leftmost derivations. Bottom up parsers-shift-reduce, operator precedence, and LR. YACC package on Unix system. Top down parsers-left recursion and its removal. Recursive descent parser. Predictive parser, Intermediate codes - Quadruples, triples. Intermediate code generation, code generation. Code optimization.

Unit - V

  • Analog and Digital transmission, Asynchronous and Synchronous transmission, Transmission media, Multiplexing and Concentration, Switching techniques, Polling.
  • Topologies, Networking Devices, OSI Reference Model, Protocols for :
    1. Data link layer
    2. Network layer
    3. Transport layer, TCP / IP protocols, Networks security, Network administration.

Unit - VI

  • Definition, Simple and Composite structures, Arrays, Lists, Stacks queues, Priority queues. Binary trees, B - trees, Graphs.
  • Sorting and Searching Algorithms, Analysis of Algorithms, Interpolation and Binary Search, Asymptotic notations-big ohm, omega and theta. Average case analysis of simple programs like finding of a maximum of n elements. Recursion and its systematic removal. Quicksort - Non - recursive implementation with minimal stack storage. Design of Algorithms (Divide and Conquer, Greedy method, Dynamic programming, Back tracking, Branch and Bound). Lower bound theory, Non - deterministic algorithm - Non - deterministic programming constructs. Simple non-deterministic programs. NP - hard and NP - complete problems.

Unit - VII

  • Object, messages, classes, encapsulation, inheritance, polymorphism, aggregation, abstract classes, generalization as extension and restriction. Object oriented design. Multiple inheritance, metadata.
  • HTML, DHTML, XML, Scripting, Java, Servelets, Applets.

Unit - VIII

Software development models, Requirement analysis and specifications, Software design, Programming techniques and tools, Software validation and quality assurance techniques, Software maintenance and advanced concepts, Software management.

Unit - IX

Introduction, Memory management, Support for concurrent process, Scheduling, System deadlock, Multiprogramming system, I/O management, Distributed operating systems, Study of Unix and Windows NT.

Unit - X

  • Definitions, AI approach for solving problems.
  • Automated Reasoning with prepositional logic and predicate logic-fundamental proof procedure, refutation, resolution, refinements to resolution (ordering / pruning / restriction strategies).
  • State space representation of problems, bounding functions, breadth first, depth first, A, A*, AO*, etc. Performance comparison of various search techniques.
  • Frames, scripts, semantic nets, production systems, procedural representations. Prolog programming.
  • Components of an expert system, Knowledge representation and Acquisition techniques, Building expert system and Shell.
  • RTNs, ATNs, Parsing of Ambiguous CFGs. Tree Adjoining Grammars (TAGs).
  • Systems approach to planning, Designing, Development, Implementation and Evaluation of MIS.
  • Decision-making processes, evaluation of DSS, Group decision support system and case studies, Adaptive design approach to DSS development, Cognitive style in DSS, Integrating expert and Decision support systems.

UGC NET Computer Science and Applications (Paper III-B): Detailed Syllabus

Given below is the list of elective paper wise syllabus for paper III (Part B).

Elective Paper - I

  • Theory of Computation : Formal language, Need for formal computational models, Non-computational problems, diagonal argument and Russel's paradox.
  • Deterministic Finite Automaton (DFA), Non - deterministic Finite Automaton (NFA), Regular languages and regular sets, Equivalence of DFA and NFA. Minimizing the number of states of a DFA. Non-regular languages, and Pumping lemma.
  • Pushdown Automaton (PDA), Deterministic Pushdown Automaton (DPDA), Non - equilvalence of PDA and DPDA.
  • Context free Grammars : Greibach Normal Form (GNF) and Chomsky Normal Form (CNF), Ambiguity, Parse Tree Representation of Derivations. Equivalence of PDA's and CFG's. Parsing techniques for parsing of general CFG's - Early's, Cook - Kassami-Younger (CKY), and Tomita's parsing.
  • Linear Bounded Automata (LBA) : Power of LBA Closure properties.
  • Turing Machine (TM) : One tape, multitape. The notions of time and space complexity in terms of TM. Construction of TM for simple problems. Computational complexity.
  • Chomsky Hierarchy of languages : Recursive and recursively-enumerable languages.

Elective Paper - II

  • Models for Information Channel : Discrete Memoryless Channel, Binary Symmetric Channel (BSC), Burst Channel, Bit-error rates. Probability, Entropy and Shannon's measure of information. Mutual information. Channel capacity theorem. Rate and optimality of Information transmission.
  • Variable Length Codes : Prefix Codes, Huffmann Codes, Lempel-Ziev (LZ) Codes. Optirnality of these codes. Information content of these codes.
  • Error Correcting and Detecting Codes : Finite fields, Hamming distance, Bounds of codes, Linear (Parity Check) codes, Parity check matrix, Generator matrix, Decoding of linear codes, Hamming codes.
  • Image Processing : Image Registration, Spatial Fourier Transforms, Discrete Spatial (2 dimensional) Fourier Transforms, Restoration, Lossy Compression of images (pictures).
  • Data Compression Techniques : Representation and compression of text, sound, picture, and video files (based on the JPEG and MPEG standards).

Elective Paper - III

  • Linear Programming Problem (LPP) in the standard form, LPP in Canonical form. Conversion of LPP in Standard form to LPP in Canonical form. Simplex-Prevention of cyclic computations in Simplex and Tableau, Big-M method, dual simplex and revised simplex.
  • Complexity of simplex algorithm(s). Exponential behaviour of simplex.
  • Ellipsoid method and Karmakar's method for solving LPPs. Solving simple LPPs through these methods. Comparison of complexity of these methods.
  • Assignment and Transportation Problems : Simple algorithms like Hungarian method, etc.
  • Shortest Path Problems : Dijkstra's and Moore's method. Complexity.
  • Network Flow Problem : Formulation. Max - Flow Min - Cut theorem. Ford and Fulkerson's algorithm. Exponential behaviour of Ford and Fulkerson's algorithm. Malhotra - Pramodkumar-Maheshwari (MPM) Polynomial algorithm for solving Network flow problem. Bipartite Graphs and Matchings; Solving matching problems using Network flow problems.
  • Matroids : Definition. Graphic and Cographic matroids. Matroid intersection problem.
  • Non-linear Programming : Kuhn - Tucker conditions. Convex functions and Convex regions. Convex programming problems. Algorithms for solving convex programming problems-Rate of convergence of iterative methods for solving these problems.

Elective Paper - IV

  • Neural Networks : Perceptron model, Linear separability and XOR problem. Two and three layered neural nets, Back Propagation - Convergence, Hopfield nets, Neural net learning, Applications.
  • Fuzzy Systems : Definition of a Fuzzy set, Fuzzy relations, Fuzzy functions, Fuzzy measures, Fuzzy reasoning, Applications of Fuzzy systems.

Elective Paper - V

  • Unix : Operating System, Structure of Unix Operating System, Unix Commands, Interfacing with Unix, Editors and Compilers for Unix, LEX and YACC, File system, System calls, Filters, Shell programming.
  • Windows : Windows environment, Unicode, Documents and Views, Drawing in a window, Message handling, Scrolling and Splitting views, Docking toolbars and Status bars, Common dialogs and Controls, MDI, Multithreading, OLE, Active X controls, ATL, Database access, Network programming.

UGC NET Computer Science and Applications: Exam Pattern (FAQs)

Is it mandatory to qualify UGC General Paper-1?
Yes, it is necessary for all UGC (Computer Science and Applications) candidates to pass UGC General Paper-1: Teaching & Research Aptitude (TRA) exam
How many question papers are there in the UGC NET (Computer Science and Applications) exam?
Two: Paper II and Paper III
How many questions will be their in NET Computer Science and Applications (Paper II)?
Their will be a total of 50 questions in UGC Computer Science and Applications Paper II
What type of questions are asked in UGC Computer Science and Applications exam?
Paper-II contains questions of objective nature: MCQs; Matching type; Assertion-Reasoning; True / False. Paper-III (Part A): Essay type questions. Paper III (Part B): Essay type questions from each of the electives

UGC NET Computer Science and Applications - Paper II: Sample Questions

(1) Which among the following is not a structured data type in C?

  1. Union
  2. Pointer
  3. String
  4. Boolean

(2) A B-tree of order m is an m-way search tree with?

  1. All leaves of the tree on the same level
  2. Each node, except for root and leaves, having less than m/2 subtrees
  3. The root of the tree having more than M subtrees
  4. All its leaves connected to form a linked list

(3) A browser is a software tool that helps

  1. Linking of application program modulus
  2. Viewing of application information
  3. Developing application programs
  4. Debugging of application software

UGC NET Computer Science and Applications - Paper III (Part A): Sample Questions

  1. Distinguish between hardwired and microprogrammed processor design and compare their cost-performance qualities.
  2. Draw an interface diagram, indicating handshake signals, for a Programmable peripheral interface device connected to the system bus.

UGC NET Computer Science and Applications - Paper III (Part B): Sample Questions

  1. Explain with suitable examples the Huffman coding scheme for producing variable length code. Describe the basis of search coding scheme.
  2. State and interpret the Shannon's theorem of channel capacity in a noisy channel. Discuss the effect of noise on information transmission rate.

Note You can easily download UGC NET (Computer Science and Applications) syllabus in PDF format form the official website of the University Grants Commission (UGC) by simply clicking on the subject (Computer Science and Applications) link on the UGC syllabus page.