Balkumari College
Bharatpur,Chitwan
Mid-term Exam
Subject: Data Structure and Algorithm
Time:1hr 30min
Group A Attempt all questions 1*4=4
1. What is the time complexity of an algorithm that takes
constant time, regardless of the input size?
2. Mention one situation where a doubly linked list is preferred
over an array.
3. Explain the concept of enqueuing an element.
4. Why do we prefer self-adjusting trees instead of strict
balanced tree
Group B Attempt any two 2*3=6
5. Illustrate the step-by-step insertion process for the elements
15, 10, 20, 5, and 25 in an initially empty BST.
6. How does heapify method helps in arranging data in sorted
order.
7. Explain the difference between a linear queue and a circular
queue. Discuss the advantages of using a circular queue in
scenarios where the queue size is fixed.
Group C Attempt any two 2*5=10
8. Explain the concept of a binary search tree (BST). Provide the
algorithm for inserting a new element into a BST. Show the
different deletion technique of B-Tree
9. Discuss the operations that can be performed on a queue.
Provide real-world examples where a queue is useful in
solving specific problems.
10. Describe the stack data structure and explain the concept of
LIFO order. Illustrate the stack operations of push and pop.
Trace the stack's contents after performing the following
operations: push 5, push 10, pop, push 15, pop.
Group D Attempt all questions 1*10=10
11. Explain all the insertion operations of doubly linked list along
with java function for each of the operation.
FM:30
PM:15
Group A Attempt all questions 1*4=4
1. What is the time complexity of an algorithm that takes
constant time, regardless of the input size?
2. Mention one situation where a doubly linked list is preferred
over an array.
3. Explain the concept of enqueuing an element into a queue.
4. Why do we prefer self-adjusting trees instead of strict
balanced tree
Group B Attempt any two 2*3=6
5. Illustrate the step-by-step insertion process for the elements
15, 10, 20, 5, and 25 in an initially empty BST.
6. How does heapify method helps in arranging data in sorted
order.
7. Explain the difference between a linear queue and a circular
queue. Discuss the advantages of using a circular queue in
scenarios where the queue size is fixed.
Group C Attempt any two 2*5=10
8. Explain the concept of a binary search tree (BST). Provide the
algorithm for inserting a new element into a BST. Show the
different deletion technique of B-Tree
9. Discuss the operations that can be performed on a queue.
Provide real-world examples where a queue is useful in
solving specific problems.
10. Describe the stack data structure and explain the concept of
LIFO order. Illustrate the stack operations of push and pop.
Trace the stack's contents after performing the following
operations: push 5, push 10, pop, push 15, pop.
Group D Attempt all questions 1*10=10
11. Explain all the insertion operations of doubly linked list along
with java function for each of the operation.