Code No.
: 20CSC08
CHAITANYA BHARATHI INSTITUTE OF TECHNOLOGY (Autonomous)
B.E. III Sem (Main) Examination March 2023
Data Structures
(Common to CSE, CSE-AI&ML, CSE-IoT & CS Including BCT)
Time: 3 Hours Max Marks: 60
Note: Answer ALL questions from Part-A & Part –B (Internal Choice) at one place in the
same order
Part - A
(5Q X 3M = 15 Marks)
M CO BT
1 Solve and find the upper bound of time complexity for (3) 2 3
4 2
𝑓(𝑛) = 𝑛 + 100𝑛 + 50.
2 What are Skip-lists and how are they different from linked list? (3) 3 1
3 What are the drawbacks of Linear Queues? How is it overcome in Circular (3) 3 1
Queues?
4 Define LL, RR, LR and RL rotations used to balance AVL Trees with (3) 3 1
suitable example.
5 For the given graph construct the graph representation using (3) 5 3
i. Adjacency Matrix ii. Adjacency List iii. Adjacency Set
Part – B
(5Q X 9M = 45 Marks)
M CO BT
6 (a) Apply recursive Mergesort algorithm to sort the elements [120, 3, 56, (5) 1 3
90, 23, 14, 1, 10, 2, 50] in ascending order. Draw the tree for recursive
calls to Merge-sort and Merge operations.
(b) Explain the different Asymptotic notation for time complexity of (4) 2 1
algorithms.
(OR)
7 (a) Write the recursive algorithm for generating the first N Fibonacci (5) 2 1
numbers. Analyze it time complexity.
(b) With a suitable example explain Abstract Data Type. (4) 1 1
8 (a) Given a doubly linked list for the following element in order: 2, 3, 4, (5) 3 3
5, 6, 7, 8, 9. Explain the steps to delete element 6. Construct the initial
list, list at each step of deletion process and the final list.
(b) Explain the operation of insertion in singly linked list. Consider all (4) 3 1
cases.
(OR)
Page 1 of 2
Code No.: 20CSC08
9 (a) Write an algorithm to list the elements of a Circular singly linked list. (5) 3 1
(b) Develop an algorithm to convert a given doubly linked list into two (4) 3 3
singly linked lists such that the first list is got by traversing in the
forward direction and the second list is got by traversing in the
backward direction of links.
10 (a) Write an algorithm to implement insert and delete operations on linked (5) 3 2
queue.
(b) Describe the steps for insert operation in Double Ended Queues. (4) 3 2
(OR)
11 (a) For the given queue elements [12, 10, 14, 9, 6, 20, 5, 30] give the (5) 4 3
Linear queue, Circular queue, DeQueue and Linked queue
representations. After deleting the first 4 elements, indicate the front
and rear positions in each.
(b) Write an algorithm to delete an element from a linked Stack. (4) 3 1
12 (a) What are Tries? Construct the Standard Trie for the following words: (5) 5 3
bear, bell, buy, bull, sell, stop, stock.
(b) Write recursive algorithm to implement In-order, Pre-Order tree (4) 5 1
traversal of Binary Search Trees.
(OR)
13 (a) Write an algorithm to insert an element into a Binary Search Tree. (5) 5 1
(b) For the given element [8, 7, 6, 5, 4, 3, 2, 1] construct a Min-Heap. (4) 5 3
14 (a) Define Hashing. Apply the Hashing techniques: (5) 5 3
i. Modulo, ii. Folding --for the storing the elements:
[12, 144, 13, 169, 11, 121, 10,100]
(b) Explain the Brute Force approach for String Matching with suitable (4) 5 1
example.
(OR)
15 (a) Explain the different Graph Traversal approaches with example. List (5) 6 1
two applications of graphs.
(b) Describe Rabin-Karp string Matching algorithm. (4) 5 2
******
Page 2 of 2
