UGC-NET Computer Science

Sehgal Classes © Rashmi Sharma [email protected]

UGC-NET (Computer Science & Applications) Syllabus Page | 1

UUGGCC--NNEETT--SSYYLLLLAABBUUSS

SSUUBBJJEECCTT:: CCOOMMPPUUTTEERR SSCCIIEENNCCEE AANNDD AAPPPPLLIICCAATTIIOONNSS

NNOOTTEE::

There will be two question papers, Paper-II and Paper-III (Part A & Part B) Paper–II will be cover 50

objective type question(Multiple type, matching type, true/false, Assertion Reasoning type) carrying

100 marks Paper-III will have two parts Part-A and Part-B; Paper-III will have 10 short essay type

question (300 words) carrying 16 marks ach. In it there will be one question with internal choice

from each unit (i.e. 10 question form 10 units Total marks will be 160) Paper-III B will be compulsory

and there will be one question from each of the elective. The candidate will attempt only two

question (One elective in 400 words) carrying 20+20=40 marks. Total marks of paper-III will be 200.

PPAAPPEERR--IIII

11.. DDIISSCCRREETTEE SSTTRRUUCCTTUURREE

Sets, relation, Functions, Pigeonhole Principle, Inclusion-Exclusion Principle, Equivalence and

Partial orderings, elementary counting techniques Probability, Measure(s) for Information and

total information.

CCoommppaattiibbiilliittyy: Model of computation-Finite Automata, Pushdown Automata, Non-determinism

and NFS, DPDA and PDAs and languages accepted by these structure, Grammars languages, non

compatibility and example of non computable problems.

GGrraapphh: Definitions, 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, center(s) of a tree, Hamiltonian and Eulerian graphs, Planar graphs

GGrroouupp: Finite fields and Error correcting/detecting codes.

22.. CCOOMMPPUUTTEERR AARRIITTHHMMEETTIICC

Proportional (Boolean) Logic, Predicate Logic, Well formed formula (WFF), Satisfiability and

Tautology.

LLooggiicc FFaammiilliieess: TTL, ECL and C-MOS gates. Boolean algebra and Minimization of Boolean

functions, Flip-Flo-types, race conditions and comparison. Design of combinational and

sequential circuits.

RReepprreesseennttaattiioonn ooff IInntteeggeerr: Octal, Hex, Decimal and Binary. 2’s complement and 1′s complement

arithmetic. Floating point representation.

33.. PPRROOGGRRAAMMMMIINNGG IINN CC AANNDD CC++++

PPrrooggrraammmmiinngg iinn CC: Elements of C-Tokens, Identifiers, Data types in C, Control structure in C,

Sequence selection and iteration, Structured data types in C-arrays, structure, union, string an

pointers.

OO--OO PPrrooggrraammmmiinngg ccoonncceeppttss: Classes, Object, installation, Inheritance, Polymorphism and

overloading.

CC++++ PPrrooggrraammmmiinngg: Element of C++ Tokens, identifiers, Variable and constants, Data types,

Operator, Control Statements. Function parameter passing. Class and object, Constructor and

destructor. Overloading Inheritance temples, Exception handling.



44.. RREELLAATTIIOONNAALL DDAATTAABBAASSEE DDEESSIIGGNN AANNDD SSQQLL

E-R Diagrams and their transformation to relational design, normalization – INF, 2NF, BCNF and

4NF. Limitations of 4NF and BCNF.

SSQQLL: Data Definition Language (DDL) Data manipulation language (DML), Data control language

(DCL) commands database objects like. Views indexes, sequences, synonyms, data dictionary.

55.. DDAATTAA AANNDD FFIILLEE SSTTRRUUCCTTUURREE

DDaattaa: Information, Definition of data structure, Arrays, stacks, queues, linked lists, trees, graphs,

priority queues, and heaps.

FFiillee SSttrruuccttuurree: Fields, records, and files sequential direct, index-sequential and relative files.

Hashing, inverted lists multi-lists. B trees and B+ trees

66.. CCOOMMPPUUTTEERR NNEETTWWOORRKK

