Page 1 of 2
NIRMA UNIVERSITY
Institute of Technology
Semester End Examination, May-2021
B. Tech., Semester– VI (Open Elective)
2CSOE52 – DATA STRUCTURES
Time: 1.5 Hour Max Marks: 40
Instructions: 1. Attempt all questions.
2. Figures to right indicate full marks
3. Assume suitable assumptions if required and specify them.
Q-1
Answer the following.
[10]
A)
CO1
Write an algorithm to perform the following operations on a double
ended queue implemented as a simple queue.
(a) Insert an element from front
(b) Delete an element from rear
05
B)
CO1
Consider a two dimensional array A[2:9, -4:7, 4:12]. The base
address of the array is 2000 and the memory required by each
elements is 2 bytes. Find the address of the location A[4, 2, 9] using
both the row and column major order. Show all the intermediate
steps.
05
Q-2
Answer the following.
[10]
A)
CO2
How an insert operations takes place in a circular doubly linked list.
Write an appropriate algorithmic steps to perform insertion at end in
circular doubly linked list.
05
B)
CO2
Convert the following infix expression into postfix expression using
any of the known methods. Show all the intermediate steps in table
format.
(A - B) *(C – D) / (E + F) * ( G + H )
05
Q-3
Answer the following.
[10]
A)
CO1
The preorder traversing sequence of a Binary Search Tree (BST) is
given as { 18, 10, 5, 1, 7, 15, 30, 25, 35, 32, 38 }, construct the
binary tree from above sequence. Also give the postorder
traversing sequence of constructed binary tree.
05
B)
CO2
Construct an AVL Tree by inserting the elements in the below given
order :
99, 88, 77, 66, 55, 44, 33, 22, 10.
Show all the intermediate steps.
05
OR
B)
CO2
Construct Minimum Spanning Tree(MST) from below given graph
using Kruskal’s algorithm. Show all the intermediate steps
of MST construction.
05
