Osmania University (OU) 2008 B.Tech Electrical and Electronics Engineering CS1211 - DATA STRUCTURES - Question Paper

PART-A

1. What do you mean by Abstract Data kind.
2. Write an algorithm for fibonacci series
3. What are the benefits of doubly linked list over singly linked list?
4. Define priority queue
5. How do you represent a binary tree?
6. What is the factor that is involved in radix sort?
7. Write the different kinds of sorting?
8. Define heap sort.
9. Explain Kruskal’s algorithm
10. What is a graph?

PART-B

11.a(i) Write about the pointers in C (8)
(ii)Explain in detail about the function. (8)

(OR)

b(i) How is the implementation of structure done in C (8)
(ii) discuss an algorithm to convert a hexadecimal to decimal representation (8)


12 a(i) discuss in detail about the operation of queue (6)
(ii) describe an efficient representation of 2 STACKS in a provided area of memory with ‘n’ words and discuss (10)

(OR)

b(i) discuss in detail about insertion and deletion of elements in the doubly linked list
(16)


13 a(i) elaborate the various tree traversals? discuss with examples (8)
(ii)How do you insert an element in a binary tree (8)

(OR)

b(i)Explain the operation of AVL tree (8)
(ii)Using recursive procedure, discuss the operation of post order and pre order traversal of binary tree. (8)


14.a(i)Write the procedure for insertion sort. (8)
(ii)Sort the subsequent array using insertion sort
25,30,66,99,54,28,13,58 (8)

(OR)

b(i)Write down the merge sort algoritm and provide its worst case, best case and avg. case analysis. (16)


15.a,(i)Explain the Prim’s algoritm (8)
(ii)Define unweighted shortest path (4)
(iii)Explain the following: Degree, Complete graph (4)

(OR)

b(i)Explain the Krusal’s algorithm (8)
(ii)Give a few applications of depth 1st traversal (8)

Earning:   Approval pending.