If the array is already sorted, then the running time for merge sort is: ?

Ο(log n) is?

1.       What is the time complexity of following code:

int a = 0;

for (i = 0; i < N; i++)

{

for (j = N; j > i; j--)

{

a = a + i + j;

}

}

In a circular queue, how do you increment the rear end of the queue?

Here is an infix expression: 4 + 3*(6*3-12). Suppose that we are using the usual stack algorithm to convert the expression from infix to postfix notation. The maximum number of symbols that will appear on the stack AT ONE TIME during the conversion of this expression?

1.       Pushing an element into stack already having five elements and stack size of 5 , then stack becomes

The data structure required to check whether an expression contains a balanced parenthesis is?

A normal queue, if implemented using an array of size MAX_SIZE, gets full when?

Asymptotic analysis is _______ bound.

1.       Which of the following is linear asymptotic notations?