SRINIVASA RAMANUJAN INSTITUTE OF TECHNOLOGY

Advanced Data Structures and Algorithm Analysis Lab

(Computer Science and Engineering)

II B. Tech – I Semester SRIT R23

Course Code Category Hours/Week Credits Maximum Marks
L T P C CIA SEE Total
0 0 3 1.5 30 70 100
List of Experiments
S. No. Title of the Experiment
1 Construct an AVL tree for a given set of elements which are stored in a file. And
implement insert and delete operation on the constructed tree. Write contents of tree
into a new file using in-order.

2 Construct B-Tree an order of 5 with a set of 100 random elements stored in array.
Implement searching, insertion and deletion operations.
3 Construct Min and Max Heap using arrays, delete any element and display the content of
the Heap.
4 Implement BFT and DFT for given graph, when graph is represented by
a) Adjacency Matrix b) Adjacency Lists

5 Write a program for finding the biconnected components in a given graph.

6 Implement Quick sort and Merge sort and observe the execution time for various input
sizes (Average, Worst and Best cases).

7 Using Greedy Method:

a) Compare the performance of Single Source Shortest Paths using Greedy method
when the graph is represented by adjacency matrix and adjacency lists.
b) Implement Job Sequencing with deadlines using Greedy strategy.

8 Write a program to solve 0/1 Knapsack problem Using Dynamic Programming.

9 Using Back Tracking:
a) Implement N-Queens Problem Using Backtracking.
b) Use Backtracking strategy to solve 0/1 Knapsack problem.
10 Implement Travelling Sales Person Problem using Branch and Bound approach.

Virtual Lab Experiments

1 https://www.w3resource.com/c-programming-exercises/tree/c-tree-exercises-10.php
2 https://www.geeksforgeeks.org/

Reference Books/Lab Manuals

1 "Introduction to Algorithms" by Thomas H. Cormen, Charles E. Leiserson, Ronald L.
Rivest, and Clifford Stein. Fourth Edition., The MIT Press Cambridge,
Massachusetts London, England.
2 Fundamentals of Data Structures in C++, Horowitz Ellis, Sahni Sartaj, Mehta,
Dinesh, 2nd Edition, Universities Press

3 An introduction to Data Structures with applications, Trembley & Sorenson,

McGraw Hill

Course Outcomes: At the end of the course, the student able to

CO1
CO2

CO3
CO4
CO5
CO6

Course Internal Assessment & Evaluation

Continuous Internal Evaluation (CIE) : 30 Marks
Assessment Tool Marks Course Outcomes addressed
Day-to-day Evaluation & Record work 20
CO1, CO2, CO3, CO4, CO5, CO6
Internal Practical Exam & Viva Voce 10
Total CIE Marks 30
Semester End Examination (SEE): 70 Marks
Semester End Examination 70 CO1, CO2, CO3, CO4, CO5, CO6
Total Marks 100