Department Events
DATA STRUCTURES AND ALGORITHM DESIGN LAB
This course enables the students to
- Analysis of different algorithms.
- Apply mathematical approach for Analysis of Algorithms.
- Create appropriate techniques for a given problem.
- Develop programming skills to convert Dynamic Programming, Greedy method and Backtracking.
- Implement solutions using various strategies.
Course Outcomes(COs):
Learning Outcome (at course level)
| Learning and teaching strategies | Assessment Strategies |
CO80.Examine linear data structure and analyze the running time and space complexity of algorithms. CO81.Analyze different linear and non linear data structures CO82.Apply, Analyze and Implement of Greedy strategy, Dynamic programming CO83.Analyze and apply branch and bound and Backtracking algorithms for different problems CO84.Develop appropriate data structure for specified problem domain. | Approach in teaching: Interactive Lab Sessions, Modelling, Discussions, implementing enquiry based learning, student centred approach
Learning activities for the students: Experiential Learning, Discussions, Lab Assignments |
Assessment
|
Contents
- Linear search & binary search , Sorting Techniques
- Stacks and queues operations (with arrays and pointers)
- Link List and Trees operations (with arrays and pointers)
- graphs – basic traversal and search techniques
- Greedy method:-knapsack problem
- Greedy method minimum cost spanning tree
- Dynamic Programming – 0/1 Knapsack
- Dynamic Programming – traveling salesman problem
- Backtracking 8-Queens problem
- Backtracking Sum of Subsets
- Branch and Bound -0/1 Knapsack problem
- Sequential and Dynamic Implementations
