UGC-NET-Syllabus Paper-3 Computer Science and Applications

UNIVERSITY GRANTS COMMISSION (UGC)

National Eligibility Test (NET)

Syllabus Paper-3

SUBJECT: Computer Science and Applications

Note : This paper contains seventy five (75) objective type questions of two (2) marks each. All questions are compulsory.

Paper-3( A )

Core Group

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.

 

Paper-3( B )

( Elective / Optional )

Elective – I :

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.

ii.  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.

iii.  Linear Bounded Automata ( LBA ) :

  • Power of LBA Closure properties.

iv.  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.

v.  Chomsky Hierarchy of languages :

  • Recursive and recursively-enumerable languages.

 

Elective – II :

i.  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.

ii.  Variable Length Codes :

  • Prefix Codes, Huffmann Codes, Lempel-Ziev ( LZ ) Codes. Optirnality of these codes. Information content of these codes.

iii.  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.

iv.  Image Processing :

  • Image Registration, Spatial Fourier Transforms, Discrete Spatial ( 2 dimensional ) Fourier Transforms, Restoration, Lossy Compression of images ( pictures ).

v.  Data Compression Techniques :

  • Representation and compression of text, sound, picture, and video files ( based on the JPEG and MPEG standards ).

 

Elective – 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.

i.  Assignment and Transportation Problems :

  • Simple algorithms like Hungarian method, etc.

ii.  Shortest Path Problems :

  • Dijkstra’s and Moore’s method. Complexity.

iii.  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.

iv.  Matroids :

  • Definition. Graphic and Cographic matroids. Matroid intersection problem.

v.  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 – IV :

i.  Neural Networks :

  • Perceptron model, Linear separability and XOR problem. Two and three layered neural nets, Back Propagation – Convergence, Hopfield nets, Neural net learning, Applications.

ii.  Fuzzy Systems :

  • Definition of a Fuzzy set, Fuzzy relations, Fuzzy functions, Fuzzy measures, Fuzzy reasoning, Applications of Fuzzy systems.

 

Elective – V :

i.  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.

ii.  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.

 

————————–