lOMoARcPSD|50958543

Data structure 2017 - 2024 PYQ AKtu

data structure (Dr. A.P.J. Abdul Kalam Technical University)

Scan to open on Studocu

Studocu is not sponsored or endorsed by any college or university

Downloaded by Hitesh Bajpai (2k23.it1a.2313702@gmail.com)
 lOMoARcPSD|50958543

Printed Pages: 02 Sub Code: RCS305

Paper ID: 1 0 0 4 Roll No.

B TECH
(SEM III) THEORY EXAMINATION 2017-18
DATA STRUCTURES
Time: 3Hours Max. Marks: 70
Note: Attempt all Sections. Assume missing data, if any.
SECTION A
1. Attempt all questions in brief: 2 x 7 = 14
a. Define the term Data Structure. List some linear and non-linear data
structures stating the application area where they will be used.
b. Discuss the concept of "successor" and “predecessor” in Binary Search
Tree.
c. Convert the following arithmetic infix expression into its equivalent postfix
expression.
Expression: A-B/C+D*E+F
d. Explain circular queue. What is the condition if circular queue is full?
e. Calculate total number of moves for Tower of Hanoi for n=10 disks.
f. List the different types of representation of graphs.
g. Explain height balanced tree. List general cases to maintain the height.
SECTION B

2. Attempt any three of the following: 7 x 3 = 21

a. What do you understand by time space trade off? Explain best, worst and average case
analysis in this respect with an example
b. Use quick sort algorithm to sort 15,22,30,10,15,64,1,3,9,2. Is it a stable sorting
algorithm? – Justify.
c. Define spanning tree. Also construct minimum spanning tree using prim’s algorithm for
the given graph.

d. Define tree, binary tree, complete binary tree and full binary tree. Write algorithms or
function to obtain traversals of a binary tree in preorder, postorder and inorder.
e. Construct a B-tree on following sequence of inputs.
10, 20, 30, 40, 50, 60, 70, 80, 90
Assume that the order of the B-tree is 3.

SECTION C

3. Attempt any one part of the following: 7x1=7

(a) What are the various asymptotic notations? Explain Big O notation.
(b) Write an algorithm to insert a node at the end in a Circular linked list.

1|Page

Downloaded by Hitesh Bajpai (2k23.it1a.2313702@gmail.com)

 lOMoARcPSD|50958543

4. Attempt any one part of the following: 7x1=7

(a)What is a Stack .Write a C program to reverse a string using stack.

(b)Define the recursion. Write a recursive and non recursive program to calculate
the factorial of the given number.

5. Attempt any one part of the following: 7x1=7

(a) Draw a binary tree with following traversals:

Inorder: B C A E G D H F I J
Preorder: A B C D E G F H I J
(b) Consider the following AVL Tree and insert 2, 12, 7and 10 as new node. Show
proper rotation to maintain the tree as AVL.

6. Attempt any one part of the following: 7x1=7

(a)What is a Threaded Binary Tree? Explain the advantages of using a threaded

binary tree.
(b)Describe Dijkstra’s algorithm for finding shortest path. Describe its working for
the graph given below.

7. Attempt any one part of the following: 7x1=7

(a)Write short notes on:
i. Hashing Technique
ii. Garbage collection
(b)Explain the following:
i. Heap Sort
ii. Radix Sort.

2|Page

Downloaded by Hitesh Bajpai (2k23.it1a.2313702@gmail.com)

 lOMoARcPSD|50958543

Downloaded by Hitesh Bajpai (2k23.it1a.2313702@gmail.com)

 lOMoARcPSD|50958543

Downloaded by Hitesh Bajpai (2k23.it1a.2313702@gmail.com)

 lOMoARcPSD|50958543

Downloaded by Hitesh Bajpai (2k23.it1a.2313702@gmail.com)

 lOMoARcPSD|50958543

Downloaded by Hitesh Bajpai (2k23.it1a.2313702@gmail.com)

 lOMoARcPSD|50958543

Printed Page: 1 of 2
Subject Code: KCS301
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

B. TECH
(SEM III) THEORY EXAMINATION 2020-21
DATA STRUCTURES
Time: 3 Hours Total Marks: 100
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.

SECTION A

1. Attempt all questions in brief. 2 x 10 = 20

Q no. Question Marks CO
a. Define Time-Space trade-off. 2 1
b. Differentiate Array and Linked list. 2 1
c. Explain Tail Recursion with suitable example. 2 2
d. Write the full and empty condition for a circular queue data structure. 2 2
e. Examine the minimum number of interchanges needed to convert the 2 3
array 90, 20, 41,18, 13, 11, 3, 6, 8,12, 7, 71, 99 into a maximum heap.
f. Differentiate sequential search and binary search. 2 3
g. Compute the Transitive closure of following graph. 2 4

