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

University of Barishal

Department of Computer Science and Engineering

1st 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) Using the divide and conquer approach, explain how to find the maximum element in an array. Draw a diagram showing the recursive division of the array.

Please SUBSCRIBE to view full question

Topics: Divide and Conquer Solution is Coming!
5 Marks
2) Sort the following array using merge sort and show each step: [38, 27, 43, 3, 9, 82, 10]

Please SUBSCRIBE to view full question

Topics: Merge Sort Solution is Coming!
5 Marks
3) Compare the time complexities of O(n log n) and O(n2). For an input size of n = 16 and n = 64, calculate the approximate number of operations assuming 1 operation per unit of complexity.

Please SUBSCRIBE to view full question

Topics: Time Complexity Solution is Coming!
5 Marks
4) Define an algorithm. List three important characteristics of a good algorithm and explain why each is important.

Please SUBSCRIBE to view full question

Topics: Basic Algorithm 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:07 p.m.
Reviewed By: N/A N/A
Back to Other Questions [Of this Course]