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.1 point(i) and (ii) are true(ii) is true(iii) is true(ii) and (iv) are true

The correct answer is (ii) is true.

Explanation:

i. First-in-first out types of computations are efficiently supported by QUEUES, not stacks. Stacks support Last-in-first-out (LIFO) computations.

ii. Implementing LISTS on linked lists can be more efficient than implementing LISTS on an array for operations that involve inserting and deleting elements, as these operations can be done in O(1) time on linked lists but take O(n) time on arrays.

iii. Implementing QUEUES on a circular array can be more efficient than implementing QUEUES on a linear array with two indices, because it avoids the need for data shifting.

iv. Last-in-first-out type of computations are efficiently supported by STACKS, not queues. Queues support First-in-first-out (FIFO) computations.