- Computer Science Engineering (CSE)
- Data Structures (DS)
- Linear Data Structures -Stacks and Queue...
- Entries in a stack are “ordered”. What i...

Q. |
## Entries in a stack are “ordered”. What is the meaning of this statement? |

A. | A collection of stacks is sortable |

B. | Stack entries may be compared with the ‘<‘ operation |

C. | The entries are stored in a linked list |

D. | There is a Sequential entry that is one by one |

Answer» D. There is a Sequential entry that is one by one |

View all MCQs in:
Data Structures (DS)

- Pushing an element into stack already having five elements and stack size of 5, then stack becomes
- In a stack, if a user tries to remove an element from empty stack it is called
- What is the best case and worst case complexity of ordered linear search?
- Records R1, R2, R3,.. RN with keys K1, K2, K3,.. KN are said to be h-ordered, if
- The number of possible ordered trees with three nodes A,B,C is?
- Matrices with a relatively high proportion of zero entries are called _______ matrices.
- Process of inserting an element in stack is called
- Process of removing an element from stack is called
- Which of the following is not the application of stack?
- Consider the usual algorithm for determining whether a sequence of parentheses is balanced. Suppose that you run the algorithm on a sequence that contains 2 left parentheses and 3 right parentheses (in some order). The maximum number of parentheses that appear on the stack AT ANY ONE TIME during the computation?

Login to Continue

It will take less than 2 minutes

Report MCQ