NNeettwwoorrkk FFuunnddaammeennttss: Local area Network (LAN), Metropolitan Area Networks (MAN), Wide

area Networks (WAN), Wireless Networks, Inter Networks.

RReeffeerreennccee MMooddeell: The OSI model, TCP/IP model.

DDaattaa CCoommmmuunniiccaattiioonn: Channel capacity. Transmission media – twisted pair, coaxial cables, Fiber

optic cables, Wireless transmission – radio, microwave infrared and millimeter waves. Light

wave transmission, Thelephones-local loop, trunks, multiplexing, switching, narrowband ISDN,

broadband ISDN, ATM, High speed LANS, Cellular Radio. Communication satellite –

Geosynchronous and low-orbit.

IInntteerrnneettwwoorrkkiinngg: Switch/Hub, Bridge, Router, Gateways Concatenated virtual circuits, Tunneling,

Fragmentation, Firewalls.

RRoouuttiinngg: Virtual circuits and datagrams, Routing algorithms, Congestion control.

NNeettwwoorrkk SSeeccuurriittyy: Cryptography-Public key, Secret Key, domain Name System (DNS) –

Electronics Mail and Worldwide Web (WWW), the DNS Resource Records Name Services, E-Mail

Architecture and Servers.

77.. SSYYSSTTEEMM SSOOFFTTWWAARREE

Assemble language fundamental (8085 based assembly language programming). Assemblers – 2-

pass and single pass. Macros and Microprocessors.

Loading, linking, program recordable, linkage editing.

Text editors. Programming Environments, Debuggers and program generators.

Compilation and Interpretation. Bootstrap compilers. Phase 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.

Top down parsers – Left recursion and its removal. Recursive descend parser. Predictive parser,

Intermediate codes – Quadruples, Triples, Intermediate code generation, Code generation, Code

optimization.

88.. OOPPEERRAATTIINNGG SSYYSSTTEEMM ((WWIITTHH CCAASSEE SSTTUUDDYY OOFF UUNNIIXX))

Main function of operating system. Multiprogramming, multiprocessing and multitasking.

MMeemmoorryy MMaannaaggeemmeenntt: Virtual memory, Paging, fragmentation.



CCoonnccuurrrreenntt PPrroocceessssiinngg: mutual exclusion, critical regions, locks ad unlock.

SScchheedduulliinngg: CPU Scheduling. I/O Scheduling, Resource Scheduling, Deadlock and scheduling

algorithms. Banker’s Algorithm for deadlock handling.

UUNNIIXX

TThhee UUnniixx SSyysstteemm: File system, process management, bourne shell shell variables, command line

programming.

FFiilltteerrss aanndd CCoommmmaannddss: Pr. Head, tail, cut paste. sort, uniq, tr., join, etc. grep, egrep, fgrep, etc.

sed, awk, etc.

SSyysstteemm CCaallllss ((lliikkee)): create, open, close, read, write, iseek, link, unlink, stat, fstat, unmask,

chmod, exec, fork, wait, system.

99.. SSOOFFTTWWAARREE EENNGGIINNEEEERRIINNGG

SSyysstteemm ddeevveellooppmmeenntt ccyyccllee ((SSDDCCLL)): Steps, water fall model, Prototypes, Spiral model.

SSooffttwwaarree MMeettrriiccss: Software Project Management.

SSooffttwwaarree DDeessiiggnn: System Design, Detailed design, function oriented design, Object oriented

design, user interface design, Design level metrics.

CCooddiinngg aanndd tteessttiinngg: testing level metrics, Software quality and reliability, clean room approach,

Software reengineering.

1100.. CCUURRRREENNTT TTRREENNDDSS AANNDD TTEECCHHNNOOLLOOGGIIEESS

The topic of current interest in Computer Science and Computer application hall be recovered. The

expert shall use their judgment from time to time to include the topics of popular interest, which are

expected to be known for an application development software professional they include

PPAARRAALLLLEELL CCOOMMPPUUTTIINNGG

Parallel virtual machine (pvm), and message passing interface (mpi), libraries and calls, Advanced

architecture, Today’s fastest computers.

MMOOBBIILLEE CCOOMMPPUUTTIINNGG