P
0Q

1
13
h. Write short notes on adjacency multi list representation a Graph. 2 4
29

i. What is the importance of threaded binary tree? 2 5

2.
0E

j. Write short notes on min heap. 2 5

24
P2

5.
_Q

.5
SECTION B 17
TU

2. Attempt any three of the following:

|1

Q no. Question Marks CO

AK

16

a. Consider a multi-dimensional Array A[90] [30] [40] with base address 10 1

starts at 1000. Calculate the address of A[10] [20] [30] in row major
2:

order and column major order. Assume the first element is stored
:4

at A[2][2][2] and each element take 2 byte.

13

b. Evaluate the following postfix expression using stack. 10 2

2 3 9 * + 2 3 ^ - 6 2 / + , show the contents of each and every steps. also
1
02

find the equivalent prefix form of above expression. Where ^ is an

-2

exponent operator.
ar

c. Explain any three commonly used hash function with the suitable 10 3
example? A hash function H defined as H(key) =key%7, with linear
M

probing, is used to insert the key 37,38,72,48,98,11,66 into a table

2-

indexed from 0 to 6. what will be the location of key 11? Justify your
|2

answer, also count the total number of collisions in this probing.

d. Write an algorithm for Breadth First search (BFS) and explain with the 10 4
help of suitable example.
e. If the in order of a binary tree is B,I,D,A,C,G,E,H,F and its post order is 10 5
I,D,B,G,C H,F,E,A then draw a corresponding binary tree with neat and
clear steps from above assumption.

1|Page
AKTU_QP20E290QP | 22-Mar-2021 13:42:16 | 117.55.242.131
Downloaded by Hitesh Bajpai (2k23.it1a.2313702@gmail.com)
 lOMoARcPSD|50958543

Printed Page: 2 of 2
Subject Code: KCS301
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

SECTION C
3. Attempt any one part of the following:
Q no. Question Marks CO
a. Consider the two dimensional lower triangular matrix (LTM) of order 10 1
N ,Obtain the formula for address calculation in the address of row
major and column major order for location LTM[j][k], if base address
is BA and space occupied by each element is w byte.
b. Write a C program to insert a node at kth position in single linked list. 10 1

4. Attempt any one part of the following:

Q no. Question Marks CO
a. Convert the following infix expression to reverse polish notation 10 2
expression using stack.
𝑏 √𝑏 4𝑎𝑐
𝑥
2𝑎

b. Write a C program to implement stack using single linked list. 10 2

P
0Q
5. Attempt any one part of the following:

1
13
29

Q no. Question Marks CO

2.
a. Write an algorithm for merge sort and apply on following elements 10 3
0E

24
45,32,65,76,23,12,54,67,22,87.
P2

b. Write a C program for Index Sequential Search. 10 3

5.
_Q

.5
17
6. Attempt any one part of the following:
TU

|1

Q no. Question Marks CO

AK

a. Describe Prim`s algorithm and find the cost of minimum spanning tree 10 4
16

using Prim`s Algorithm.

2:
:4
13
1
02

b. Apply the Floyd warshall’s algorithm in above mentioned graph 10 4

-2

(i.e. in Q.no 6a)

ar
M

7. Attempt any one part of the following:

2-
|2

Q no. Question Marks CO

a. Write Short notes of following 10 5
(a) Extended Binary Trees (b) Complete Binary Tree
(c) Threaded Binary Tree.
b. Insert the following sequence of elements into an AVL tree, starting 10 5
with empty tree 71,41,91,56,60,30,40,80,50,55 also find the minimum
array size to represent this tree.

2|Page
AKTU_QP20E290QP | 22-Mar-2021 13:42:16 | 117.55.242.131
Downloaded by Hitesh Bajpai (2k23.it1a.2313702@gmail.com)
 lOMoARcPSD|50958543

Printed Page: 1 of 2
Subject Code: KCS301
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

BTECH
(SEM III) THEORY EXAMINATION 2021-22
DATA STRUCTURE

Time: 3 Hours Total Marks: 100

