UGC NET Computer Science and Applications Syllabus 2018 | LATEST

UGC NET Computer Science and Applications Syllabus 2018

UGC NET Computer Science and Applications Syllabus 2018

UNIVERSITY GRANTS COMMISSION
NET BUREAU
Code No. : 87
Subject: COMPUTER SCIENCE AND APPLICATIONS


SYLLABUS
Note:
There will be two question papers, Paper-II
and Paper-Ill (Part-A & B). Paper-II will cover 50 Objective Type Questions (Multiple choice, Matching type, True/False, Assertion-Reasoning type) carrying 100 marks. Paper’-Ill will have two Parts-A and B: Paper-iii (A) will have 10 short essay type questions (300 words) carryIng 16 marks each. In it there will be one question with Internal choice from each unit (i.e. 10 questions from 10 units: Total marks will be 160). Paper-III (B) will be compulsory and there will be one question from each of the Electives. The candidate will attempt only one question (one elective only In 800 words) carrying 40 marks. Total marks of Paper-III will be 200.

You can download UGC NET Computer Science and Applications Syllabus from the link below.

UGC NET Syllabus Computer Science and Applications PDF –

UGC NET Computer Science and Applications Syllabus pdf

Best book for UGC NET Computer Science and Applications

 

UGC NET Computer Science and Applications Syllabus 2018

UGC NET Computer Science and Applications Syllabus 2018

PAPER-II

1. Discrete Structures

Sets, Relations, Functions. Pigeonhole Principle, Inclusion-Exclusion Principle, Equivalence and Partial Orderings, Elementary Counting Techniques, Probability. Measure(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. Centre(s) of a tree. Hamiltonlan and Eulerlan 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 computational and sequential circuits.
Representation of Integers: Octal, Hex. Decimal, and Binary. 2’s complement and l’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,
0-0 Programming Concepts : Class, object, instantiation. Inheritance, polymorphism and overloading.
C++ Programming : Elements of C++ —Tokens, identifiers. Variables and constants, Data types, 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, normalizatlon—1NF, 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 adio. Communication satellites—geosynchronous and low-orbit.
Intemetworking: 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 relocatabifity. 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.

 

UMX
The Unix System: File system, process management. bourne shell, shell variables, command line programming.
Filters and Commands: Pr, head, tail, cut, paste, sort, unlq. 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 Mefrics: 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 reengineering.
10. Current Trends
and Technologies
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 Contputing
Mobile connectivity—CeUs, 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 Interchwige (EDI) : Concepts, Applications, (Legal,
Security and Privacy) Issues, EDT
and Electronic Commerce,
Standardization and EDT, EDI Software Implementation, EDT
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 Multlmegablt Data Service. Asynchronous Transfer Mode.
Main concepts In Geographical Information System (GIS), E-cash,
E-Buslness, 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 programmlng—W1n32, 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 (Am). Network programming.

 

Best book for UGC NET Computer Science and Applications

UGC NET Computer Science and Applications Syllabus 2018

PAPER-III(A)
CORE GROUP


Unit—I
Combinational Circuit Design. Sequential Circuit Design. Hardwlred
and
Microprogrammed processor design. Instruction formats, Addressing modes.
Memory types
and organisation, Interfacing peripheral devices, Interrupts.
Microprocessor architecture. Instruction set
and Programming (8085, p-Iu/P-IV). Microprocessor applications.
Unit—Il
Database Concepts. ER
diagrams, Data Models, Design of Relational Database. NormalisatiOfl, SQL and QBE. Query Processing and Optimisatlon. Centralised and Distributed Database, Security. Concurrency and Recovery In Centra]lsed and Distributed Database Systems. Object Oriented Database Management Systems (Concepts. Composite objects, Integration with RDBMS applications), ORACLE.
Unit—Ill
Display
systems, Input devices, 2D Geometry, Graphic operations. 3D Graphics. Animation. Graphic standard, Applications.
Concepts. Storage Devices. Input Tools, Authoring Tools. Application. Files.
Unlt—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,
denotationa] 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. Topdown 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, OS Reference Model, Protocols for—(i) Data link layer, (Ii) Network layer,
and (lii) 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 rt 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, Al approach for solving problems.
Automoted Reasonthg with propositional logic and predicate logic—fundamental proof procedure. refutation, resolution, refinements to resolution (ordering! prunlngf restriction strategies).
State space representation of problems. bounding functions, breadth first, depth first, A. A’. A0, 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 CrAGs). 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 Syllabus 2018

PAPER-III(B)
ELECTIVE/OPTIONAL


Elective—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-equfivalence of PDA
and DPDA.
Conteict 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-Kassarni-Younger (CKY). and Tomita’s parsing.
Linear Bounded Automata (LBA): Power of LBA. Closure properties. Thring Machine (1M): One tape, multitape. The notions of thne and space complexity in terms of TM. Construction of TM for simple problems. Computational complexity.
Chonzsky Hierarchy of languages : Recursive and recursively-enumerable languages.


Elective—II
Models for Information Channel : Discrete Memoryless Channel, Binary Symmetric Channel (BSC). Burst Channel. Bit-error rates. Probabffity, 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 (12) Codes. Optimality 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 flies (based on the JPEG and MPEG standards).

 

Elective—Ill
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.
Ellpso1d method and Karmakar’s method for solving LPPs. Solving simple LPPs through. these methods. Comparison of complexity of these methods.
Assignment and Thmsportatlon Problems: Simple algorithms like Hungarian method, etc.
Shortest Path Problems: DiJkstra’s and Moore’s method. Complexity. Network Flow Problem: Formulation. Max-Flow Mm-Cut theorem. Ford and Fulkerson’s algorithm. Exponential behaviour of Ford and Fulkerson’s algorithm. Ma1hotraPramodkumar-MaheShw (MPM) Polynomial algorithm for solving Network flow problem. Bipartite Graphs and Matchings: Solving matching problems using Network flow problems.
Matroids: Definition. Graphic and Cographic matrolds. 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—IV
Neuro.L Networks: Perceptron model. Linear separability and XOR problem.
Two and three layered neural nets. BackpropagatiOfl_COflVergeflce. 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-V
Unix : Operating System. Structure of Unix Operating System. Unix
Commands. Interfacing with Unix. Editors and Compilers for Unix, L,EX and
YACC, File system. System calls. Filters. Shell programming.
Windows : Windows environment, Urticode. Documents and Views. Drawing in a window, Message handling. Scrolling and Splitting views, Docking toolbars and Status bars, Common dialogs and Controls, MDI. Multlthreadlng. OLE, Active X controls, ATh. Database access, Network programming.

 

Best book for UGC NET Computer Science and Applications

UGC NET Computer Science and Applications Syllabus 2018

 

Leave a Reply

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.