M

Mr. Dubey • 100.69K Points
Coach

Q. Consider the following statements:i. First-in-first out types of computations are efficiently supported by STACKS.
ii. Implementing LISTS on linked lists is more efficient than implementing LISTS on
an array for almost all the basic LIST operations.
iii. Implementing QUEUES on a circular array is more efficient than implementing QUEUES
on a linear array with two indices.
iv. Last-in-first-out type of computations are efficiently supported by QUEUES.Which of the following is correct?

  • (A) (ii) and (iii) are true
  • (B) (i) and (ii) are true
  • (C) (iii) and (iv) are true
  • (D) (ii) and (iv) are true
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. Examples of repetitive tasks performed by system administrators

Q. What is true aboout Iterative Deepening DFS?

Q. In Dentralised IT management system decision making is

Q. In the case of, Zero-address instruction method the operands are stored in _____

Q. A model is a _________ of reality.

Q. Which of the following can be identified as cloud?

Q. Representations such as the in the dept year relation, with one column for each value of an attribute, are called they are widely used

Q. There are n dice with f faces. The faces are numbered from 1 to f. What is the minimum possible sum that can be obtained when the n dice are rolled to

Q. By this method, the majority of carbon moves from the lithosphere to the atmosphere

Q. The designation means that the

Question analytics