COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Linear Queue
|
|
|
Circular Queue
|
|
|
Priority Queue
|
|
|
None of the above
|
Detailed explanation-1: -a FIFO data structure implemented as a ring where the front and rear pointers can wrap around from the end to the start of the array. a variation of a FIFO structure where some data may leave out of sequence where it has a higher priority than other data items.
Detailed explanation-2: -Which of the following data structures allows you to insert the elements from both the ends while deleting from only one end? Explanation: The answer is b. The output-restricted queue is one of the types of the Deque data structure in which insertion is allowed from both ends but deletion is allowed from only one end.
Detailed explanation-3: -The data structure that implements FIFO is Queue.
Detailed explanation-4: -Which one of the following is the overflow condition if a circular queue is implemented using array having size MAX? Explanation : front=(rear+1) mod max. The overflow condition for the linear queue is rear =MAX-1 as there is no space left in the Queue if rear = MAX-1.