Scribd
Upload
11 views1 page

Ads Lab Index

Uploaded by

Ayush Choudhary
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views1 page

Ads Lab Index

Uploaded by

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

INDEX

S.No. Name of experiment Date Remarks


1. WAP to implement Huffman Coded Tree using a priority queue.
2. WAP to implement the following operations in a B Tree of n nodes
containing integer type of data
a. insertion,
b. deletion, and
c. traversal
3. WAP to implement the following operations in a B+ Tree of n nodes
containing character type of data
a. insertion,
b. deletion, and
c. traversal
4. WAP to perform the following operations for a Red-Black Tree
ensuring no property of Red-Black Tree is violated.
a. insertion
b. finding its black height
5. WAP to perform the following w.r.t an Interval Tree:
a. Inserting an interval
b. Searching an interval
c. Preorder traversal of the available intervals
6. WAP to insert elements in a 2-3 tree.
7. WAP to detect if cycle is present in the graph using the concept of
disjoint sets.
8. WAP to implement the following operations for a Binomial Heap
a. make_heap,
b. insertion, and
c. find_min
9. WAP to implement Fibonacci Heap.
10. WAP to count the total number of Spanning Trees for a given graph.
11. WAP to find all-pairs shortest path using
a. Matrix Multiplication via dynamic-programming paradigm
b. Floyd-Warshall algorithm
12. WAP to count Cut Vertices in an undirected connected graph.
13. WAP to identify if a given graph is Eulerian or not.
14. Check if a word occurs as a prefix of any word in a sentence using
trie

You might also like