College of Technology (01)

Bachelor of Technology
Computer Engineering(004)

Semester: 3 Academic Year: 2024-25

Course Name: Data Structures Course Code: 1010043222

Question bank

Sr.
Question Text Marks CO
No.
Unit 1 : INTRODUCTION TO DATA STRUCTURE
1 What is a data structure? Why do we need data structures? 3 CO1

How are data structures classified? Differentiate linear and 4 CO1

2
non-linear data structure.

3 Define ADT (Abstract Data Type). Mention the features of ADT. 3 CO1

4 Difference between Linear and Non Linear Data Structure 3 CO1

Explain malloc,calloc and free functions in ‘C’. Also discuss 6 CO1

5
advantages of dynamic over static memory allocation.

Write short note on performance analysis and performance 4 CO1

6
measurement of an Algorithm.

Give Differenence between Primitive and non-primitive data 4 CO1

7
structures
 Give Differenence between Linear and Non-Linear Data 4 CO1
8
Structures

What is Time Complexity & Space Complexity of an 6 CO1

9
Algorithm. also explain Asymptotic Notations .

Unit 2 : LINEAR DATA STRUCTURE

Define Stack. What are the operations of the stack? What are the 3 CO2
1
applications of stack?

How the stack is implemented by linked list? Write the routine to 4 CO2
2
pop an element from a stack.

Define queue. What are the operations of a queue? What are the 3 CO2
3
types of queue?

What are the methods to implement queue in C? How the queue 4 CO2
4
is implemented by linked list?

Write the routine to delete an element from a queue. What are the 4 CO2
5
applications of queue?

6 What are enqueue and dequeue operations? 3 CO2

7 Distinguish between stack and queue. 4 CO2

1. Convert the infix (a+b)*(c+d)/f into postfix & prefix 4 CO2

8 Expression.
2. Write postfix from of the expression –A+B-C+D?

9 Define priority queue with diagram and explain the operations. 8 CO2

10 Explain how to evaluate arithmetic expressions using stack. 8 CO2

Convert infix expression into Prefix/Postfix format showing 8 CO2

stack status after every step in tabular form.
(A + B) * C – D ^ E ^ (F * G)
11 (A+B)*D+E/(F+G*D)+C
A/B$C+D*E/F-G+H
a–b/c*d+e*f/g
(( A –( B +C))* D) $ ( E +F ) etc.

Write an algorithm for evaluation of postfix expression and 4 CO2

12 evaluate the following expressions showing every status of stack
in tabular form.
 546+*493/+*
752+*411+/-
2 $ 3 + 5 * 2 $ 2 – 6 / 6 etc.

What are the ways of implementing linked list? What are the 4 CO2
13
types of linked lists?

How the singly linked lists can be represented? How the doubly 3 CO2
14
linked list can be represented?

List down the applications of List. What are the advantages of a 8 CO2
15
linked list? Mention the demerits of linked list.

What are the operations performed in the list? What are the 8 CO2
16
merits and demerits of array implementation of lists?

17 Write the program for array implementation of lists. 8 CO2

18 Write a C program for linked list implementation of list. 8 CO2

19 Explain the operations of circularly linked lists. 8 CO2

What is the initial condition to initialize a queue if you implement 1 CO2
20
it using an array?
What is the time complexity of enqueue and dequeue operations 1 CO2
21
in a Simple Queue?

22 Explain sparse matrix and its representation. 3 CO2

23 List application of Array and Stack. 4 CO2

Give the graphical representation of following operations if they 4 CO2
are performed on a simple queue (Consider size = 5) :
enqueue(10)
enqueue(20)
24 enqueue(30)
dequeue()
enqueue(40)
enqueue(50)
display()

25 Differentate Stack with Queue 4 CO2

Unit 3 : NONLINEAR DATA STRUCTURE

 Define non-linear data structure. 3 CO3
1
Define tree and leaf.

Define Tree. Explain the tree traversals with algorithms and 4 CO3
2
examples.

What is a ordered tree? What is meant by directed tree? List out 8 CO3
3
the steps involved in deleting a node from a binary search tree.

4 Explain binary search tree in detail. 4 CO3

