GATE 1996 Question - Mark 1
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.
(a) (ii) and (iii) are true
(b) (i) and (ii) are true
(c) (iii) and (iv) are true
(d) (ii) and (iv) are true
Total 4 Questions