STATE ELIGIBILITY TEST
COMPUTER SCIENCE AND APPLICATIONS
SUBJECT CODE : 28
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 noncomputable 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, Planar graphs.
Groups : Finite fields and Error correcting/detecting codes.
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.
Programming in C and C++
Programming in C : Elements of C-Tokens, identifiers, data types in C. Control structures in C. Sequence, selection and iterations(s). Structured data types in C-arrays, struct, union, string, and pointers.
O-O Programming Concepts:
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.
Relational Database Design and SQL
E-R diagrams and their transformation to relational design, normalization1NF, 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).
Networks (MAN), Wide Area Networks (WAN).
Wireless Networks, Inter
Reference Models : The OSI model, TCP/IP model.
Data Communication : Channel capacity. Transmission media-twisted pair, coxial cable, fibre-optic cables, wireless transmission-radio, microwave, infrared and millimetre 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 : Swithc/Hub, Bridge, Router, Gateways, Concatenated virtual circuits. Tunneling, Fragmentation, Firewalls.
Routing : Virtual circuits and datagrams.
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.
System Software and Compilers
Assembly language fundamentals (8085 based assembly language programming).
Assemblers-2-pass and single-pass.
Loading, linking, relocation, program relocatability. Linkage editing. Text editors.
Please join StudyMode to read the full document