Data Structure
HNBGU MCA Previous Question Paper 202223


What is the time complexity of binary search algorithm is :
 Best case
 Worst Case

Define ADT. What are its advantages?


Write a procedure to convert infix expression to postfix
expression.

Apply the procedure of 2(a) on the following expression:
((A+B)*D)^
(EF)(^ means raise to the power)


Let a1 denotes the foloowing algebraic expression :
a1= [a+(b+c)]*[de/(gh)]
Draw the corresponding binary
tree.
Apply:
 preorder
 postorder
 inorder traversal on the tree obtained in 3(a)


Create the BST after inserting the following elements in
order in empty BST:

What are AVL trees? write down their applications.


What are underflow and ovreflow conditions in a linked list?
Explain with the help of a suitable diagram.

Write the PUSH and POP algorithms of a stack using array
representation.


What is recursion? Explain with the help of a suitable
example.

Explain linear search and its complexities in
 Best Case
 Average Case
 Worst Case

Write short notes on the following.
 Column major representation of 2D array
 Garbage colleciton
 Priority queue
 Bubble sort