Back to Other Questions [Of this Course]
👁️ 55 views
University of Barishal Logo

University of Barishal

Department of Computer Science and Engineering

2nd Mid Exam

Course Title: Design and Analysis of Algorithms (CSE-2201)

Semester: 4th | Session: 22-23

Time: 50 minutes | Marks: 20.00

Exam Date: September 17, 2025

View 27 Topic-wise Questions for this Course
1.

1) Sort the array [8, 3, 5, 4, 6] using insertion sort. Show each step of inserting elements into the sorted portion.

Please SUBSCRIBE to view full question

Topics: Insertion Sort Solution is Coming!
5 Marks
2) Sort the array [5, 1, 4, 2, 8] using bubble sort. Show the array after each full pass of comparisons and swaps.

Please SUBSCRIBE to view full question

Topics: Bubble Sort Solution is Coming!
5 Marks
3) Sort the array [170, 45, 75, 90, 802, 24, 2, 66] using radix sort. Show the array after sorting by each digit place.

Please SUBSCRIBE to view full question

Topics: Radix Sort Solution is Coming!
5 Marks
4) Explain counting sort and identify when it is most efficient.

Please SUBSCRIBE to view full question

Topics: Counting Sort Solution is Coming!
5 Marks
View 27 Topic-wise Questions for this Course

Contributors of this Question:

Role Name Date
Uploaded By: Antor Sarker Sept. 17, 2025, 4:08 p.m.
Reviewed By: N/A N/A
Back to Other Questions [Of this Course]