Explain the algorithm to find the optimal Binary Search Tree. Demonstrate this algorithm to find the Optimal Binary Search Tree for the following probability data (where pi represents the probability that the search will be for the key node ki, whereas qi represents that the search is for dummy node di. Make suitable assumptions, if any)
| i | 0 | 1 | 2 | 3 | 4 |
| pi | 0.10 | 0.15 | 0.20 | 0.10 | |
| qi | 0.05 | 0.10 | 0.10 | 0.10 | 0.10 |
To find the Optimal Binary Search Tree (OBST), we ____ _____ __________ __________ __________ ________ __________ ________ ___ ___ _________ ___.
___ ___ ______ ____ ___ ____ ___ ____.
_________ _______ __________ ______ ____ _________ ____ ________ _________ __________ _____.
_____ _______ __________ __________ ____ ____.
____ _________ ___ _________ ___ ________ _________ ________ _______ _______.
Get Full Answer on WhatsApp
Write and explain the Bubble sort algorithm. Discuss its best and worst-case time complexity.
Explain the Merge procedure of the Merge Sort algorithm. Demonstrate the use of recursive Merge sort algorithm for sorting the following data of size 8: [19, 18, 16, 12, 11, 10, 9, 8]. Compute the complexity of Merge Sort algorithm.
Subset Sum Problem
Assuming that data to be transmitted consists of only characters ‘a’ to ‘g’, design the Huffman code for the following frequencies of character data. Show all the steps of building a huffman tree. Also, show how a coded sequence using Huffman code can be decoded
Explain the Topological sorting with the help of an example. Also, explain the algorithm of finding strongly connected components in a directed Graph.
Write the Prim’s algorithm to find the minimum cost spanning tree of a graph. Also, find the time complexity of Prim’s algorithm. Demonstrate the use of Kruskal’s algorithm and Prim’s algorithm to find the minimum cost spanning tree for the Graph given in Figure 1. Show all the steps.
Write and explain the Left to Right binary exponentiation algorithm. Demonstrate the use of this algorithm to compute the value of 32 (Show the 29 steps of computation). Explain the worst-case complexity of this algorithm.