Note: Attempt all Sections. If you require any missing data, then choose suitably.
SECTION A
1. Attempt all questions in brief. 2X10 = 20
Q No Questions CO
(a) Convert the infix expression (A+B) *(C-D) $E*F to postfix. Give the answer 1
without any spaces.
(b) Rank the following typical bounds in increasing order of growth rate: 2
O(log n), O(n4), O(1), O(n2 log n)
(c) Draw the binary search tree that results from inserting the following numbers in 3
sequence starting with 11: 11, 47, 81, 9, 61, 10, 12,
(d) What does the following recursive function do for a given Linked List with first 4
node as head?
void fun1(struct node* head)
{
if(head == NULL)
return;
fun1(head->next);
printf("%d ", head->data);
}
(e) Define a sparse matrix. Suggest a space efficient representation for space matrices. 5

1
(f) List the advantages of doubly linked list over single linked list. 1

13
0
29

(g) Give example of one each stable and unstable sorting techniques. 2

2.
(h) Write advantages of AVL tree over Binary Search Tree (BST) 3
2_

24
(i) What is tail recursion? Explain with a suitable example. 4
2P

5.
(j) Write different representations of graphs in the memory. 5

.5
P2

SECTION B 17
2. Attempt any three of the following: 10X3 = 30
Q

Q No Questions CO
|1

(a) Write advantages and disadvantages of linked list over arrays. Write a 'C' function 1
creating new linear linked list by selecting alternate elements of a linear linked list.
49

(b) Write algorithms of insertion sort. Implement the same on the following numbers; 2
8:

also calculate its time complexity. 13, 16, 10, 11, 4, 12, 6, 7
(c) Differentiate between DFS and BFS. Draw the breadth First Tree for the above 3
:2

graph.
13
2
02
-2
ar
M
9-

(d) Differentiate between liner and binary search algorithm. Write a recursive function 4
to implement binary search.
|2

(e) What is the significance of maintaining threads in Binary Search Tree? Write an 5
algorithm to insert a node in thread binary tree.

SECTION C
3. Attempt any one part of the following: 10X1 = 10
Q No Questions CO
(a) Suppose a three dimensional array A is declared using A[1:10, -5:5, -10:5) 1
(i) Find the length of each dimension and the number of elements in A
(ii) Explain Row major order and Column Major Order in detail with explanation
formula expression.

QP22P2_290 | 29-Mar-2022 13:28:49 | 117.55.242.131

Downloaded by Hitesh Bajpai (2k23.it1a.2313702@gmail.com)
 lOMoARcPSD|50958543

Printed Page: 2 of 2
Subject Code: KCS301
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

BTECH
(SEM III) THEORY EXAMINATION 2021-22
DATA STRUCTURE

(b) Discuss the representation of polynomial of single variable using linked list. Write 1
'C' functions to add two such polynomials represented by linked list.
4. Attempt any one part of the following: 10 X1 = 10
Q No Questions CO
(a) (i) Use the merge sort algorithm to sort the following elements in ascending order. 2
13, 16, 10, 11, 4, 12, 6, 7.
What is the time and space complexity of merge sort?
(ii) Use quick sort algorithm to sort 15,22,30,10,15,64,1,3,9,2. Is it a stable sorting
algorithm? Justify.
(b) (i) The keys 12, 17, 13, 2, 5, 43, 5 and 15 are inserted into an initially empty hash 2
table of length 15 using open addressing with hash function h(k) = k mod 10 and
linear probing. What is the resultant hash table?
(ii) Differentiae between linear and quadratic probing techniques.
5. Attempt any one part of the following: 10X1 = 10
Q No Questions CO
(a) Use Dijkstra’s algorithm to find the shortest paths from source to all other vertices in 3
the following graph.

1
13
0
29

2.
2_

24
2P

5.
(b) Apply Prim’s algorithm to find a minimum spanning tree in the following weighted 3

.5
graph as shown below.
P2

17
Q

|1
49
8:
:2
13

6. Attempt any one part of the following: 10X1 = 10

2

Q No Questions CO
02

(a) (i) Write an iterative function to search a key in Binary Search Tree (BST). 4
-2

(ii) Discuss disadvantages of recursion with some suitable example.

(b) (i) What is Recursion? 4
ar

(ii)Write a C program to calculate factorial of number using recursive and non-

M

recursive functions.
9-

7. Attempt any one part of the following: 10X1 = 10

Q No Questions CO
|2

(a) (i) Why does time complexity of search operation in B-Tree is better than Binary 5
Search Tree (BST)?
(ii) Insert the following keys into an initially empty B-tree of order 5
a, g, f, b, k, d, h, m, j, e, s, i, r, x, c, l, n, t, u, p
(iii) What will be the resultant B-Tree after deleting keys j, t and d in sequence?
(b) (i) Design a method for keeping two stacks within a single linear array so that 5
neither stack overflow until all the memory is used.
(ii) Write a C program to reverse a string using stack.

