Download AKTU B-Tech 4th Sem 2014-15 Data Structure Question Paper

Firstranker's choice.

Printed Pages: 3

FirstRanker.com

--- Content provided by⁠ FirstRanker.com ---

131405

NEC401

(Following Paper ID and Roll No. to be filled in your Answer Book)

PAPER ID: 131405 Roll No.

B.Tech

--- Content provided by FirstRanker.com ---

(SEM. IV) THEORY EXAMINATION 2014-15

DATA STRUCTURE

Time: 3 Hours] [Total Marks: 100

Note: Attempt All Questions. All Questions carry equal marks:-

1. Attempt any FOUR of the following questions. 5x4=20

   --- Content provided by​ FirstRanker.com ---

   1. Explain merits and demerits of static and dynamic memory allocation techniques.
   2. What is asymptotic notation? Explain the Big 'O' notation.
   3. What is Sparse Matrix? Discuss its representation in term of lower triangular matrix.
   4. What is Link list? How it is different from an array?
   5. Write an algorithm to insert and delete an item from the circular link list.

   --- Content provided by⁠ FirstRanker.com ---

   6. Differentiate between overflow and underflow condition in link list.

2. operations for this data structure. 10x2=20

   Attempt any TWO of the following questions:

   1. Prove and explain that a strictly binary tree with 'n' leaves contains `2n-1' nodes.

   --- Content provided by​ FirstRanker.com ---

   2. Construct a tree for the following preorder and postorder and write its inorder traversal.
      Preorder: 24,14,13,19,17,15,10,5,8,6,7,20.
      Postorder: 13,15,17,10,19,14,7,6,20,8,5,24
   3. Explain threaded binary tree. How it would be useful and efficient in implementing the tree traversal?

--- Content provided by‍ FirstRanker.com ---

3. 10x2=20

   Attempt any TWO of the following questions:

   1. Explain Depth First Search. Give example to support your explanation.
   2. Explain Kruskal's algorithm to find minimum spanning tree in a weighted directed graph. Can there be two minimum spanning trees of given weighted directed graph?
   3. Write and explain the bubble sort algorithms for a given set of 'n' data's where 'kth' is the largest data.

   --- Content provided by‍ FirstRanker.com ---

   4. Compare and contrast average case behavior of Quick Sort and Merge Sort.