22ALRIHO

KONGUENGINEERING COLLEGE, PERUNDURAI 638 060

CONTINUOUS ASSESSMENT TEST I
(Regulations 2022)
Month and Year : May 2023 RollNumber:
Programme : B.Tech Date : 20.05.2023
Branch : AI-ML& AI-DS Time :9 am to 10.30 am
Semester Second
Course Code :22ADC21 Duration :1.30 Hours
Course Name : DATA STRUCTURES Max. Marks :50

PART - A (10 x 2 = 20 Marks)

ANSWER ALL THE QUESTIONS
1. |List the types of linked list [CO1] (K1]
2. |Mention the advantages of linked list over array. (CO1 [K2]
3. Draw asingly linked list and show its appropriate data and address. [CO1] [K1]
4. Write a program to get 3 elements in an array and display it [CO1][K2]
5. Recall any four applications of queue. [CO2] [K1]
6. Check the given expression is balanced or not using stack: (({)) [CO2] [K2]
7. How will you check the overflow and underflow conditions of queue? [C02] (K2]
8. Declare a node using structure for implementing stack using linked list. [CO2][K2]
9. How will you implement queue using stack? [CO2] [K2]
10. Write the algorithm to perform Dequeue operation in a queue using linked list| [C02) (K2)
implementation.
Part- B (3 x 10 = 30 Marks)
ANSWER ANY THREE QUESTIONS
11. LImplement the singly linked list to performthe following operations and write (10) (CO1] [K3)
the sample output.
Insert at beginning
Delete at middle
" Display the list
12. Implement LIFO and its operations using array. (10) [C02)[K3)

13. i) Convert the given expresion to postfix using stack: B+C-{[XIS *M] +L} (5) (CO2] (K3)
ii)Evaluate the postfix expression using stack: 5 10 73+8* +3 +* 5 +. (5) [CO2) [(K3]
14. ldentify the data structure of Queue in which last node will directly (10) (CO2]|(K2)
communicate with first node and describe its algorithm with an example.
Bloom'e Remenbering Understanding Applying Analysing Evaluating Creating
Taxonomy Level (K1) (K2) (K3) (K4) (K6) (K6)

Percentage 10 40 50
 22ALR}D

KONGU ENGINEERING COLLEGE, PERUNDURAI 638 060

CONTINUOUS ASSESSMENT TEST 2
(Regulations 2022)
Month and Year: June 2023 Roll Number:
Programme : B.Tech Date : 23.06.2023
Branch : AI-ML & AI-DS Time : 09.00 10.30 AM
Semester :2
Course Code : 22ADC21 Duration :1.30 Hours
Course Name: DATA STRUCTURES Max. Marks : 50

PART- A (10 x 2 = 20 Marks)

ANSWER ALL THE QUESTIONS
1. Compare singly linked list and doubly linked list. [CO1] (K2)
2 Recall the applications of linked list. (CO1] (K1]
Why circular linked list does not contain null in the next pointer of last node. Justify.
[CO1]|[(K2]
4.
How will you declare a node using structure for acircular doubly linked list? [CO1] (K1]
5 Calculate the degree, level, ancestor and sibling for the node 10 in the following binary [Co3] [K3]
tree.
5

10 15

20 25 30 35

45

6 Write the advantages of binary search tree ver s: * tree. Give an example [CO3] [K2]
7. Define full binary tree with suitable example. [CO3][K2]
8 Write the preorder and postorder traversal for the below binary tree. [CO3]K3]

8
9 Specify the types of rotations in AVL tre. [CO3] [K1]
10. What do you mean by balance factor of a node in AVL tree? [CO3][K1]
Part - B (3 × 10 = 30 Marks)
ANSWER ANYTHREE QUESTIONS
11.
Implement a doubly linked list to perform the following operations and write|(10) [CO1) |[K3
the sample output.
a. Insertion at begin
b. Delete at middle
C. Display the list
12. |Write routines to perform the following operations in a binary search tree. (10) [CO03] [K2]
a. Insertion
b. Inorder Traversal
c. Find Max
13. i) Construct the expression tree for given infix expression. (5) [CO3](K3]
a*bte/m*k-ylz
ii)Construct a binary tree from the given sequence and traverse the tree in (5) [CO3] [K3]
preorder:
Postorder:9,1,2, 12,7,5,3, 11,4,8
Inorder: 9,5,1,7,2,12,8,4,3,11
14. Construct an AVL tree with the following elements. (10) [CO3] (K3]
|2,5,4,6,7,9,8,3,1, 10. Delete 10,2 and 1.

Bloom's Remembering Understanding Applying Analysing Evaluating Creating

Taxonomy Level (K1) (K2) (K3) (K4) (K5) (K6)
Percentage 13.3% 30% 56.6%

2
 22 ALRIIO
KONGU ENGINEERING COLLEGE, PERUNDURAI 638 060
CONTINUOUS ASSESSMENT TEST II
(Regulations 2022)
Month and Year: August 2023 Roll Number:
Programme : B.Tech Date : 07.08.2023
Branch : AI-MIL & AI-DS Time : 09.00 - 10.30 AM
Semester :2
Course Code :22ADC21 Duration : 1.30 Hours
Course Name : Data Structures Max. Marks :50
PART- A (10 x 2 = 20 Marks)
ANSWER ALL THE QUESTIONS
1 Define strongly connected graph with an example.
[C04] [K1]
2. Compare Breadth First Search and Depth First Search. [C04] [K2]
3. Write the adjacency matrix for the given undirected graph
[C04] [K2]

4. Identify whether the below graph is bipartite or not? Justify.

[CO4] [K2]
a

5. Find the Euler's cycle for the given graph.

[C04] | [K2]

6. Write the routine for linear search.

[CO5] [K2]
7. Sort the values using Bubble sort.
|15,16,6,8,5 [CO5]|[K3]
8. Write the collision resolution formula for linear
probing. [CO5]|(K1]
9. Identify the drawback of quadratic probing.
[CO5]| [K2]
10. |Mention the advantages of using extendible hashing over rehashing. (CO5]| [K2]
Part - B (3 × 10 = 30 Marks)
ANSWER ANY THREE QUESTIONS
11, |Perform BFS and DFS for the following graph and consider 0 as the source (10) [CO4] [K3]
vertex.

12.
Find the articulation point for the given undirected graph by considering (5) [CO4]| [K3]
source node as 0.

1)Find the strongly connectedcomponents from the below graph. (5) [C04]| [K3]

13. i) Perform shell sort for the following elemer:s. (5) [CO5]| [K3]
35,33,42,10,14, 19,27,44
i)Write a program to perform binary searci: (5) [C05][K2]
14. Suppose a set of numbers = (3, 2, 9, 6, 11, 13,7, 12} is stored into an initially (10) [CO5] [K3]
empty hash table of size 10. Now, assume that a hash function His defined
as Hi(K)= 2K+3. Draw the resultant hash table that is obtained after
applying the ollowing collision resolution technique.
a. Separate Chaining
b. Linear Probing
c. Quadratic Probing
d. Double Hashing where Ha(K)=3K+1
Bloom's Remembering Understanding Applying Analysing Evaluating Creatiug
Taxonomy Level (K1) (K2) (K3) (K4) (K5) (K6)

Percentage 6.6% 31.7% 61.7%