Registration No :
-- 2
Total Number of Pages : 04
02 3 Course: BTECH
REC4G002, RAE4G003, RAU4G003,
8/ 2 RME4G003, RMF4G003, RML4G003,
2 1 /0 RMM4G003, RMN4G003, RPL4G003
0
th
9 -
4 Semester Regular / Back Examination: 2022-23
1 SUBJECT: Data Structure
BRANCH(S): ECE,ETC, AERO,AME, AUTO, MECH, MANUTECH, MINERAL, MME,METTA,
MINING, PLASTIC
- - 2
Time : 3 Hour
2 0 23
Max Marks : 100
Q.Code : M413
08 /
Answer Question No.1 (Part-1) which is compulsory, any eight from Part-II and any two
2 1 / from Part-III.
10 9-
The figures in the right hand margin indicate marks.
2
Part-I
3 - -
Q1 Answer the following questions:
0 2
2 data structure.
Differentiate between nonlinear data structure and /linear
(2x10)
a)
b) 0 8
Write overflow and underflow conditions of /stack.
c) List out the advantages of doubly linked2 1
-elements 1 → 2 → 3 → 4 → 5. Start pointer
lists over single linked lists with examples.
d) 0
Consider a Single Linked List having
1 9
holds the address of first node 1. What is the output of the following function?
void sum( ){
-- 2
struct node *P = start → next;
2
int total = 0;
0 3
{
0 8 /2
while ( P→ next ! = NULL)
21 /
total = total + P → info;
0 9 - P = P → next; }
1 printf( “ Total = %d”, total); }
-- 2
e)
2 3
Define a complete binary tree and strictly binary tree with suitable example.
f)
2 3 --2 / 2 0
Write the limitations of array implementation of simple queue. How it can be
avoided?
20 /0 8
0
g)
8 / - 2 1
Differentiate between strongly connected graph and weakly connected graph.
- 21/ h)
109
Consider an open address hash table with a total of 10000 slots, containing of 9800
entries .What is the expected number of probes in a successful search?
10 9 i) Differentiate linear probing and quadratic probing technique to resolve collision in
hashing.
j) Sort the given elements in ascending order using bubble sort –
2, 1, 4, 0, 7, 3
Part-II
Q2 Only Focused-Short Answer Type Questions-
-- 2 (Answer Any Eight out of (6 × 8)
Twelve)
2 3
0deletion and display operation in a circular
a) /
Discuss the algorithm for insertion,
8 2
queue.
1 / 0
9
Develop a C-function - 2
to merge two single lists having the following elements. Start
b)
1
holds the address0of first node of List 1 and head holds the address of first node of
List 2.
List 1: 10 → 15 → 22 → 46 → 17 → 39
- - 2
List 2: 23 → 12 → 42 → 36 → 41
c) 0 23
Construct an AVL tree from the list of given elements:
2
/
55, 66, 77, 15, 11, 33, 22, 35, 25, 44, 88.
08
2 1 /
d) Discuss height and depth of a binary tree. Construct a binary search tree from these
9 -
10 90, 36, 58, 96, 32, 92, 12, 93, 24, 97, 38, 60 and 98 --2
numbers:
3 and Breadth First
e) Discuss the data structures used for Depth First Search2(DFS)
0
Search (BFS) algorithm on a Graph data structure. 2Perform the Depth First Search
for the following graph, starting from node B. 8
0 /
2 1 /
9 -
10
-- 2
0 2 3
8 / 2
f) Define path matrix.21
/0 the following graph in memory using array and
Represent
9 -
linked list representation.
0
1 -- 2
- 2 02 3
2 3 - / 2
2 0 /0 8
0 8 / - 2 1
2 1 / 0 9
9 - 1
10
g) List out the properties of Max-Heap and Min-Heap. Sort the following list of
numbers in descending order using Heap sort.
77, 85, 5, 7, 10, 72, 50, 21
h) Let A is the array of the following elements A = {2, 4, 6, 8, 9, 10, 12, 13}. Search
the element 12 using binary search technique. Write its time complexity.
3 --2
i)
2 02of the ofarrayquickeverysort?pass:Apply Quick sort on
Discuss the advantage and average efficiency
0
48, 7, 26, 4, 13, 23, 98, 57, 10, 5,
/
the following data and show the contents
8 32
2 1 /
9
perform the preorder, -inorder and postorder traversal for the following tree:
10
j)
- - 2
2 0 23
08 /
2 1 /
10 9- 2
--
3 and end of a single
k)
2 02
Write an algorithm / C code to delete a node from the beginning
link list.
0 8 /
Given N set of integers. Write a program 1in /C to arrange them in descending order
l)
using insertion sort techniques 9 - 2
10
Part-III
- - 2
0 2 3
Only Long Answer Type Questions (Answer Any Two out of Four)
Q3 8
Write the algorithm for infix / 2to postfix expression conversion. Convert the (8+8)
1 / 0 in infix form into its equivalent postfix form using
following expression written
- 2 step.
stack by showing each
9
0
Infix: K + (1L * M - ( N / O $ P ) * Q ) * R - - 2
- 2 0 2 3
2 3 - / 2 different collision
Q4 Discuss
2 / 8
the concept of collision in Hashing technique. List
0 techniques. Consider a list of size 20 (m =120). out
0 Insert the following list (2+6
0 /resolution
8 of keys given below into the Hash table and9-2resolve collision using various +4+4)
2 /
1 collision resolution techniques. Take the hash 0function of your choice.
9 - 1
10 96, 48, 63, 29, 87, 77, 48, 66, 69, 93, 61
Q5 What do you mean by graph traversal? What are the data structures used for graph (2+2
-- 2
traversal? Write the algorithm for DFS and Perform the Depth First Search of the +6+6)
graph by using DFS and BFS. 02 3
graph given below where M is the starting node. Generate the spanning tree of the
8/ 2
2 1 /0
09 -
1
- - 2
Discuss height and depth2 of3a binary tree. Construct a binary search tree from these
Q6
0
/296, 32, 92, 12, 93, 24, 97, 38, 60, and 98. Delete the root node
numbers: 90, 36, 58,
(3+7+6)
from this tree. 08
2 1 /
9 -
10 - - 2
0 2 3
8 / 2
1 /0
9 - 2
10
- - 2
0 2 3
8 / 2
1 / 0
9 - 2
10 3 - - 2
- - 2 2 0 2
0 2 3 8 /
/ 2 1 / 0
/ 0 8 9 - 2
- 2 1 1 0
109
