At

each iteration, the loop counter i is either printed or put on a

for (i=1;i<=5;i++)                                                                 

if (f()) cout<<i;                                                      

else s.push(i);                                                       

while (!s.isEmpty())

{              

cout<<s.peek();

s.pop();        

 }

Consider

and empty

Queue

<char> q; q.

enqueue (‘h’); q. enqueue (‘i’); q. enqueue (‘o’); q. enqueue (‘u’); q.

dequeue(); q. enqueue (‘t’); q. enqueue (‘p’); q. dequeue(); q. enqueue (‘a’);

cout<<

Consider the usual algorithm for determining

whether a sequence of parentheses is balanced. What is the maximum number of

parentheses that will appear on the

What does the remove

method do regarding priority queues?

Consider the

following pseudo code. Assume that IntQueue is an integer

void fun(int n)

{

    IntQueue

q = new IntQueue();

    q.enqueue(0);

    q.enqueue(1);

    for (int i = 0; i < n; i++)

    {

        int a = q.dequeue();

        int b = q.dequeue();

        q.enqueue(b);

        q.enqueue(a

+ b);

        ptint(a);

    }

}

Indicate

the applications for which a

Popping in a stack

means:

Suppose we have a circular array

implementation of the

What is the value of the postfix

expression 6 3 2 4 + - * :

Following is C++ like

pseudo code of a function that takes a

void fun(Queue *Q)

{

// Run while Q is not empty

while (!isEmpty(Q))

{

// deQueue an item from Q and push the dequeued item to S

push(&S, deQueue(Q));

}

// Run while

    while (!isEmpty(&S))

{

// Pop an item from S and enqueue the poppped item to Q

enQueue(Q, pop(&S));

}

}