COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
II and III
|
|
|
I and II
|
|
|
III and IV
|
|
|
II and IV
|
Detailed explanation-1: -First-in-first out types of computations are efficiently supported by STACKS. Implementing LISTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic LIST operations.
Detailed explanation-2: -In computing and in systems theory, FIFO is an acronym for first in, first out (the first in is the first out), a method for organizing the manipulation of a data structure (often, specifically a data buffer) where the oldest (first) entry, or “head” of the queue, is processed first.
Detailed explanation-3: -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.
Detailed explanation-4: -Stack is basically a data structure that follows LIFO (LAST IN FIRST OUT). Queue is one which follows FIFO (FIRST IN FIRST OUT). In general, Stacks and Queues can be implemented using Arrays and Linked Lists .