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

University of Barishal

Department of Computer Science and Engineering

1st Mid Exam

Course Title: Data Structures (CSE-1201)

Semester: 2nd | Session: 21-22

Time: 60 minutes | Marks: 15.00

Exam Date: October 8, 2023

View 46 Topic-wise Questions for this Course
1.

1) Write down the reasons of studying data structures in Computer science and engineering. (What data structure means why it helps in CSE Examples)

Please SUBSCRIBE to view full question

Topics: Basic Data Structure Solution is Coming!
2 Marks
2) Define heap. Write down the heap sort algorithms or program for the heap sort. (heap definition→ why array represented as heap→ write all steps of heap sort algorithms such as parent, left, right, max heapify, build max heap→ finally heap sort)

Please SUBSCRIBE to view full question

Topics: Heap Sort Solution is Coming!
6 Marks
3) What do you mean by stable sorting? Sort the following data <3, 27, 5, 4, 2, 6, 1> with details using an algorithms you like. (Definition of Stable Sorting → Name the sorting you like show all steps with explanation of your desired algorithms using the data.)

Please SUBSCRIBE to view full question

Topics: Stable Sorting Solution is Coming!
4 Marks
4) Write down the differences between the two algorithms (Name of a) and b)→ what problems the algo solved→ specify their time and space complexity)

Please SUBSCRIBE to view full question

Topics: Algorithm Analysis , Space Complexity , Time Complexity Solution is Coming!
3 Marks
View 46 Topic-wise Questions for this Course

Contributors of this Question:

Role Name Date
Uploaded By: Onebyzero Edu (Test User) July 26, 2024, 6:32 p.m.
Converted By (Img/PDF to Text): Lazmi Rahman Oct. 18, 2025, 11:34 a.m.
Reviewed By: N/A N/A
Back to Other Questions [Of this Course]