Here are some links of interest:
1. Understand and remember algorithms and its analysis procedure.
2. Introduce the concept of data structures through ADT including List, Stack, Queues.
3. To design and implement various data structure algorithms.
4. To introduce various techniques for representation of the data in the real world.
5. To develop application using data structure algorithms.
6. Compute the complexity of various algorithms.
1. Understand and remember algorithms and its analysis procedure.
2. Introduce the concept of data structures through ADT including List, Stack, Queues.
3. To design and implement various data structure algorithms.
4. To introduce various techniques for representation of the data in the real world.
5. To develop application using data structure algorithms.
6. Compute the complexity of various algorithms.
The main thrust of this course is to learn different numerical techniques used for solving algebraic and transcendental equations, Interpolation and polynomial approximations, numerical integration and differentiation.
1. To assess how the choice of data structures and algorithm design methods impacts the performance of programs.
2. To choose the appropriate data structure and algorithm design method for a specified application.
3. To study the systematic way of solving problems, various methods of organizing large amounts of data.
4. To solve problems using data structures such as linear lists, stacks, queues, binary trees, binary search trees, and graphs and writing programs for these solutions.
5. To employ the different data structures to find the solutions for specific problems