Code No.
: 20CSC06
CHAITANYA BHARATHI INSTITUTE OF TECHNOLOGY (Autonomous)
B.E. & B.Tech III Sem (Main) Examination March 2023
Basics of Data Structures
(Common to Mech, ECE, EEE & Chem)
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 How data structures are classified? (3) 1 1
2 When doubly linked list can be represented as circular linked list? (3) 2 1
3 Write the routine to delete a element from a queue. (3) 3 3
4 List out the steps involved in deleting a node from a binary search tree. (3) 4 1
5 When is a graph said to be weakly connected? (3) 5 1
Part – B
(5Q X 9M = 45 Marks)
M CO BT
6 (a) State the properties of LIST abstract data type with suitable example. (5) 1 1
(b) Define recursion. Explain it with Fibonacci series and factorial of a (4) 1 2
number.
(OR)
7 (a) Differentiate between Linear and Non-linear Data Structure? (5) 1 1
(b) Define ADT and What are the features of ADT? (4) 1 1
8 (a) Explain the steps involved in insertion and deletion into a singly and (5) 2 2
doubly linked list?
(b) What are the benefits and limitations of linked list? (4) 2 2
(OR)
9 (a) How polynomial manipulations are performed with lists? Explain its (5) 2 2
operations?
(b) What are the applications of linked list in dynamic storage management? (4) 2 2
10 (a) Explain double ended queue and its operations? (5) 3 3
(b) State & explain the algorithm to perform Quick sort. Also analyse the (4) 3 3
time complexity of the algorithm.
(OR)
11 (a) Explain how to evaluate arithmetic expressions using stacks? (5) 3 3
(b) Write an algorithm to implement selection sort with suitable example. (4) 3 2
12 (a) Construct an expression tree for the expression (a+b*c) + ((d*e+f)*g). (5) 4 3
Give the outputs when you apply inorder, preorder and postorder
traversals.
(b) Explain steps for conversion of general tree to binary tree, with an (4) 4 1
example.
(OR)
Page 1 of 2
Code No.: 20CSC06
13 (a) Write a recursive algorithm for binary tree traversal with an example. (5) 4 3
(b) List out the steps involved in deleting a node from a binary search tree (4) 4 3
with an example.
14 (a) Define Graph and explain how graphs can be represented in adjacency (5) 5 1
matrix and adjacency list.
(b) Briefly explain various levels in a graph using examples. (4) 5 2
(OR)
15 (a) Explain the minimum spanning tree algorithms with an example. (5) 5 2
(b) Define Indegree and Outdegree of a graph with an example? (4) 5 1
******
Page 2 of 2