Mobile Connectivity – Cells, Framework, wireless delivery technology and switching methods,

mobile information access devices , mobile data internetworking standards, cellular data

communication protocols, mobile computing application, Mobile database-Protocol, scope,

tools, and technology, M-Business.

EE--TTEECCHHNNOOLLOOGGYY

EElleeccttrroonniicc CCoommmmeerrccee: Framework, Media convergence of Application, Consumer

application, Organization application.

EElleeccttrroonniicc ppaayymmeenntt SSyysstteemm: Digital Token, Smart Cards, Credit Cards, Risks in Electronics

Payment system Designing electronic payment system.

EElleeccttrroonniicc DDaattaa IInntteerrcchhaannggee ((EEDDII)): concept, Application (legal security and privacy), Issues,

EDI and Electronic commerce Standardization and EDI, EDI Software implementation, EDI,

envelope for message Transport, Internet-based EDI.

DDiiggiittaall LLiibbrraarriieess aanndd DDaattaa wwaarreehhoouussiinngg: Concept, Types of Digital Documents, Issues behind

document infrastructure, Cooperate data warehouses.

SSooffttwwaarree AAggeennttss: Characteristics and Properties of Agents Technology behind software

agents (Applets, Browser and Software Agents).



BBrrooaadd bbaanndd TTeelleeccoommmmuunniiccaattiioonn: Concept, Frame relay, Cell relay, Switched Multimegabite

Data Services, Asynchronous, Transfer Mode.

MMaaiinn CCoonncceeppttss iinn ggeeooggrraapphhiiccaall IInnffoorrmmaattiioonn SSyysstteemm ((GGIISS)), E-Cash E-Business, ERP packages.

DDaattaa WWaarree hhoouussiinngg: Data Ware housing environments, Architecture of a data warehouses

methodology, Analysis design, Construction and administration.

DDaattaa MMiinniinngg: Extraction models and pattern form large database, data mining techniques,

classification regression, clustering summarization, dependency modeling, link analysis,

sequencing analysis, mining scientific and business data.

WWIINNDDOOWWSS PPRROOGGRRAAMMMMIINNGG

Introduction to Windows programming: Win32 Microsoft Foundation Classes (MFC), Documents

and views, Resources message handling in windows.

SSIIMMPPLLEE AAPPPPLLIICCAATTIIOONN ((IINN WWIINNDDOOWWSS))

Scrolling, splitting views, docking toolbars status bar, common dialogue.

AADDVVAANNCCEEDD WWIINNDDOOWWSS PPRROOGGRRAAMMMMIINNGG

Multiple document Interface (MDI), Multiplex threading, Object linking and Embedding (OLE),

Active X control Active template Library (ATL), Network programming.

PPAAPPEERR--IIIIII ((AA))

CCOORREE GGRROOUUPP

UUNNIITT--II

Combinational circuit design, Sequential Circuit design, Hardware ad Micro programmed

processor design, Instruction formats, Addressing models Memory types and organization,

Interfacing peripheral devices, Interrupts.

Microprocessor architecture, Instruction set and Programming (8085, P-III/P-IV), Microprocessor

applications.

UUNNIITT--IIII

Database concepts, ER diagrams, Data model, Design of Relational Database, Normalization, SQL

and QBE, Query Processing and Optimization, Centralized and Distributed Database, Security,

Concurrency an recovery in centralized and Distributed Database System, Object oriented

Database Management System (Concept, composite object, Integration with RDBMS

application), ORACLE.

UUNNIITT--IIIIII

Display system, input devise, 2D, geometry, Graphics operation, 3D Graphics, Animation Graphic

Standard, and Application concepts, Storage Devices, Input Tools, Authoring Tools, Application

files.

UUNNIITT--IIVV

Programming language, concepts, Paradigm and models.

Data, Data types, Operators, Expressions, Assignments, Flow of control-Control Structure, I/O

Statement, User Defined and Built in Function parameter passing.

Principles, Classes, Inheritance, Class hierarchies, Polymorphism, Dynamic binding, reference

semantics and their implementation.



Principles, functions, lists, types and polymorphism, higher order functions lazy evaluation

