Detailed UGC NET Computer Science and Application Syllabus



Here is the detailed syllabus of  UGC NET Computer Science and Application exam.

Syllabus for Artificial Intelligence

Definitions. AI approach for solving problems, Automated Reasoning with propositional 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, Butlding expert system and Shell, RTNS. ATNS, Parsing of Ambiguous CFG’s. 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

Syllabus for Computer Arithmetic

Propositional (Boolean), 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
Computer Graphics
Display systems, Input devices, 2D Geometry, Graphic operations, 3D Graphics, Animation, Graphic standard, Applications, Concepts, Storage Devices, Input Tools, Authoring Tools, Application. Files

Current Trends and Technologies
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 Systems (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, summation, 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.

Advance Windows Programming

Multiple Document Interface (MDI), Multithreading. Object linking and Embedding (OLE). Active X controls. Active Template Library (ATL). Network programming.

Simple Applications in Windows

Scrolling, splitting views, docking toolbars, status bars, common dialogs.

Syllabus for DataBase Management Systems

E-R Diagrams and their transformation to relation design. Normalisation- 1NF, 2NF, 3NF and 4NF. Limitations of 4NF and BCNF

Data definition language(DDL), Data manipulation language(DML), Data control language (DCL) commands. Database objects like- Views, indexes, sequences , synonyms, data dictionary

Database Concepts. ER diagams, Data Models, Design of Relational Database, 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

Syllabus Data Communication and Networks

Data Communication

Analog and Digital transmission, Asynchronous and Synchronous transmission, Transmission media, Multiplexing and Concentration, Switching techniques, Polling
Networks

Topologies, Networking Devices, OSI Reference Model, Protocols for (i) Data link layer, (ii) Network layer, and (iii) Transport layer, TCP/IP protocols, Networks security; Network administration
Network Fundaments

Local area Network (LAN), metropolitan Area Network(MAN), Wide area Network(WAN), Wireless Network, Inter Network
Reference Model

The OSI model, TCP/IP model
Data Communication

Channel capacity. Transmission media- Twisted pair, Coaxial cables, Fiber optic cables, Wireless transmission- radio, microwave, infrared and millimeter waves. Light wave transmission. Telephones- local loop, trunks, multiplexing, switching, narrowband ISDN, broadband ISDN, ATM, High speed LANS, Cellular radio Communication. satellite- Geosynchronous and low-orbit
Internetworking

Switch/Hub, Bridge, router, Gateways Concatahetsd virtual circuits, Tunneling, Fragmentation, Firewalls
Routing

Virtual circuits and datagrams, Routing algorithms, congestion control
Network Security

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

Syllabus for Data Structures and Algorithms

Data, Information, Data structure, Simple and Composite structures. Array, List, Stack, Queue, Linked list, Tree, Binary tree, B-tree, Graph, Priority queue and heap

Field, record and file. Sequential, direct, index-sequential and relative files. Hashing, inverted lists and multi-lists. B trees and B+ trees

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 programming constructs. Simple non-deterministic programs. NP-hard and NP-complete problems

Syllabus for Digital Systems and Microprocessors

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

Combinational Circuit Design, Sequential Circuit Design, Hardwired and Microprogrammed 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

Syllabus for Discrete Structures

Set, relation, Functions, Pigeonhole Principle, inclusion-Exclusion Principle, Equivalence and Partial orderings, elementary counting techniques, Probability, Measure(s) for Information and total information.

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, centers of a tree, Hamiltonian and Eulerian graphs, planar graphs

Finite field and error correcting / detecting code, Propositional (Boolean), Predicate Logic, Well-formed-formulae (WFF), Satisfiability and Tautology

Object Oriented Programming

Class, Object, instantiation, Inheritance, polymorphism and overloading,Object,messages, classes, instantiation, encapsulation, inheritance, polymorphism, overloading, aggregation, abstract classes, generalization as extension and restriction. Object oriented design. Multiple inheritance, metadata

Operating Systems

Introduction, Memory management, Support for concurrent process, Scheduling, System deadlock, Multiprogramming system. 1/0 management, Distributed operating systems, Study of Unix and Windows NT, Virtual memory, paging, fragmentation, Mutual exclusion. Critical regions, lock and unlock, CPU scheduling, I/O scheduling, Resource scheduling, Deadlock and scheduling algorithms. Banker’s algorithm for deadlock handling

Programming in C and 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

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

Software Engineering

Steps, Water fall model, Prototypes Spiral model, Software Project Management, System design, detailed design. function oriented design, object oriented design, user interface design. Design level metrics, Testing level metrics. software quality and reliability. Clean room approach, software reengineering, Software development models, Requirement analysis and specifications, Software design, techniques and tools, Software validation and quality assurance techniques, Software maintenance and advanced concepts, Software management

Compilers

Assembly language fundamentals (8085 based assembly language programming). Assemblers- two-pass and single-pass. Macros and macro-processors, 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, Top-down parsers- left recursion and its removal. Recursive descent parser. Predictive parser, Intermediate codes- Quadruples, Triples, Intermediate code generation, Code generation, Code optimization
Unix and Windows

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

Web Technologies
HTML, DHTML, XML, Scripting, Java, Servlet, Applet



Leave a Reply

© 2017 Techvyom. All rights reserved. Site Admin · Entries RSS · Comments RSS
Powered by WordPress · Designed by Theme Junkie
Read more:
DBMS video lecture on Relational Algebra

DBMS video lectures on Relational Algebra from Indian Institute of Technology and University of Houston . These video lectures covers...

Close