Andhra University BE/B.Tech Data Structures Previous Paper 2006
First question is compulsory.
Answer any FOUR from the remaining questions.
All questions carry equal marks
1. (a)Define Abstract Data Type.
(b)List the elements of a 3-D array of 2*3*4 order in the column-major order.
(c) What is a doubly linked list?
(d) Write the advantages of circular queue.
(e) Write the purpose of threads in binary trees.
(f) What is meant by back-edge in directed graph? What does it indicate?
(g) Write the time complexity of
(i) Binary search algorithm and
(ii) Heap sort algorithm.
2.(a) Write a C program to convert a given infix expression into postfix form and explain.
(b) Write a recursive function for towers of Hanoi problem and discuss the Suitability of recursive approach to it.
3. (a) Write the ADT specification of Queue and explain.
(b) Discuss alternative ways of representing ADT queue and compare them.
4. What is a DEQUE?How do you implement it using circular linked list with its header pointing to the last node in the list.Explain insertion and deletion of nodes into a Deque with suitable diagrams .
5.(a) Find the inorder,preorder and postorder sequence of nodes in the given binary tree.
(b) Discuss various ways of representing binary trees and apply them to the given binary tree.
6. (a) Arrange the given list of integers in a binary search tree given below:
(b)Find the number of probes required to search for (i)68 and (ii) 80 in the list and report on its availability.
(c)Delete the element 52 from the tree and show the resultant tree.
8.(a)Write the Dijkstra’s algorithm for finding the shortest paths from a source vertex to Rest of the vertices in a directed graph.
(b) Explain the above algorithm by applying it to the given graph with vertex ‘B’ as sourcehttp://www.stepinau.com/2013/09/26/andhra-university-beb-tech-data-structures-previous-paper-2006/IT 2.1 Previous PapersCSE,CSE Previous Papers,Data Structures