Stacks

Which condition does stack apply?

• FILO

• LIFO

• FIFO

• LILO

Only top element can be accessed in stack

• True

• False

Operation to add values into stack is called

• Push

• Pop

• None

• Empty

Operation to remove an element from the stack

• Pop

• Push

• Create

• Emplace

Operation that returns the topmost element of the stack

• Top

• Empty

• Size

• Swap

Operation to construct and insert new element to the top of the stack

• Emplace

• Top

• Push

• Size

If the sequence of operations

push(1)

push(3)

pop

push(2)

push(2)

pop

pop

pop

push(3)

pop

are performed on a stack, the order of popped out values

• 3, 2, 2, 3, 1

• 3, 2, 1, 3, 2

• 2, 3, 2, 3, 1

• 1, 3, 2, 2, 3

Consider the following operations performed on a stack of size 5

Push(a)

Pop()

Push(b)

Push(c)

Pop()

Push(d)

Pop()

Pop()

Push(e)

Which of the following statements is correct?

• Stack operations performed smoothly

• Underflow occurs

• Overflow occurs

• None of the above

Which of the following is not an application of stack?

• Job schedulling

• Undo-redo feature

• Infix conversion

• Tower of hanoi

Which of the following statement about stack data structure is not correct?

• Stack is a FIFO data structure

• Stack data structure can be implemented using linked list

• New element can only be added at the top of the stack

• The last node at the bottom of the stack has a NULL link