COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
A collection of stacks is sortable
|
|
|
Stack entries may be compared with the ‘<‘ operation
|
|
|
The entries are stored in a linked list
|
|
|
There is a Sequential entry that is one by one
|
Detailed explanation-1: -Entries in a stack are “ordered”. What is the meaning of this statement? Explanation: In stack data structure, elements are added one by one using push operation. Stack follows LIFO Principle i.e. Last In First Out(LIFO).
Detailed explanation-2: -Answer: There is a Sequential entry that is one by one.
Detailed explanation-3: -Explanation: Stack is used for temporary storage of contents of registers and memory locations, status of registers.
Detailed explanation-4: -The option d, i.e., balancing of symbols is an application of the stack data structure. 37) Which of the following option is true if implementation of Queue is from the linked list?
Detailed explanation-5: -Which of the following is not the correct statement for a stack data structure? Explanation: The answer is b because Stack does not follow FIFO. It follows LIFO.