equations and pattern matching.

Principles, horn clauses and their execution, logical variables relations, data structure,

Controlling the search order, programme development in prolog implementation of prolog,

example programme in prolog.

Principle of parallelism co routines, Communication and execution, Parallel virtual Machine

(PVM) and message passing interface (MPI), routine and calls, Parallel programmes in PVM

paradigm a swell as MPI, paradigm for simple problems like matrix multiplication.

Preconditions, post conditions, axiomatic approaches for semantic, correction’s denotation

semantics

Complier structure, Compiler construction tools, coalition phases

Finite Automata, Pushdown Automata, Non-Determinations, and NFA, DPDA and PDAs and

language accepted by these structure, Grammars, language – Types of grammar – type 0, type 1,

tope 2, type 3, The relationship between types of grammars, and finite machine, Pushdown

automata and context free Framers, Lexical Analysis-regular express and regular languages. LEX

pacemaker on UNIX, Conversion of NFA to DFA minimizing the number of states in a DFA,

Compilation an 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 an

LR, YACC package on UNIX, system, Top down parsers-Left recursion and its removal, recursive

descent Parsers, Predictive parser Intermediate codes-Quadruples, triples, Intermediate code

generation, Code generation, Code optimization.

UUNNIITT--VV

Analogue and Digital Transmission, Asynchronous and Synchronous transitions Transmission

media, Multiplexing and Concentration Switch techniques, Polling.

Topologies, Networking devices, OSI, Reference Model Protocol for – (i) Data link layer, (ii)

Network layer and (iii) Transpire layer , TCP/IP Protocol Network security, Network

Administration.

UUNNIITT--VVII

Definition, simple and composite structure, 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 programmes

like finding of maximum of n-elements, recursion and its systematic removal. Quicksort – Non-

