This action might not be possible to undo. Are you sure you want to continue?
b) Explain Minimum Cost Spanning Trees. 3.a) Explain about Compressed Tries algorithm. b) Write about Boyer-Moore Algorithm. 4. (a)Is merge sort an external sorting technique? Justify your answer. (b) Describe collision handling schemes in hashing 5. (a) Discuss about all pairs shortest path problem. (b) What is a trie? Write about suffix trie.  6. Write short notes on the following (a) Splay tree (b) Dictionary ADT (c) Non tail recursion.
6.a) Implement Radix Sort. b) Implement Quick Sort . 7.a) Compare the sorting methods. b) Write about Adjacency Lists. 8.a) Implement Kruskal’s Algorithm for Minimum Cost Spanning Trees. b) Write about Suffix Tries.