Scribd
Upload
16 views2 pages

Ads Lab Programs For Internal and External Exams

The document outlines a series of programming tasks related to data structures and algorithms. It includes constructing and manipulating AVL trees, B-Trees, heaps, and graphs, as well as implementing various sorting algorithms and optimization problems. Additionally, it covers techniques such as dynamic programming, backtracking, and greedy strategies for solving specific computational problems.

Uploaded by

Hemanth Atla
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
16 views2 pages

Ads Lab Programs For Internal and External Exams

The document outlines a series of programming tasks related to data structures and algorithms. It includes constructing and manipulating AVL trees, B-Trees, heaps, and graphs, as well as implementing various sorting algorithms and optimization problems. Additionally, it covers techniques such as dynamic programming, backtracking, and greedy strategies for solving specific computational problems.

Uploaded by

Hemanth Atla
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

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. Compare the performance of Single Source Shortest Paths using
Greedy method when the graph is represented by adjacency matrix and
adjacency lists.
8. Implement Job Sequencing with deadlines using Greedy strategy.

9a) Write a program to solve 0/1 Knapsack problem Using Dynamic Programming.
9b) Implement N-Queens Problem Using Backtracking.

10 a) Use Backtracking strategy to solve 0/1 Knapsack problem.


10 b) Implement Travelling Sales Person problem using Branch and Bound
approach.

You might also like