recursive implementation with minimal stake storage. Design of algorithm (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.

UUNNIITT--VVIIII

Object, message, classed, encapsulation, inheritance, polymorphism, aggregation, abstract,

lasses, generalization and extension and restriction m Object oriented design, Multiple,

inheritance metadata.

HTML, DHTML, XML, Scripting, JAVA, Servelets, Applets.



UUNNIITT--VVIIIIII

Software development models, Requirement analysis and specification, Software design

Programming techniques and tools, Software validation and quality assurance techniques,

Software maintenance and advanced concepts, Software management.

UUNNIITT--IIXX

Introduction, Memory management, Support for concurrent process Scheduling, System

deadlock, Multiprogramming system, I/O Management, Distributed operating systems, Study of

UNIX and Windows NT.

UUNNIITT--XX

Definition AI approach foe sloping problems.

AAuuttoommaatteedd RReeaassoonniinngg with propositional logic and predicate logic – fundamental proof

procedure, Refutation, resolution, refinement to resolution (ordering/Pruning/Restriction

strategies).

State solace representation of problems, Bounding functions, breadth first, depth first, A, A*,

AO* etc. Performance comparison of various techniques.

Frames, scripts, Semantic nets, production systems, Procedural representation, 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.

PPAAPPEERR--IIIIII ((BB))

[[EELLEECCTTIIVVEE//OOPPTTIIOONNAALL]]

EELLEECCTTIIVVEE--II

TThheeoorryy ooff ccoommppuuttaattiioonn: Formal language, need for formal computational model, Non-

Computational model on computational problems, Diagonal argument and Russell’s paradox.

Deterministic Finite Automata (DFA), Non-deterministic finite Automaton (NFA), Regular

languages and regular sets, Equivalence of DFA and NFA. Minimizing the numbers of state of a

DFA, Non-regular languages, and pumping lemma.

Pushdown Automation (PDA), Deterministic Pushdown Automation (DPDA), Non-equivalence of

PDA and DPDA.

CCoonntteexxtt ffrreeee GGrraammmmaarrss: Greiback 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’ – Early’s Cook-Kassami-Younger (CKY) and Tomita’s

parsing.

LLiinneeaarr BBoouunnddeedd AAuuttoommaattaa ((LLBBAA)): Power of LBA, Closure Properties.

TTuurriinngg MMaacchhiinnee ((TTMM)): One tape, Multitape, the notions of time and space complexity in terms of

TM, Construction of TM for simple problems, Computational Complexity.



CChhoommsskkyy HHiieerraarrcchhyy ooff LLaanngguuaaggeess: Recursive and Recursively enumerable language.

EELLEECCTTIIVVEE--IIII

MMooddeell ffoorr iinnffoorrmmaattiioonn CChhaannnneell: Discrete Memory less 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 optimally of information transform

mission

VVaarriiaabbllee LLeennggtthh ccooddeess: Prefix Codes, Huffman Codes, Lempel-Ziew (LZ) Codes, Optimally of

these codes, Information content of these codes.

EErrrroorr CCoorrrreeccttiinngg aanndd ddeetteeccttiinngg CCooddeess: Finite fields, Hamming Distance, Bounds of Codes, Linear

(Party check) Codes, Parity check matrix, generator Matrix, Decoding of linear codes, Hamming

Codes.

IImmaaggee PPrroocceessssiinngg: Image Processing, Spatial Fourier Transforms, Discrete Spatial (2-

Dimensional) Fourier Transforms, Restoration, Lossy compression of images (pictures).

DDaattaa CCoommpprreessssiioonn TTeecchhnniiqquueess: Representation and Compression of text, sound, picture, and

video files (based of MPEG and JPEG standards).

EELLEECCTTIIVVEE--IIIIII

LLiinneeaarr pprrooggrraammmmiinngg PPrroobblleemm ((LLPPPP)) in the standard form, LPP in canonical form, conversion of

LPP in Standard form to LPP in Canonical form. Conversion of LPP in Standard form to LPP in

Canonical form. Simplex-Prevention of cyclic computation in simplex and Tableau,. Big-M

method, Dual Simplex and reviewed simplex.

Complexity of simple Algorithm(s). Exponential behaviors of simplex.

EElllliippssooiidd mmeetthhoodd and Karmakar’s Method for solving LPPs. Solving simple LLPs through these

methods, Comparison of complexity of these methods.

AAssssiiggnnmmeenntt aanndd TTrraannssppoorrttaattiioonn PPrroobblleemmss: Simple algorithm like Hungarian method, etc.

SShhoorrtteesstt PPaatthh PPrroobblleemmss: Dijkstra’a and Moore’s method. Complexity.

NNeettwwoorrkk FFllooww pprroobblleemm: Formulation, Max-Flow Min-Cut Theorem. Ford and Fulkerson’s

algorithm. Exponential behavior of Ford and Fulkerson’s alorithim, Malhotra-Promodkumar-

Maheswari (MPM), Polynomial algorithm for solving network flow problem, Bipartite Graphs and

Matching, Solving matching using network flow problems.

MMaattrriiooddss: Definition, Graphic and co-graphic matriods. Matriods intersection problem.

NNoonn--LLiinneeaarr pprrooggrraammmmiinngg: Kuhn-Tucker conditions, Convex function and Convex region, Convex

programming problems, Algorithms for solving convex programming problems – Rate of

convergence of iterative method for solving theses problems.

EELLEECCTTIIVVEE--IIVV

NNeeuurraall nneettwwoorrkk: Perception Model, Linear Severability and XOR problem, Two and three layered

neural nets, Backprpaogation – Convergence, Hopfield nets, Neural net Learning, Application.

FFuuzzzzyy SSyysstteemm: Definition of a Fuzzy set, Fuzzy relations, Fuzzy functions, Fuzzy measures, Fuzzy

reasoning, Application of Fuzzy systems.

EELLEECCTTIIVVEE--VV

UUNNIIXX: Operating system, Structure of UNIX, Operating system, UNIX Commands, Interfacing with

UNIX, Editors and Compliers for UNIX, LEX and YACC, File System, System calls, Filters, Shell

programming.



WWiinnddoowwss: Windows environment, Unicode, Documents and Views, Drawing in window, Message

handing, Scrolling and Splitting views, Docking toolbar and status bar, Common dialogue and

control, MDI, Multithreading, OLE, Active X Control, ATL, Database, access, Network

programming.

***********