Q1. find out the average case complexity of the linear search algorithm.
Q2. Derive the equation for calculating the address of the memory location of an element stored in the n-dimensional array.
Q3. prepare down the merits of doubly linked list over the singly linked list.
Q4. Transform the given infix expression into postfix expression:
Q5. prepare down the binary search algorithm.
Q6. In the array implementation of Queue without shifting the element of queue after deletion of the element from queue. Describe the method employed to clearly differentiate between the queue full and queue empty?
Q7. Define the minimum spanning tree and as well describe it with the help of an illustration.