This action might not be possible to undo. Are you sure you want to continue?
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.
Connectivity; spanning trees; Cut vertices & edges; covering; matching; independent sets; Colouring; Planarity; Isomorphism.
Algebra of matrices, determinants, systems of linear equations, Eigen values and Eigen vectors.
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. Trees. NP-hard. Scope. maxima & minima. Compiler Design: Lexical analysis. Binary search trees. Worst and average case analysis. Sorting. Continuity & differentiability. Notions of space and time complexity. Runtime environments. Binary heaps. ALU and data-path. Syntax directed translation. Design: Greedy approach. Searching. Programming and Data Structures: Programming in C. Theory of Computation: Regular languages and finite automata. Number representation and computer arithmetic (fixed and floating point). Instruction pipelining. Minimization. Linked Lists. average cases) of time and space. upper and lower bounds. Basic concepts of complexity classes P. worst. Hashing. Algorithms: Analysis. evaluation of definite & improper integrals. Operating System: . Asymptotic notation. Functions. Abstract data types. Memory interface. Secondary storage. Binding. Stacks. Undecidability. Asymptotic analysis (best. Arrays. Cache and main memory. NP. Computer Organization and Architecture: Machine instructions and addressing modes. Divide-andconquer. Recursion. Mean value Theorems. Shortest paths. Basics of code optimization. Intermediate and target code generation. NP-complete. Total derivatives. Connected components. CPU control design. I/O interface (Interrupt and DMA mode). Recursively enumerable sets and Turing machines. Partial derivatives. Dynamic programming. Tree and graph traversals. Spanning trees. Parameter passing. Computer Science and Information Technology Digital Logic: Logic functions. Context free languages and Push-down automata. Theorems of integral calculus. Queues. Design and synthesis of combinational and sequential circuits. Parsing.
process life cycle. B and B+ trees). design. Memory management and virtual memory. Basic concepts of hubs. smtp. Database design (integrity constraints. Inter-process communication. I/O systems. normal forms). Deadlock. . firewalls. and routers. gateways. input/output design. Query languages (SQL). pop. testing. File structures (sequential files. Congestion control. coding. http). data flow diagrams. Flow and error control techniques. LAN technologies (Ethernet. IP(v4). Protection and security. indexing. planning and managing the project. Network security basic concepts of public key and private key cryptography. Information Systems and Software Engineering: information gathering. Synchronization. basic concepts of client-server computing.Processes. XML. CPU scheduling. Routing algorithms. digital signature. Application layer protocols (icmp. ftp. TCP/UDP and sockets. process specifications. requirement and feasibility analysis. Token ring). Threads. dns. tuple calculus). Web technologies: HTML. implementation. File systems. Relational model (relational algebra. Databases: ER-model. Computer Networks: ISO/OSI stack. maintenance. Transactions and concurrency control. Concurrency. switches.