Q1. prepare down an algorithm for the quick sort. Compare its complexities for worst case, average case and the best case. Sort the given by using quick sort:
5, 4, 2, 8, 7, 9, 1, 3
Q2. Describe various ways of collision resolution with open addressing.
Q3. What do you mean by priority queue? describe how priority queue can be represented in the memory?
Q4. Convert the given infix expression to postfix by using stack:
A + (B * C - (D / E ↑ F) * G) * H
Q5. prepare down an algorithm to assess a postfix expression by using stack. Describe the steps of the algorithm.
Q6. Define the term binary tree. Prove that the maximum number of nodes in a binary tree of height h can be 2h – 1.