| Data Structures and Algorithms (UMC 201) |
Review of Basic Data Structures – Arrays, Linked Lists, Stacks, Queues. Asymptotic complexity functions. Standard Data Structures – Heaps, Balanced Search Trees. Algorithmic Paradigms – Divide and Conquer, Greedy, Dynamic Programming. Graph Algorithms – Traversals, Shortest Paths, Minimum Spanning Trees. Advanced Data Structures – Union Find, Hashing. Amortized analysis, Splay trees, Fibonacci trees.
|
A |
| Introduction to Numerical Methods (UMC 202) |
Numerical solution of algebraic and transcendental equations, Iterative algorithms, Convergence, Newton Raphson procedure, Solutions of polynomial and simultaneous linear equations, Gauss method, Relaxation procedure, Error estimates, Numerical integration, Euler-Maclaurin formula. Newton-Cotes formulae, Error estimates, Gaussian quadratures, Extensions to multiple integrals. Numerical integration of ordinary differential equations: Methods of Euler, Adams, Runge-Kutta and predictor – corrector procedures, Stability of solution. Solution of stiff equations. Solution of boundary value problems: Shooting method with least square convergence criterion, Galerkin Method (Finite Element) Solution of partial differential equations: Finite-difference techniques, Stability and convergence of the solution, Finite element methods.
|
A+ |