Stack and Queue

Choose correct output for the following sequence of operations.

push(5)

push(8)

pop

push(2)

push(5)

pop

pop

pop

push(1)

pop

• 8 5 2 5 1

• 8 5 5 2 1

• 8 2 5 5 1

• 8 1 2 5 5

Stack can be implemented using _________ and ________ ?

• Array and Binary Tree

• Linked List and Graph

• Array and Linked List

• Queue and Linked List

When the function calls another function then the details of the previous function are stored in Stack?

• Yes

• No

Consider an empty stack of an integers. Let the numbers 4,5,6,7,8 to be pushed on to this stack only in the order they appeared from left to right. Let P indicates PUSH and Q indicates POP operation. What sequence of operations should be performed on stack in order to get the output as 548.

• PPPXPPXX

• PPXPPPXX

• PPXXPPPX

• PXXPPXPX

What is the postfix expression for the corresponding infix expression?

a+b*c+(d*e)

• abc*+de*+

• abc+*de*+

• a+bc*de+*

• abc*+(de)*+

What is the postfix expression for the infix expression?

a-b-c

• abc--

• ab – c –

• – -abc

• -ab-c

Which of the following statement is incorrect with respect to infix to postfix conversion algorithm?

• operand is always placed in the output

• operator is placed in the stack when the stack operator has lower precedence

• parenthesis are included in the output

• higher and equal priority operators follow the same condition

What is the corresponding postfix expression for the given infix expression?

a+(b*c(d/e^f)*g)*h)

• ab*cdef/^*g-h+

• abcdef^/*g*h*+

• abcd*^ed/g*-h*+

• abc*de^fg/*-*h+

What is the correct postfix expression for the following expression?

a+b*(c^d-e)^(f+g*h)-i

• abc^de-fg+*^*+i-

• abcde^-fg*+*^h*+i-

• abcd^e-fgh*+^*+i-

• ab^-dc*+ef^gh*+i-

In linked list implementation of a queue, where does a new element be inserted?

• At the head of link list

• At the tail of the link list

• At the centre position in the link list

• None