Engineering Academy
204, 2nd Floor, Rahman Plaza Opp. Methodist School, Abids. Hyderabad, INDIA GATE – 2011 SYLLABUS COMPUTER SCIENCE AND INFORMATION TECHNOLOGY (CS) Engineering Mathematics Mathematical Logic:
Propositional Logic; First Order Logic.

Conditional Probability; Mean, Median, Mode and Standard Deviation; Random Variables; Distributions; uniform, normal, exponential, Poisson, Binomial.

Set Theory & Algebra:
Sets; Relations; Functions; Groups; Partial Orders; Lattice; Boolean Algebra.

Permutations; Combinations; Counting; Summation; generating functions; recurrence relations; asymptotics.

Graph Theory:
Connectivity; spanning trees; Cut vertices & edges; covering; matching; independent sets; Colouring; Planarity; Isomorphism.

Linear Algebra:
Algebra of matrices, determinants, systems of linear equations, Eigen values and Eigen vectors.

Numerical Methods:
LU decomposition for systems of linear equations; numerical solutions of non-linear algebraic equations by Secant, Bisection and Newton-Raphson Methods; Numerical integration by trapezoidal and Simpson's rules.

Limit, Continuity & differentiability, Mean value Theorems, Theorems of integral calculus, evaluation of definite & improper integrals, Partial derivatives, Total derivatives, maxima & minima.

Computer Science and Information Technology Digital Logic:
Logic functions, Minimization, Design and synthesis of combinational and sequential circuits; Number representation and computer arithmetic (fixed and floating point).

Computer Networks: ISO/OSI stack. IP(v4). planning and managing the project. gateways. input/output design. Context free languages and Push-down automata. worst. http). File systems. Queues. Databases: ER-model. Operating System: Processes. Dynamic programming. Algorithms: Analysis. process life cycle. coding. Instruction pipelining. Memory management and virtual memory. Information Systems and Software Engineering: information gathering. Notions of space and time complexity. Binary heaps. Functions. Application layer protocols (icmp. Theory of Computation: Regular languages and finite automata. Parameter passing. dns. requirement and feasibility analysis. and routers. Recursively enumerable sets and Turing machines. Relational model (relational algebra. I/O systems. Design: Greedy approach. CPU control design. digital signature. firewalls. NP-hard. Cache and main memory. TCP/UDP and sockets. normal forms). pop. Synchronization. average cases) of time and space. Searching. switches. File structures (sequential files. I/O interface (Interrupt and DMA mode). Binary search trees. process specifications. Intermediate and target code generation. Programming and Data Structures: Programming in C. Asymptotic notation. tuple calculus). design. Scope. NP-complete. Runtime environments. indexing. Query languages (SQL). Token ring). data flow diagrams. XML. Threads. Linked Lists. NP. ALU and data-path. smtp. Hashing. . Asymptotic analysis (best. Secondary storage. Trees. Inter-process communication. Basic concepts of complexity classes P. Parsing. upper and lower bounds. Tree and graph traversals. implementation. Sorting. Congestion control. maintenance.Computer Organization and Architecture: Machine instructions and addressing modes. Divide-andconquer. Worst and average case analysis. Compiler Design: Lexical analysis. ftp. Abstract data types. basic concepts of client-server computing. testing. Binding. Arrays. Undecidability. Deadlock. Spanning trees. Concurrency. Recursion. Web technologies: HTML. Stacks. Shortest paths. Syntax directed translation. Memory interface. Basic concepts of hubs. Flow and error control techniques. LAN technologies (Ethernet. B and B+ trees). Basics of code optimization. Transactions and concurrency control. Database design (integrity constraints. CPU scheduling. Network security basic concepts of public key and private key cryptography. Routing algorithms. Connected components. Protection and security.

Sign up to vote on this title
UsefulNot useful