QUESTION No.

Course Title (with Sem and Couse Code) Topic Knowledge Level (BTL)

A KL1
1 Sem III - E2UC303B - DATA STRUCTURES
A KL1
2 Sem III - E2UC303B - DATA STRUCTURES
A KL1
3 Sem III - E2UC303B - DATA STRUCTURES
4 Sem III - E2UC303B - DATA STRUCTURES A KL1
A KL1
5 Sem III - E2UC303B - DATA STRUCTURES

A KL1
6 Sem III - E2UC303B - DATA STRUCTURES
A KL2
7 Sem III - E2UC303B - DATA STRUCTURES
8 Sem III - E2UC303B - DATA STRUCTURES A KL2
A KL2
9 Sem III - E2UC303B - DATA STRUCTURES
10 Sem III - E2UC303B - DATA STRUCTURES A KL1
11 Sem III - E2UC303B - DATA STRUCTURES A KL1
A KL1
12 Sem III - E2UC303B - DATA STRUCTURES
A KL3
13 Sem III - E2UC303B - DATA STRUCTURES
14 Sem III - E2UC303B - DATA STRUCTURES A KL3
15 Sem III - E2UC303B - DATA STRUCTURES A KL3
A KL4
16 Sem III - E2UC303B - DATA STRUCTURES
A KL4
17 Sem III - E2UC303B - DATA STRUCTURES
A KL4
18 Sem III - E2UC303B - DATA STRUCTURES
A KL2
19 Sem III - E2UC303B - DATA STRUCTURES
A KL2
20 Sem III - E2UC303B - DATA STRUCTURES

A KL2
21 Sem III - E2UC303B - DATA STRUCTURES
A KL5
22 Sem III - E2UC303B - DATA STRUCTURES
A KL5
23 Sem III - E2UC303B - DATA STRUCTURES
24 Sem III - E2UC303B - DATA STRUCTURES A KL5
A KL2
25 Sem III - E2UC303B - DATA STRUCTURES
 A KL2
26 Sem III - E2UC303B - DATA STRUCTURES

A KL2
27 Sem III - E2UC303B - DATA STRUCTURES
A KL3
28 Sem III - E2UC303B - DATA STRUCTURES

A KL3
29 Sem III - E2UC303B - DATA STRUCTURES
A KL3
30 Sem III - E2UC303B - DATA STRUCTURES
A KL6
31 Sem III - E2UC303B - DATA STRUCTURES
A KL6
32 Sem III - E2UC303B - DATA STRUCTURES
A KL6
33 Sem III - E2UC303B - DATA STRUCTURES

A KL4

34 Sem III - E2UC303B - DATA STRUCTURES

A KL4
35 Sem III - E2UC303B - DATA STRUCTURES
A KL4
36 Sem III - E2UC303B - DATA STRUCTURES
A KL3
37 Sem III - E2UC303B - DATA STRUCTURES
A KL3
38 Sem III - E2UC303B - DATA STRUCTURES
A KL3
39 Sem III - E2UC303B - DATA STRUCTURES

A KL5
40 Sem III - E2UC303B - DATA STRUCTURES

A KL5
41 Sem III - E2UC303B - DATA STRUCTURES
42 Sem III - E2UC303B - DATA STRUCTURES A KL5
A KL4
43 Sem III - E2UC303B - DATA STRUCTURES
A KL4
44 Sem III - E2UC303B - DATA STRUCTURES
 A KL4
45 Sem III - E2UC303B - DATA STRUCTURES
A KL6
46 Sem III - E2UC303B - DATA STRUCTURES
A KL6
47 Sem III - E2UC303B - DATA STRUCTURES

A KL6
48 Sem III - E2UC303B - DATA STRUCTURES

A KL5
49 Sem III - E2UC303B - DATA STRUCTURES
A KL5
50 Sem III - E2UC303B - DATA STRUCTURES
51 Sem III - E2UC303B - DATA STRUCTURES A KL5
A KL6
52 Sem III - E2UC303B - DATA STRUCTURES

A KL6
53 Sem III - E2UC303B - DATA STRUCTURES

A KL6
54 Sem III - E2UC303B - DATA STRUCTURES
Difficulty Level Max Marks CO Question Type Action Verb

DL1 1 CO3 DescriptiveQuestion