Construct an expression tree for the expression 8 CO3

5 (a + b * c)+((d * e + 1) * g). Give the outputs when you apply
preorder,inorder and postorder traversals.

Construct a binary tree having the following traversal sequences: 4 C03

6 Preorder traversal A B C D E F G H I
Inorder traversal B C A E D G H F I

7 Explain AVL tree in detail. 3 CO3

8 Explain B tree and B+ tree in detail. 4 CO3

Explain threaded binary tree in detail.Write the advantages of 4 CO3

9
threaded binary tree.

Define Graph. 3 CO3

10 Define a biconnected graph.
Define shortest path problem.

What is a directed graph? What is an undirected graph? Define 3 CO3

11
adjacent nodes?

Discuss algorithms of Breadth First Search (BFS) and Depth CO3

12 First Search (DFS) traversal for a Graph. Explain with an 8
example.

13 Explain Difference between BFS and DFS. 3 CO3

14 Explain a minimum spanning tree with suitable examples. 4 CO3

15 Explain Kruskal’s algorithm with suitable examples. 4 CO3

Define following terms related to tree with example 4 CO3

(1) Binary tree
16
(2) Binary search tree
(3) Strictly binary tree
 (4) Complete binary tree

Construct binary search tree for the following data 4 CO3

17 10,3,15,22,6,45,65,23,78,34,5
Find its inorder, preorder and postorder traversal

Write recursive ‘C’ functions for (1) in-order (2) pre-order and 4 CO3
18
(3) post-order traversals of binary search tree.

Construct a height balanced binary tree (AVL tree) for the 8 CO3
19 following data.
42,06,54,62,88,50,22,32,12,33

Discuss the following with reference to graphs. 8 CO3

(i) Directed graph
(ii) Undirected graph
(iii) Degree of vertex
20 (iv)Null graph
(v) Multi graph
(vi) Weighted graph
(vii) Elementary path
(viii) Descendent node
Construct an AVL tree by inserting the following elements in the 6 CO3
21 given order.
63, 9, 19, 27, 18, 108, 99, 81.
Construct an AVL tree by inserting the following elements in the 6 CO3
22 given order.
3,5,11,8,4,1,12,7,2,6,10
Create a binary search tree with the input given 6 CO3
below:
23 98, 2, 48, 12, 56, 32, 4, 67, 23, 87, 23, 55, 46
(a) Insert 21, 39, 45, 54, and 63 into the tree
(b) Delete values 23, 56, 2, and 45 from the tree
Create a B tree of order 5 by inserting the following elements: 6 CO3
24 3, 14, 7, 1, 8, 5, 11, 17, 13, 6, 23, 12, 20, 26, 4, 16, 18, 24, 25, and
19.

25 Write a note on dijkstra algorithm 6 CO3

26 Explain Minimum Spanning tree with its algorithms 8 CO3

27 Explain 2-3 Tree 4 CO3

 Unit 4 : HASHING AND FILE STRUCTURES
1 Explain hashing. What is Extendible Hashing? 4 CO5

2 Explain Rehashing in detail. 4 CO5

3 Explain concepts of fields, records and files. 3 CO5

4 Explain Indexed and Relative/Random File Organization. 8 CO5

5 Brief about Collision- Resolution Techniques. 4 CO5

6 What are the applications of Hashing? 3 CO5

Unit 5 : Sorting & Searching

1 Explain the sorting algorithms. 8 CO4

2 Explain the searching algorithms. 8 CO4

What is searching? Explain Binary search algorithm with 4 CO4

3
example and also find its time complexity.

What is searching? Explain Linear search algorithm with 4 CO4

4
example and also find its time complexity.

5 Discuss the Algorithm of merge sort with an example. 3 CO4

6 Explain how to sort the elements by using selection sort. 3 CO4

Write a C program to sort the elements using bubble sort, 8 CO4

7
insertion sort and radix sort.

Write a C program to perform searching operations using linear 8 CO4

8
and binary search.

Write a procedure for sorting a given list of elements using the 8 CO4
9 Quick sort method. Show the division of the list in the quick sort
for a list of 10 numbers.

Course Coordinator Head of Department