Which of the following statement(s) about stack data structure
is/are NOT correct?
a) Linked List are used for implementing Stacks
b) Top of the Stack always contain the new node
c) Stack is the FIFO data structure
d) Null link is present in the last node at the bottom of the stack
Explanation: Stack follows LIFO.
After the completion of all operation, the number of elements present in stack is?
a) 1
b) 2
c) 3
d) 4
Explanation: Number of elements present in stack is equal to the difference between number of push operations and number of pop operations. Number of elements is 5-4=1.
Which of the following is not an inherent application of stack?
a) Reversing a string
b) Evaluation of postfix expression
c) Implementation of recursion
d) Job scheduling
Explanation: Job Scheduling is not performed using stacks.
The type of expression in which operator succeeds its operands is?
a) Infix Expression
b) Prefix Expression
c) Postfix Expression
d) Both Prefix and Postfix Expressions
If the elements “A”, “B”, “C” and “D” are placed in a stack and are deleted one at a time, what is the order of removal?
a) ABCD
b) DCBA
c) DCAB
d) ABDC
Explanation: Stack follows LIFO(Last In First Out). So the removal order of elements are DCBA.
A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as…………
a) Queue
b) Stack
c) Tree
d) Linked list