DL1 1 CO3 DescriptiveQuestion

DL1 1 CO3 DescriptiveQuestion

DL2 2 CO3 DescriptiveQuestion
DL2 2 CO3 DescriptiveQuestion

DL2 2 CO4 DescriptiveQuestion

DL1 2 CO3 DescriptiveQuestion

DL1 2 CO3 DescriptiveQuestion
DL1 2 CO3 DescriptiveQuestion
DL3 3 CO3 DescriptiveQuestion
DL3 3 CO3 DescriptiveQuestion
DL3 3 CO3 DescriptiveQuestion

DL1 3 CO4 DescriptiveQuestion

DL1 3 CO3 DescriptiveQuestion
DL1 3 CO3 DescriptiveQuestion
DL1 4 CO3 DescriptiveQuestion

DL1 4 CO3 DescriptiveQuestion

DL1 4 CO3 DescriptiveQuestion

DL2 4 CO3 DescriptiveQuestion

DL2 4 CO4 DescriptiveQuestion

DL2 4 CO3 DescriptiveQuestion

DL1 5 CO3 DescriptiveQuestion

DL1 5 CO3 DescriptiveQuestion

DL1 5 CO4 DescriptiveQuestion
DL3 6 CO3 DescriptiveQuestion
DL3 6 CO3 DescriptiveQuestion

DL3 6 CO3 DescriptiveQuestion

DL2 6 CO3 DescriptiveQuestion

DL2 6 CO4 DescriptiveQuestion

DL2 6 CO3 DescriptiveQuestion

DL1 6 CO3 DescriptiveQuestion

DL1 6 CO3 DescriptiveQuestion

DL1 6 CO4 DescriptiveQuestion

DL2 8 CO3 DescriptiveQuestion

DL2 8 CO3 DescriptiveQuestion

DL2 8 CO3 DescriptiveQuestion

DL3 9 CO3 DescriptiveQuestion

DL3 9 CO3 DescriptiveQuestion

DL3 9 CO4 DescriptiveQuestion

DL2 10 CO3 DescriptiveQuestion

DL2 10 CO3 DescriptiveQuestion

DL2 10 CO3 DescriptiveQuestion

DL3 12 CO3 DescriptiveQuestion

DL3 12 CO3 DescriptiveQuestion

DL3 12 CO4 DescriptiveQuestion

DL2 12 CO3 DescriptiveQuestion

DL2 12 CO4 DescriptiveQuestion

DL2 12 CO3 DescriptiveQuestion

DL3 15 CO3 DescriptiveQuestion

DL3 15 CO3 DescriptiveQuestion

DL3 15 CO3 DescriptiveQuestion
DL3 18 CO4 DescriptiveQuestion

DL3 18 CO4 DescriptiveQuestion

DL3 18 CO4 DescriptiveQuestion

*
 Question Text

