STACK DATA STRUCTURE

Stacks have LIFO ordering

• TRUE

• FALSE

LIFO stands for

• List of Outputs

• Last in First Out

• First in Last Out

• None of them

Act of adding values into a stack is called

• Popping

• Polling

• Pushing

• None

Which of the following statement(s) about stack data structure is/are NOT correct?

• Stack data structure can be implemented using linked list

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

• Stack is the FIFO data structure

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

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

• ABCD

• DCBA

• DCAB

• ABDC

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?

• ABCD

• DCBA

• DCAB

• ABDC

Are stacks FIFO or FILO?

• FILO
• FIFO
• LIFO
• LILO

The five items: A, B, C, D, and E are pushed in a stack, one after other starting from A. The stack is popped four items and each element is inserted in a queue. The two elements are deleted from the queue and pushed back on the stack. Now one item is popped from the stack. The popped item is

• A

• B

• C

• D

• E

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?

• Underflow occurs

• Stack operations are performed smoothly

• Overflow occurs

• None of the above

Which of the following is not an inherent application of stack?

• Implementation of recursion

• Evaluation of a postfix expression

• Job scheduling

• Reverse a string