P. 1


|Views: 1|Likes:
Published by Shashi Kanth Reddy

More info:

Published by: Shashi Kanth Reddy on Mar 04, 2012
Copyright:Attribution Non-commercial


Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less






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.


Spanning trees. Parameter passing. Hashing. Memory interface. Binary heaps. Compiler Design: Lexical analysis. Undecidability. worst. Theory of Computation: Regular languages and finite automata. Dynamic programming. Runtime environments. upper and lower bounds. Theorems of integral calculus. Abstract data types. Basic concepts of complexity classes P. Design and synthesis of combinational and sequential circuits. Parsing. Asymptotic notation. Searching. Basics of code optimization. Design: Greedy approach. Partial derivatives. ALU and data-path. evaluation of definite & improper integrals. Algorithms: Analysis. Arrays. Programming and Data Structures: Programming in C. Notions of space and time complexity. Recursively enumerable sets and Turing machines. Tree and graph traversals. Divide-andconquer. Context free languages and Push-down automata. Minimization. Shortest paths. Worst and average case analysis. average cases) of time and space. Stacks. CPU control design. Asymptotic analysis (best. Connected components. Operating System: . Total derivatives. Linked Lists. NP. Queues. Binary search trees. Functions. Computer Organization and Architecture: Machine instructions and addressing modes. Syntax directed translation. Continuity & differentiability. Cache and main memory. Scope.Limit. NP-complete. Intermediate and target code generation. Secondary storage. Recursion. Trees. Mean value Theorems. Computer Science and Information Technology Digital Logic: Logic functions. Binding. Instruction pipelining. Sorting. maxima & minima. I/O interface (Interrupt and DMA mode). Number representation and computer arithmetic (fixed and floating point). NP-hard.

Threads. Deadlock. digital signature. gateways. basic concepts of client-server computing. Information Systems and Software Engineering: information gathering. http). implementation. indexing. requirement and feasibility analysis. Databases: ER-model. data flow diagrams. Flow and error control techniques. ftp. input/output design. Memory management and virtual memory. Protection and security. tuple calculus). normal forms).Processes. CPU scheduling. Relational model (relational algebra. I/O systems. process specifications. Routing algorithms. Application layer protocols (icmp. Computer Networks: ISO/OSI stack. testing. Query languages (SQL). process life cycle. smtp. Web technologies: HTML. firewalls. planning and managing the project. Basic concepts of hubs. TCP/UDP and sockets. File structures (sequential files. Congestion control. coding. dns. IP(v4). File systems. XML. Synchronization. maintenance. B and B+ trees). Token ring). switches. and routers. Network security basic concepts of public key and private key cryptography. Transactions and concurrency control. design. LAN technologies (Ethernet. Inter-process communication.   . pop. Concurrency. Database design (integrity constraints.

You're Reading a Free Preview

/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->