If we apply Quick sort on sortted array then what will be the complexity.
If we need to insert a node at the end of the doubly linked list. How many
addresses need to be change.
In a binary tree with level n (n>=0). Then tree contains atmost _________
number of nodes.
Write a java method to implement PUSH operation in the Stack.
Construct an expression tree for the following algebraic expression: (a - b) /
((c * d) + e)
Write the condition for empty and full circular queue when implementing
using array.
In a complete binary tree if the number of nodes is 1000000. What will be
the height of complete binary tree.
Differentiate Strictly Binary Tree and Complete Binary Tree.
Construct a Binary Search Tree (BST) for the given elements:
15,22,30,10,64,1,3,9,2.
List the advantages of doubly linked list over single linked list.
What is the queue's limitation? How the issue is being fixed.
When would a double linked list be more advantageous than a single linked
list?
Write the Overflow and underflow conditions in a stack using an array.
Differentiate between array and linked list.
Differentiate between stack and queue.
What is difference between static and dynamic memory allocation.
Calculating minimum and maximum height from 221 number of nodes in a
binary tree.
Write an algorithm or java method to calculate the length of a singly linked
list.
Explain the addition of two polynomials using suitable example.
Write the Overflow and underflow conditions in a circular queue using an
array.
The height of a tree is the length of the longest root-to-leaf path in it.
Calculate the maximum and the minimum number of nodes in a binary tree
of height 5.
How to delete a node in binary search tree? Explain with the help of
example.
How the choice of pivot element effects the effciency of Quick sort
algorithm with suitable example.
Implement PUSH and POP operations in stack using array.
Write an algorithm or java method to concatinate two singly linked list.
Write an java method or algorithm to search a key in Binary Search Tree
(BST).
Initially, there are elements {A, R, E} in a stack and E is the Top element of
the stack. Do the following operations with suitable diagram, POP(),
PUSH{W}, POP(), POP(), PUSH{G}, POP().
Construct a Max-Heap for the given set of elements: 1, 22, 52, 57, 47, 61, 27,
12, 15, 9, 11. Show all the steps with a suitable diagram.
Initially, there are elements {B, P, Q, D} in a queue D is the front element and
B is the rear of the queue. Do the following operations with a suitable
diagram, DELETE(), DELETE(), DELETE(), DELETE(), INSERT(M), DELETE(),
DELETE().
Construct a BST for the given set of elements: 21, 32, 12, 65, 45, 67, 34, 2, 5,
9, 1, 10. Show all the steps with a suitable diagram.
Write a C program to delete a node from Kth position in singly linked list.
Convert the following infix expression into prefix expression using stack.
A*(B+D)/E-F*(G+H/K)
What is circular Queue? Write a pseudocode or method in java to insert an
element in circular queue?
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.
Discuss doubly linked list. Write an algorithm to insert a node after a given
node in singly linked list.
Write an algorithm for Merge Sort. Explains with the help of suitable
example.
Write an algorithm for Quick sort. Use Quick sort algorithm to sort the
following elements: 2, 8, 7, 1, 3, 5, 6, 4.
Write an algorithm to evaluate postfix expression also find the value of
7,5,2,-,*,4,1,5,-,/,+.
What is Stack? Write a algorithm or program for linked list implementation
of stack.
The keys 12, 17, 13, 2, 5, 43, 5 and 15 are inserted into an initially empty
hash table of length 15 using open addressing with hash function h(k) = k
mod 10 and linear probing. What is the resultant hash table?

What is Hashing? Explain division method to compute the hash function and
also explain the collision resolution strategies used in hashing.
Write an algorithm to reverse an integer number using stack.
Write an algorithm for Heap Sort. Use Heap sort algorithm, sort the
following sequence: 18, 25, 45, 34, 36, 51, 43, and 24.
Write a program in java or algorithm to reverse a singly linked list.
From the given preorder traversal of BST, print its postorder traversal. Input
: 40 30 32 35 80 90 100 120.
Write an algorithm or java method to insert a node at the end in a Doubly
Circular linked list.
Implement the Java method for inserting, deleting, and displaying circular
queues by using an array.
Write an algorithm to convert an infix expression to a prefix expression.
Also, convert the given infix expression to a prefix expression. (A – B/C) *
(A/K-L).
Write an algorithm for converting infix expression into postfix expression.
Convert following infix expression into its equivalent postfix expression:
A + ( B * C – ( D / E ^ F) * G ) * H
Write short notes on the following: (i) Priority Queue. (ii) Threaded Binary
tree. (iii) Representation of Graph in memory
Write a java program to implement a circular linked list.
Define Double ended queue with suitable example. Implement the double
ended queue.
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.
Design a method for keeping two stacks within a single linear array so that
neither stack overflow until all the memory is used.
 Linked
Model Answer/ Answer Key Image/Equat Option Count Option 1 Option 2 Option 3
ion/table
No

No

No
No
No

No

No
No
No
No
No
No

No
No
No
No

No

No

No

No

No

No

No
No
No
No

No

No

No

No

No

No

No

No

No

No

No

No

No

No

No

No
No

No
No

No

No

No

No

No
No
No

No

No
Option 4
Course Title (with Sem and Couse Code) (All)

Row Labels Count of Course Title (with Sem and Couse Code)
1 6
3 12
4 12
5 6
2 12
6 18
9 6
8 6
12 12
10 6
15 6
18 6
Grand Total 108

Count of Course Title (with Sem and Couse

Column
Code)Labels
Row Labels DL1
KL1 6
KL2 6
KL4 6
KL5 6
KL3 6
KL6 6
Grand Total 36
DL2 DL3 Grand Total
6 6 18
6 6 18
6 6 18
6 6 18
6 6 18
6 6 18
36 36 108