Q1. Distinguish between the best, average and worst case complexities.
Q2. Deduce the equation for computing the address of the memory location of an element stored in a 2-dimensional array.
Q3. describe how does doubly linked list distinct from the singly linked list?
Q4. Convert the given infix expression to the postfix expression:
A+B*C-D/A*F
Q5. Distinguish between the Stack and Queue data structure.
Q6. find out the minimum height of binary tree of n nodes?
Q7. Create a complete graph of 4 vertices and find out the adjacency matrix for it.