![]() Theory of Computation: Regular languages and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Undecidability.Ĭompiler Design: Lexical analysis, Parsing, Syntax directed translation, Runtime environments, Intermediate and target code generation, Basics of code optimization. Asymptotic analysis (best, worst, average cases) of time and space, upper and lower bounds, Basic concepts of complexity classes � P, NP, NP-hard, NP-complete. Programming and Data Structures: Programming in C Functions, Recursion, Parameter passing, Scope, Binding Abstract data types, Arrays, Stacks, Queues, Linked Lists, Trees, Binary search trees, Binary heaps.Īlgorithms: Analysis, Asymptotic notation, Notions of space and time complexity, Worst and average case analysis Design: Greedy approach, Dynamic programming, Divide-and-conquer Tree and graph traversals, Connected components, Spanning trees, Shortest paths Hashing, Sorting, Searching. 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.Ĭalculus : Limit, Continuity & differentiability, Mean value Theorems, Theorems of integral calculus, evaluation of definite & improper integrals, Partial derivatives, Total derivatives, maxima & minima.ĬOMPUTER SCIENCE AND INFORMATION TECHNOLOGYĭigital Logic: Logic functions, Minimization, Design and synthesis of combinational and sequential circuits Number representation and computer arithmetic (fixed and floating point).Ĭomputer Organization and Architecture: Machine instructions and addressing modes, ALU and data-path, CPU control design, Memory interface, I/O interface (Interrupt and DMA mode), Instruction pipelining, Cache and main memory, Secondary storage. Linear Algebra : Algebra of matrices, determinants, systems of linear equations, Eigen values and Eigen vectors. Graph Theory : Connectivity spanning trees Cut vertices & edges covering matching independent sets Colouring Planarity Isomorphism. Set Theory & Algebra : Sets Relations Functions Groups Partial Orders Lattice Boolean Algebra.Ĭombinatorics : Permutations Combinations Counting Summation generating functions Probability : Conditional Probability Mean, Median, Mode and Standard Deviation Random Variables Distributions uniform, normal, exponential, Poisson, Binomial. Mathematical Logic : Propositional Logic First Order Logic. Computer Science & Information Technology – CS
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |