How to prepare for ugc net computer science December 2018
aper II Syllabus
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. Centres of a tree. Hamiltonian and Eulerian 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 combinational and sequential circuits.
Representation of Integers : Octal, Hex, Decimal, and Binary. 2′s complement and 1′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.
O – O Programming Concepts: Class, object, instantiation. Inheritance, polymorphism and overloading.
C++ Programming: Elements of C++ – Tokens, identifiers. Variables and constants, Datatypes, 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, normalization – INF, 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 Radio. Communication satellites-geosynchronous and low-orbit.
Internetworking: 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 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,
Main concepts in Geographical Information System (GIS), E – cash, E – Business, ERP packages.
Data Warehousing: Data Warehouse environment, architecture of a data warehouse methodology, analysis, design, construction and administration.
Introduction to Windows programming – Win32, 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: