Data Structure (2130702)

BE | Semester 3 
  Summer - 2016 | 06/09/2016
Total Marks 70

Q1   Short Question

Q1 (1)   Define primitive data structure.

Q1 (2)   Explain space and time complexity.

Q1 (3)   What is the time complexity of Quicksort algorithm in the worst case?

Q1 (4)   List the applications of Stack.

Q1 (5)   Define graph.

Q1 (6)   Explain degree of a vertex in a graph.

Q1 (7)   List the applications of Graphs.

Q1 (8)   List the applications of Binary trees.

Q1 (9)   Define B-Tree.

Q1 (10)   Describe the time complexity of Binary search algorithm.

Q1 (11)   What is hash collision?

Q1 (12)   Write ‘C’ structure of Binary tree.

Q1 (13)   Write ‘C’ structure of Singly linked list.

Q1 (14)   Define priority queue.

Q2 (a)   Write an algorithm for simple queue with ENQUEUE operations.

Q2 (b)   Write an algorithm to reverse a string using stack.

Q2 (c)   Write a program to implement stack using linked list.

Q2   OR

Q2 (c)   Write a program to implement circular queue using array.

Q3 (a)   Evaluate the following postfix expression using stack:

Q3 (b)   Explain the concept of circular queue. Compare circular queue with simple queue.

Q3 (c)   Explain insert and delete operations in AVL trees with suitable examples.

Q3   OR

Q3 (a)   Explain double ended queue.

Q3 (b)   Write ‘C’ functions to implement DELETE_FIRST_NODE and TRAVERSE operations in doubly linked list.

Q3 (c)   With a suitable example, explain steps for conversion of a general tree into a binary tree.

Q4 (a)   Explain Sequential search method.

Q4 (b)   Explain Threaded binary trees with suitable examples.

Q4 (c)   Write an algorithm for Selection sort method. Explain each step with an example.

Q4   OR

Q4 (a)   Explain Depth First Search in graphs with an example.

Q4 (b)   Explain Binary search method.

Q4 (c)   Write an algorithm for Insertion sort method. Explain each step with an example.

Q5 (a)   Explain Breadth First Search in graphs with an example.

Q5 (b)   Construct a binary tree from the traversals given below:

Q5 (c)   Explain various Hash collision resolution techniques with examples.

Q5   OR

Q5 (a)   Explain Sequential file organizations and list its advantages and disadvantages.

Q5 (b)   Draw a Binary expression tree for the following and perform preorder traversal:

Q5 (c)   Write Prim’s algorithm for minimum spanning tree with an example.