Chapter 5, Problem 2C

Explanation of Solution

Pseudo code:

// S is the stack

// Q is the emty queue

// x is the element to be searched

Function isElementPresent(S , Q , x)

BEGIN

    // becomes true is x is present in S

    Flag = false

While S is not empty

BEGIN

// get the top most element from stack

T = S.pop()

// add the element popped into Q

Q.enqueue(T)

// if the element is found

If T == x              

        BEGIN

    Flag = true

        END

    END

// now push the elements back into the stack

While Q is not empty

BEGIN

// get the front element from queue

T = Q.dequeue()

// psush the element into S

S.push(T)

END

// now the elements in the stack are in reverse order

// so repeat the steps above again

While S is not empty

BEGIN

// get the top most element from stack

T = S.pop()

// add the element popped into Q

Q.enqueue(T)

END

// now push the elements back into the stack

While Q is not empty

BEGIN

// get the front element from queue

T = Q...