Peoples Empowerment Group
ISBM COLLEGE OF ENGINEERING, NANDE, PUNE
Academic Year: 2025 – 26
Course: Data Structures Date:
Assignment Unit 03
Set 1 (Roll No: 01 -20)
Question Question Marks CO PO PSO Blooms
No. Level
Q1 Explain the quick sort algorithm. Show 02 CO3 PO3, PSO1 3
the contents of array after every PO2,
itertion of your algorithm start from
following status of array.-
27, 76, 17, 9, 57, 90, 45, 100, 79
Q2 Explain in brief the different searching 02 CO3 PO3, PSO1 2
techniques. What is the time PO2
complexity of each of them?
Q3 Write an algorithm of selection sort and 02 CO3 PO1, PSO2 3
sort the following numbers using PO2,
PO3
selection sort and show the contents of
an array after every pass:-
81, 5, 27, –6, 61, 93, 4, 8, 104, 15
Q4 Explain quick sort algorithm with 03 CO3 PO1, PSO1 4
suitable example. What is time PO2,
PO3
complexity of quick sort algorithm.
Q5 Write a pseudo code for binary search 03 CO3 PO1, PSO1 4
apply you algorithm on the PO2,
PO3
following no.s stored in an array to
search no:23 & 100.
9,17,23,40,45,52,58,80,85,95,100
Note: To be submitted by (SE C DIV Roll No. 1 to 20)
Submission Date:
Prof. Rahul Thorat
Subject Teacher
Peoples Empowerment Group
ISBM COLLEGE OF ENGINEERING, NANDE, PUNE
Academic Year: 2025 – 26
Course: Data Structures Date:
Assignment Unit 03
Set 2 (Roll No 21-40)
Question Question Marks CO PO PSO Blooms
No. Level
Q1 Write a short note on sentinel search & 02 CO3 PO3, PSO1 3
Index sequential search with PO2,
suitable example
Q2 Sort the following numbers step by step 02 CO3 PO3, PSO1 2
using insertion sort : PO2
55, 85, 45, 11, 34, 5, 89, 99, 67
Comment on time complexity of
Insertion sort
Q3 Explain in brief any three searching 02 CO3 PO1, PSO2 3
techniques. What is the time complexity PO2,
PO3
of these techniques?
Q4 Explain Fibonacci Search algorithm 02 CO3 PO1, PSO1 4
with suitable example. What is it’s PO2,
PO3
time complexity?
Q5 Sort given array by using bubble sort 02 CO3 PO1, PSO1 4
method: 64, 34, 25, 12, 22, 11, 90. PO2,
PO3
Show step by step execution for all the
passes highlighting “swap” and
“No Swap” situations. How many
passes are required to sort an array of
N elements using bubble sort?
Note: To be submitted by (SE C DIV Roll No. 21 to 40)
Submission Date:
Prof. Rahul Thorat
Subject Teacher
Peoples Empowerment Group
ISBM COLLEGE OF ENGINEERING, NANDE, PUNE
Academic Year: 2025 – 26
Course: Data Structures Date:
Assignment Unit 03
Set 3(Roll No 41-Last)
Question Question Marks CO PO PSO Blooms
No. Level
Q1 Enlist different searching methods. Write 02 CO3 PO3, PSO1 3
short note on PO2,
i) Fibonacci Search
ii) Index Sequential Search
Q2 Write an algorithm to search an element 02 CO3 PO3, PSO1 2
in array A using binary search technique. PO2
Show stepwise search of Key 10 in 1, 2,
3, 4, 5, 6, 7, 8, 9, 10, 11. Is there any pre-
processing of data required before
starting binary search or what is its
precursor requirement?
Q3 Sort given array by using selection sort 02 CO3 PO1, PSO2 3
method 50, 23, 03, 18, 9, 01, 70, 21, 20, PO2,
PO3
6, 40, 04. Show step by step execution of
all passes. What is the best and worst
case time complexity of selection sort?
Q4 Explain in brief any three searching 02 CO3 PO1, PSO1 4
techniques. What is the time complexity PO2,
PO3
of these techniques
Q5 Write a short note on sentinel search & 02 CO3 PO1, PSO1 4
Index sequential search with PO2,
PO3
suitable example
Note: To be submitted by ( SE C DIV Roll No. 41-Last)
Submission Date:
Prof. Rahul Thorat
Subject Teacher
