BIT Data Structure and Algorithms

How stack is used in recursion? Explain different stack operations. Explain algorithm to convert an infix expression to postfix using stack.

Explain complete binary tree with example. Starting with an empty binary search tree, show the effect of successively adding the following elements: 47, 50, 25, 2 7, 17, 61, 5, and 26. Also, traverse the resulting tree in pre-order, in-order, and post-order.

Explain quick sort algorithm. Use this algorithm to sort the numbers 35, 82, 18, 54, 13, 31, 20, 69, and 19.

Define ADT. Explain array as an ADT.

What is time complexity? Explain big oh notation with example.

Explain priority queue with example. What is circular queue?

What are the benefits of using recursion? Write a recursive function to find \(n^{th}\) Fibonacci number.

Explain singly linked list with example. Compare singly linked list with doubly linked list.

Explain different applications of binary tree.

Explain collision and collision resolution in hashing. What is double hashing?

Explain adjacency matrix representation of graphs with example.

Write short notes on:

a. Linear Search

b. Minimum Spanning Tree