Subject : COMPUTER SCIENCE AND APPLICATIONS
SYLLABUS AND SAMPLE QUESTIONS
There will be two question papers, Paper—II and Paper—III. Paper—II will cover 50 Objective Type Questions carrying 100 marks. Paper—III will be of 200 marks and will consist of four sections, in all containing 26 questions (short and essay type) to attempt. For detail structure of Paper-III please visit our website http://www.msubaroda.ac.in
Sets, Relations, Functions. Pigeonhole Principle. Inclusion-Exclusion Principle. Equivalence and Partial Orderings, Elementary Counting Techniques, Probability. Measure(s) for Information and Mutual Information.
Compatibility : Models of computation—Finite Automata, Pushdown Automata, Nondeterminism and NFA. DPDA and PDAs and Languages accepted by these structures. Grammars, Languages, Non-computabllity 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.
Prepositional (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.
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. Data types, Operators, Control statements. Functions parameter passing. Class and objects. Constructors and destructors. Overloading. Inheritance, Templates, Exception handling. 1
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.
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.
Network fundamentals : Local Area Networks (LAN) Metropolitan Area Networks (MAN), Wide Area Networks (WAN), Wireless Networks. Intel 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. Telephones— 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. Conjestlon control. Network Security : Cryptography—public key, secret key. Domain Name System (DNS)— Electronic...