‘UNIVERSITY GRANTS COMMISSION NET BUREAU Code No. : 87 Subject : COMPUTER SCIENCE AND APPLICATIONS “SYLLABUS AND SAMPLE QUESTIONS Note : There will be two question papers, Paper-Il 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 (800 words) carrying 16 marks each. In it there will be one question with internal choice from each unit (Le., 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-IIl will be 200. PAPER-IL 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. Hamiltonian and Eulerian graphs, Planar graphs. “Groups : Finite fields and Error correcting/detecting codes. 87 1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. 0-O 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, normalization—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. "87 2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, 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) 87 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.