UGC NET Paper 2 · Subject code 87

Computer Science & Applications Syllabus

View official syllabus PDF

10 units

Complete unit breakdown

1

Discrete Structures and Optimization

  • Mathematical logic, predicates, quantifiers and inference
  • Sets, relations, equivalence and partial ordering
  • Counting, induction, discrete probability and Bayes’ theorem
  • Groups, rings, fields, homomorphism and related algebraic structures
  • Graphs, trees, paths, colouring, spanning trees and cut-sets
  • Boolean algebra and function simplification
  • Linear and integer programming, simplex methods, transportation, assignment, PERT and CPM
2

Computer System Architecture

  • Digital logic, gates, circuits, flip-flops, registers and memory
  • Number systems, fixed- and floating-point representation, codes and arithmetic
  • Computer organization, registers, instructions, timing, I/O and interrupts
  • Register transfer and arithmetic, logic and shift microoperations
  • CPU organization, stacks, addressing modes, RISC and CISC
  • Microprogrammed control, pipelining, vector and array processing
  • Peripheral interfaces, DMA, priority interrupts and serial communication
  • Memory hierarchy, cache, associative and virtual memory
  • Multiprocessors, interconnection, communication, synchronization and cache coherence
3

Programming Languages and Computer Graphics

  • Programming paradigms, syntax, semantics, types, scope, binding and subprograms
  • C programming, pointers, structures, files and dynamic memory
  • Object-oriented concepts and C++ programming
  • HTML, XML, scripting and web application fundamentals
  • Graphics hardware, drawing algorithms, 2D and 3D transformations, viewing and clipping
  • Projection, curves, surfaces, visible-surface detection, illumination and shading
4

Database Management Systems

  • Database architecture, models, schemas, independence, languages and users
  • ER and relational modelling, constraints, algebra and calculus
  • SQL, joins, nested queries, views, constraints and triggers
  • Functional dependencies, normalization, BCNF, 4NF, 5NF and decomposition
  • Transactions, ACID, schedules, serializability, concurrency, deadlocks and recovery
  • File organization, indexes, B/B+ trees, hashing and query optimization
  • Object, distributed, warehouse, mining, big-data and NoSQL databases
5

System Software and Operating Systems

  • Assemblers, loaders, linkers, macros, compilers, interpreters and debuggers
  • OS functions, services, system calls and operating-system types
  • Processes, threads, scheduling and interprocess communication
  • Synchronization, critical sections, semaphores, mutexes and monitors
  • Deadlock prevention, avoidance, detection and recovery
  • Paging, segmentation, virtual memory, replacement algorithms and thrashing
  • File, directory, storage and disk management
  • Protection, access control, authentication, security and virtualization
6

Software Engineering

  • SDLC, waterfall, prototyping, incremental, spiral, RAD and Agile models
  • Requirements elicitation, analysis, SRS and validation
  • Design principles, cohesion, coupling, architecture, UML and patterns
  • Verification, validation, testing strategies and debugging
  • Quality assurance, reliability, standards and metrics
  • Planning, estimation, COCOMO, function points, scheduling, risk and configuration management
  • Maintenance, reengineering and reverse engineering
7

Data Structures and Algorithms

  • Arrays, lists, stacks, queues, trees, heaps, hash tables and graphs
  • Time and space complexity, asymptotic notation, recurrences and master theorem
  • Linear and binary search; elementary, merge, quick, heap and radix sorting
  • Divide and conquer, greedy methods, dynamic programming, backtracking and branch and bound
  • BFS, DFS, spanning trees, shortest paths and topological sorting
  • String matching, P, NP, NP-completeness, approximation and randomized algorithms
8

Theory of Computation and Compilers

  • Alphabets, strings, formal languages, grammars and Chomsky hierarchy
  • Regular expressions, DFA, NFA, minimization and pumping lemma
  • Context-free languages, pushdown automata and Turing machines
  • Decidability and undecidability
  • Compiler phases, lexical and syntax analysis, LL and LR parsing
  • Syntax-directed translation, intermediate code, runtime environments, optimization, code generation and error recovery
9

Data Communication and Computer Networks

  • Signals, transmission, media, multiplexing and switching
  • OSI and TCP/IP models, topologies and devices
  • Framing, error control, flow control, HDLC, access protocols and Ethernet
  • IPv4/IPv6, subnetting, routing, congestion control and ICMP
  • TCP, UDP and connection management
  • DNS, HTTP/HTTPS, FTP, email protocols, DHCP and network management
  • Cryptography, authentication, signatures, firewalls and security protocols
  • Wireless LAN, mobile communication, Mobile IP and ad hoc networks
10

Artificial Intelligence

  • AI fundamentals, intelligent agents, problem solving and state spaces
  • Uninformed and informed search, A*, game playing, minimax and alpha-beta pruning
  • Knowledge representation, logic, semantic networks, frames, rules and uncertainty
  • Planning systems, goal-stack planning and STRIPS
  • Natural-language understanding, syntax, semantics and machine translation
  • Supervised, unsupervised and reinforcement learning; classification, regression, trees and neural networks
  • Expert systems, fuzzy logic, genetic algorithms and evolutionary computation