Define Queue as ADT. Describe its primitive operation on array implementation and linked list implementation.
Describe the significance of Huffman tree. Describe procedure for construction of a Huffman tree. Illustrate it with example. Describe different types of applications of Binary trees.
Explain the algorithms for infix to postfix conversion and evaluation of postfix expression. Trace the algorithms with suitable example.
Attempt any eight questions: (8 x 5 = 40)
State TOH problem. Write recursion tree when no. of disks are four.
Write about applications of Binary trees.
Compare partition strategies of Merge sort and Quick sort.
Explain Bubble sort algorithm. Illustrate it with an example.
How do you insert a nodes at last in doubly linked list? Explain.
Describe recursive procedure of Binary searching technique? Discuss about efficiency of Binary searching.
What are Hashing and collision? Write about any three hashing algorithms.
What is Big ‘O’ notation? Analyze any one sorting algorithm.
Describe strong and weekly connected graphs with examples. What is weighted graph?
State relative merits & demerits of contiguous list and linked list.