Data Structure (2130702)

BE | Semester 3 
  Winter - 2015|01/02/2016
Total Marks 70

Q1 (a) What does abstract data type means? Briefly explain linear and non linear data structures.

  (b) Given a two dimensional array A1(1:8, 7:14) stored in row-major order with base address 100 and size of each element is 4 bytes, find address of the element A1(4, 12).

Q2 (a) Write an algorithm to implement PUSH and POP Operations on Stack.

  (b) Write an algorithm for evaluation of postfix expression and evaluate the following expression showing every status of stack in tabular form.

OR

  (b) Enlist difference between recursive and iterative algorithms. Write any one recursive function showing the stack contents while function call and return.

Q3 (a) Write a program to perform insert and delete routines on a queue.

  (b) Write advantages and disadvantages of linked list, doubly linked list and circular linked list with example.

OR

Q3 (a) Explain priority queue and dequeue. Write an algorithm/program for insert routine in input restricted dequeues.

  (b) Write a program to search an element in a linked list.

Q4 (a) Create a Binary Search Tree for the following data and do in-order, Preorder and Post-order traversal of the tree.

  (b) Define the following with example :

OR

Q4 (a) What is Binary Search Tree? Write recursive algorithm/program to implement in-order traversal of the Binary Search Tree.

  (b) Define height balanced tree. Construct a height balanced binary tree (AVL tree) for the following data

Q5 (a) What is hashing? Briefly explain various methods of hashing.

  (b) Explain with example DFS and BFS traversal of graph.

OR

Q5 (a) What is File Structure? Explain any one File Structure in detail.

  (b) Show how graph can be represented using example? How path matrix can be found out using adjacency matrix