Module-I Implementation of array operations:
Module -II Stacks and Queues : adding, deleting elements circular Queue: adding & deleting element
Merging Problem: Evaluation of expressions operations on Multiple Stacks & Queues.
Module -III Implementation of linked lists: inserting, deleting, inverting a linked list. Implementation of
stacks & queues using linked lists:
Module -IV Polynomial addition, Polynomial multiplication
Sparse Matrices: Multiplication, addition.
Module -V Recursive and Non-recursive traversal of Trees
Threaded binary tree traversal. AVL tree implementation.
Application of Trees, Application of sorting and searching algorithms.
Module -VI Hash tables implementation: searching, inserting and deleting, searching & sorting techniques.
Module – VII
1. Assignments on Interpolation: Newton forward & backward, Lagrange
2. Assignments on Numerical Integration: Trapezodial Rule, Simson’s 1/3 Rule, Weddle’s Rule.
Module – VIII
1. Assignments on Numerical solution of a system of linear equation: Gauss elimination, Gauss
Jacobi, Matrix Inversion, Gauss Seidal.
Module – IX
1. Assignments on Algebric Equation: Bisection, Secant, Regular – falsi, Newton Raphson.
Module – X
1. Assignments on Ordinary Differential Equation: Taylor Series, Euler’s method, Runga-Kutta.
Module – XI
1. Assignments on Statistical Problem: Mean, Median, Mode, Standard deviation (for simple &
frequency type data), Correlation & Regression.
Module-XII
1. Innovative Expt on data structure programming
2. Innovative Expt on numerical analysis programming.