QP22P2_290 | 29-Mar-2022 13:28:49 | 117.55.242.131

Downloaded by Hitesh Bajpai (2k23.it1a.2313702@gmail.com)
 lOMoARcPSD|50958543

Printed Pages: 2 Sub Code: KCS- 301

Paper Id: 233380 Roll No.

B. TECH.
(SEM III) THEORY EXAMINATION 2022-23
DATA STRUCTURE
Time: 3 Hours Total Marks: 100
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.
SECTION A

1. Attempt all questions in brief. 2 x 10 = 20

(a) Define best case, average case and worst case for analyzing the complexity of a
program.
(b) Differentiate between binary search tree and a heap.
(c) Write the condition for empty and full circular queue.
(d) What do you understand by tail recursion?
(e) Construct an expression tree for the following algebraic expression:
(a - b) / ((c * d) + e)
(f) Differentiate between internal sorting and external sorting.
(g) What are the advantages and disadvantages of array over linked list?
(h) Write an algorithm for Breadth First Search (BFS) traversal of a graph.
(i) In a complete binary tree if the number of nodes is 1000000. What will be the height

2
90
of complete binary tree.

13
(j) Which data structure is used to perform recursion and why?
_2

2.
SECTION B
P2

24
2. Attempt any three of the following: 10x3=30

5.
3D

(a) Assume that the declaration of multi-dimensional arrays X and Y to be,

.5
P2

X (-2:2, 2:22) and Y (1:8, -5:5, -10:5)

(i) Find the length of each dimension and number of elements in X and Y. 17
Q

|1
(ii) Find the address of element Y (2, 2, 3), assuming Base address of Y = 400
and each element occupies 4 memory locations.
6
:3

(b) What is Stack? Write a C program for linked list implementation of stack.
9

(c) Write an algorithm for Quick sort. Use Quick sort algorithm to sort the following
:2

elements: 2, 8, 7, 1, 3, 5, 6, 4
13

(d) Write the Dijkstra algorithm for shortest path in a graph and also find the shortest path
from ‘S’ to all remaining vertices of graph in the following graph:
3
02
-2
03
7-
|2

(e) The order of nodes of a binary tree in inorder and postorder traversal are as follows:
In order : B, I, D, A, C, G, E, H, F.
Post order: I, D, B, G, C, H, F, E, A.
(i) Draw the corresponding binary tree.
(ii) Write the pre order traversal of the same tree.

QP23DP2_290 | 27-03-2023 13:29:36 | 117.55.242.132

Downloaded by Hitesh Bajpai (2k23.it1a.2313702@gmail.com)
 lOMoARcPSD|50958543

SECTION C
3. Attempt any one part of the following: 10x1=10
(a) How to represent the polynomial using linked list ? Write a C program to add two
polynomials using linked list.
(b) Discuss doubly linked list. Write an algorithm to insert a node after a given node
in singly linked list.
4. Attempt any one part of the following: 10x1=10
(a) Write an algorithm for converting infix expression into postfix expression. Trace
your algorithm for infix expression Q into its equivalent postfix expression P,
Q: A + ( B * C – ( D / E ^ F) * G ) * H
(b) What is circular Queue? Write a C code to insert an element in circular queue?
5. Attempt any one part of the following: 10x1=10
(a) What is Hashing? Explain division method to compute the hash function and also
explain the collision resolution strategies used in hashing.
(b) Write an algorithm for Heap Sort. Use Heap sort algorithm, sort the following
sequence:
18, 25, 45, 34, 36, 51, 43, and 24.
6. Attempt any one part of the following: 10x1=10
(a) What is spanning tree? Write down the Prim’s algorithm to obtain minimum cost

2
90
spanning tree. Use Prim’s algorithm to find the minimum cost spanning tree

13
in the following graph:
_2

2.
P2

24
5.
3D

.5
P2

17
Q

|1

(b) Write and explain the Floyd Warshall algorithm to find the all pair shortest path. Use the
6

Floyd Warshall algorithm to find shortest path among all the

:3

vertices in the given graph:

9
:2
13
3
02
-2
03
7-
|2

7. Attempt any one part of the following: 10x1=10

(a) Discuss left skewed and right skewed binary tree. Construct an AVL tree by
inserting the following elements in the order of their occurrence:
60, 2, 14, 22, 13, 111, 92, 86.
(b) What is B-Tree? Write the various properties of B- Tree. Show the results of
inserting the keys F, S, Q, K ,C, L, H, T, V, W, M, R, N, P, A, B in order into a
empty B-Tree of order 5.

