SRM Institute of Science and Technology BATCH 1- SET A

College of Engineering and Technology

DEPARTMENT OF ECE
SRM Nagar, Kattankulathur – 603203, Chengalpattu District, Tamilnadu
Academic Year: 2026-2027 (ODD)

Test: FT- 3 Date: 06.08.2026

Course Code & Title: Duration:8.00am – 9.40am
Year & Sem & Dept: II/IV/EKE Max. Marks: 50

Course Articulation Matrix:

21ECC212T /Data Structures & Algorithms Program Outcomes (POs)
Graduate Attributes PSO
11
COs Course Outcomes (COs) 1 2 3 4 5 6 7 8 9 10 1 2 3

Implement abstract data types using arrays and

1 linked list.. .
1 2 3 - - - - - - - - 3 - -
Apply the different linear data structures like
2 stack and queue to various computing problems 1 2 3 - - - - - - - - 2 - -
Implement different types of trees and apply
3 them to problem solutions
1 2 3 - - - - - - - - 2 - -
Discuss graph structure and understand various
4 operations on graphs and their applicability 1 3 2 - - - - - - - - - - 3
Analyze the various sorting and searching
5 algorithms, hashing technique and hash 1 3 2 - - - - - - - - - 2 -
functions.

Part – A
(10 x 1= 10 Marks)
Instructions: Answer ALL Questions
Q. Questions Marks BL CO PO
No
1 In a binary tree, the maximum number of nodes at level i is: 1 L1 CO3 PO1
a) 2^i b) 2^(i−1) c) i² d) i
2 In a BST, the left subtree contains: 1 L3 CO3 PO1
a) Greater values b) Smaller values
c) Equal values d) Random values
3 Range of balance factor in AVL tree is: 1 L2 CO3 PO1
a) −2 to 2 b) −1 to 1 c) 0 to 2 d) −3 to 3
4 In a B-Tree, all leaves are at: 1 L1 CO3 PO1
a) Different levels b) Same level
c) Random levels d) Only two levels
5 Deletion of a node with two children in BST uses: 1 L1 CO3 PO1
a) Leaf node b) Root node
c) Inorder successor/predecessor d) Random node
6 In an undirected graph, edges are: 1 L1 CO4 PO1
a) Directed b) Bidirectional
c) Weighted only d) Cyclic
7 The degree of a vertex is: 1 L1 CO4 PO1
a) Number of edges connected to it b) Number of vertices
c) Number of paths d) Weight of edges
8 BFS uses which data structure? 1 L2 CO4 PO1
a) Stack b) Queue c) Tree d) Array
9 Minimum Spanning Tree minimizes: 1 L2 CO4 PO1
a) Number of vertices b) Number of edges
c) Total edge weight d) Path length
10 In adjacency matrix representation, space complexity is: 1 L1 CO4 PO1
a) O(V) b) O(E) c) O(V²) d) O(log V)
 Part – B (2 X 8 = 16 Marks)
Answer ALL questions
11 Explain Binary Tree construction using level-order insertion. 8 L3 CO3 PO2
a) Construct a binary tree using:
10, 20, 30, 40, 50, 60, 70
and perform all traversals. L3
b) (OR) 8 CO3 PO2
Define the following tree terminologies with examples: Root, Degree of
a Node, Height, and Level.
12 Explain Depth First Search (DFS) algorithm. 8 L3 CO4 PO2
a) Perform DFS traversal starting from vertex A for the graph:
Edges: A–B, A–C, B–D, B–E, C–F
(OR) L3
b) Write short notes on Heaps, heap operations and applications. 8 CO4 PO2
PART C (2 X 12 = 24 Marks)
Answer ALL questions
13 Explain AVL tree insertion with balance factor. 12 L4 CO3 PO3
a) Construct an AVL tree using:
40, 20, 60, 10, 30, 25
Show balance factor at each step and final balanced tree.
(OR)
Construct a new Binary Search Tree (BST) using the given input
b) values: {45, 39, 56, 12, 54, 78, 10, 34, 67, 89, 32, 81}. Perform in-
order, pre-order, and post-order traversals on the newly constructed 12 L4 CO3 PO3
BST and present the results.
14 A smart navigation system is designed to determine the shortest travel 12 L4 CO4 PO3
a) time from a starting location A to all other locations in a network of
connected points. Each connection represents a road with an associated
travel cost.
The network is represented as a weighted graph with the following
connections:
A–B(2), A–C(4), A–D(1), B–D(3), B–E(10), C–D(2), C–F(5)
D–E(2), D–F(8), D–G(4), E–G(6), F–G(1)
(OR)
b) A city infrastructure department plans to connect multiple service 12 L4 CO4 PO3
centers using underground cables. The objective is to ensure that all
centers are connected with minimum total cost, while maintaining a
continuous network. Using Prim’s Algorithm, construct the Minimum
Spanning Tree (MST) starting from vertex A.
The network of service centers is represented as a weighted graph with
vertices
A, B, C, D, E, F, G, H, I, and the connections with associated costs are:
A–B(9), A–C(4), B–C(2), B–D(1), B–E(7), C–D(4), C–F(3), D–E(2),
D–F(5), E–F(6), E–G(3), F–G(8), F–H(5), G–H(1), G–I(3), H–I(2)

Course Outcome (CO) and Bloom’s level (BL) Coverage in Questions

Note on Providing Choices in Question Paper

• If the question paper setter offers choice-based questions, use the either-or format where both options map
to the same Course Outcome. Example: Q11(a) OR Q11(b), both covering CO2.

• If the choice is in the form of "Answer any N out of M", all M questions in that choice group should
preferably map to the same CO.

• To ensure complete CO coverage while still providing choice, divide the section based on COs. Example:
Section B1 for CO2 and Section B2 for CO3.

• Do not mix multiple COs inside one common choice group unless the CO attainment calculation method
handles the choice fairly.