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

University of Barishal

Department of Computer Science and Engineering

2nd Mid Exam

Course Title: Data Structures (CSE-1201)

Semester: 2nd | Session: 23-24

Time: 40 minutes | Marks: 20.00

Course Teacher: Md. Samsuddoha

Exam Date: November 13, 2025

View 46 Topic-wise Questions for this Course
1.

1) Perform insert and delete operations in a Linked List. Illustrate with examples.

Please SUBSCRIBE to view full question

Topics: Linked List Solution is Coming!
4 Marks
2) A hospital uses a queue to manage patient appointments. a) Illustrate how patients are inserted and removed in a linear queue. b) Explain what happens when the queue becomes full but has empty slots at the front (illustrate with an example). c) How does a circular queue solve this problem?

Please SUBSCRIBE to view full question

Topics: Circular Queue , Queue Solution is Coming!
6 Marks
3) Consider the given binary tree and answer the following questions: a) Perform inorder, preorder, and postorder traversals and show the result. b) If one node is deleted, explain which node will replace it in a complete binary tree.

Please SUBSCRIBE to view full question

Topics: Binary Search Tree (BST) Solution is Coming!
5 Marks
4) You are given the following sequence of numbers to insert into a BST: 50, 30, 70, 20, 40, 60, 80 a) Construct the BST. b) Show the steps to search for the key 40. c) If node 30 is deleted, which node will replace it? Justify your answer.

Please SUBSCRIBE to view full question

Topics: Binary Search Tree (BST) Solution is Coming!
5 Marks
View 46 Topic-wise Questions for this Course

Contributors of this Question:

Role Name Date
Prepared By (Teacher): Md. Samsuddoha Nov. 13, 2025
Uploaded By: F.M.Mustakin Riaz Nov. 13, 2025, 11:44 a.m.
Converted By (Img/PDF to Text): Obaydul Hasan Nayeem Nov. 18, 2025, 12:35 p.m.
Reviewed By: Obaydul Hasan Nayeem Nov. 18, 2025, 12:46 p.m.
Back to Other Questions [Of this Course]