QP23DP2_290 | 27-03-2023 13:29:36 | 117.55.242.132

Downloaded by Hitesh Bajpai (2k23.it1a.2313702@gmail.com)
 Printed Page: 1 of 2
lOMoARcPSD|50958543

Subject Code: BCS301

0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

BTECH
(SEM III) THEORY EXAMINATION 2023-24
DATA STRUCTURE
TIME: 3HRS M.MARKS: 70

Note: 1. Attempt all Sections. If require any missing data; then choose suitably.
SECTION A

1. Attempt all questions in brief. 2 x 7 = 14

Q no. Question Marks CO
a. What are the various asymptotic notations? 2 1
b. Why are parentheses needed to specify the order of operations in infix 2 2
expressions but not in postfix operations?
c. How the choice of pivot element effects the running time of quick sort 2 3
algorithm?
d. What are the 2 different forms of hashing? 2 3
e. What is the significance of binary tree in Huffman algorithm? 2 4
f. What is the number of edges in a regular graph of degree d and n vertices. 2 5
g. Write an algorithm to obtain the connected components of a graph. 2 5
SECTION B

2. Attempt any three of the following: 7 x 3 = 21

90

2
13
a. Write a Pseudo code that will concatenate two linked lists. Function should 7 1
_2

2.
have two parameters, pointers to the beginning of the lists and the function
P2

should link second list at the end of the first list.

24
b. Write an algorithm to convert a valid arithmetic infix expression into an 7 2
4D

5.
equivalent postfix expression. Trace your algorithm for following infix
.5
P2

expression.
17
A+B*C-D/F
Q

|1

c. What are the disadvantages of linear probing in hashing? Discuss how 7 3

quadratic probing can be used to solve some of these problems.
56

d. Write C function for non-recursive post order traversal. 7 4

0:

e. Consider the following graph and using Dijkstra Algorithm find the shortest 7 5
path.
:2
13
4
02
-2
03
6-
|1

SECTION C
3. Attempt any one part of the following: 7x1=7
a. Each element of an array Data [20][50] requires 4 bytes of storage. Base 7 1
address of Data is 2000. Determine the location of Data [10][10] when the
array is stored as:
(i) Row major
(ii) Column major

1|Page
QP24DP2_290 | 16-03-2024 13:20:56 | 117.55.242.132
Downloaded by Hitesh Bajpai (2k23.it1a.2313702@gmail.com)
 Printed Page: 2 of 2
lOMoARcPSD|50958543

Subject Code: BCS301

0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

BTECH
(SEM III) THEORY EXAMINATION 2023-24
DATA STRUCTURE
TIME: 3HRS M.MARKS: 70

b. How will you create link list representation of a polynomial. Explain it with 7 1
the suitable example.
4. Attempt any one part of the following: 7x1=7
a. Write an algorithm to evaluate an arithmetic expression using stack and show 7 2
how the expression 3*(5-3) will be evaluate.
b. A double ended Queue (deque) is a linear list in which additions may be made 7 2
at either end. Obtain a data representation mapping a deque into one
dimensional array. Write C function to add and delete elements from either
end of deque.
5. Attempt any one part of the following: 7x1=7
a. Write a C program for sorting 100 integer numbers wring selection sort 7 3
procedure. Discuss the worst-case time complexity of the algorithms.
b. Write a program in C language to implement binary search algorithm. Also 7 3
discuss the average behavior of the algorithm.
6. Attempt any one part of the following: 7x1=7
a. If E and I denotes the external and internal path length of a binary tree having 7 4
90

2
13
n internal nodes then show that E=I+2n.
_2

b. Suppose character a, b, c, d,e,f has probabilities 0.07, 0.09, 0.12, 0.22, 0.23, 7 4

2.
P2

0.27 respectively. Find an optional Huffman code and draw the Huffman tree.

24
What is the average code length?
4D

5.
7. Attempt any one part of the following: 7x1=7
.5
P2

a. Find the minimum spanning tree using Prim’s algorithm for the graph shown 7 5
17
below: -
Q

|1
56
0:
:2
13
4
02

b. Write a program in C language to compute the indegree and outdegree of 7 5

-2

every vertex of a directed graph when the graph is represented by an

03

adjacency matrix.
6-
|1

2|Page
QP24DP2_290 | 16-03-2024 13:20:56 | 117.55.242.132
Downloaded by Hitesh Bajpai (2k23.it1a.2313702@gmail.com)