Which algorithm is having highest space complexity?

The postfix form of the expression (A+ B)*(C*D- E)*F / G is?

Queues serve major role in ______________

The postfix form of A*B+C/D is?

A program P reads in 500 integers in the range [0..100] exepresenting the scores of 500 students. It then prints the frequency of each score above 50. What would be the best way for P to store the frequencies?

1.       What is the time, space complexity of following code:

int a = 0, b = 0;

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

{

a = a + rand();

}

for (j = 0; j < M; j++)

{

b = b + rand();

}

The prefix form of an infix expression (p + q) – (r * t) is?

If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?

If the elements “A”, “B”, “C” and “D” are placed in a stack and are deleted one at a time, what is the order of removal?

What is the result of the following operation?