Explanation:
Stack follows the LIFO (Last In, First Out) principle. This means the last element added to the stack is the first one to be removed.
FIFO (First In, First Out) is the characteristic of a queue data structure, not a stack.
The other options are correct:
a) Top of the Stack always contains the new node: This is true, as new elements are added to the top of the stack.
c) Null link is present in the last node at the bottom of the stack: This is typically true in a linked list implementation of a stack, where the bottom node points to null to indicate the end of the stack.
d) Linked List are used for implementing Stacks: This is a common way to implement stacks.
If you think there is any confusion in the given MCQs, you can comment below.
docmcqs.com is Pakistan's No.1 online platform for preparing for all types of exams including PPSC, FPSC, KPSC, SPSC, Ministry of Defence, and for one-paper MCQs. This includes Pedagogy MCQs, general knowledge MCQs, current affairs MCQs, and much more.