1.       Consider an array A[20, 10], assume 4 words per memory cell and the base address of array A is 100. What is the address of A[11, 5] ? Assume row major storage.

The space required by an algorithm is equal to the sum of ________ components.

1.       What is the value of the postfix expression 6 3 2 4 + – *:

A queue follows __________

The result of evaluating the postfix expression 5, 4, 6, +, *, 4, 9, 3, /, +, * is?

The complexity of Binary search algorithm is

1.       The given array is arr = {3,4,5,2,1}. The number of iterations in bubble sort and selection sort respectively are,

1.       Suppose we are sorting an array of eight integers using quicksort, and we have just finished the first partitioning with the array looking like this:

1.       In the following scenarios, when will you use selection sort?

1.     After performing these set of operations, what does the final list look contain?

InsertFront(10);

InsertFront(20);

InsertRear(30);

DeleteFront();

InsertRear(40);

InsertRear(10);

DeleteRear();

InsertRear(15);

display();