McqMate

Q. |
## What is the need for a circular queue? |

A. | effective usage of memory |

B. | easier computations |

C. | to delete elements based on priority |

D. | implement LIFO principle in queues |

Answer» A. effective usage of memory |

4.2k

0

Do you find this helpful?

30

View all MCQs in

Data Structures (DS)No comments yet

- Suppose you are given an implementation of a queue of integers. The operations that can be performed on the queue are: i. isEmpty (Q) — returns true if the queue is empty, false otherwise. ii. delete (Q) — deletes the element at the front of the queue and returns its value. iii. insert (Q, i) — inserts the integer i at the rear of the queue. Consider the following function: void f (queue Q) { int i ; if (!isEmpty(Q)) { i = delete(Q); f(Q); insert(Q, i); } }What operation is performed by the above function f ?
- Consider a standard Circular Queue 'q' implementation (which has the same condition for Queue Full and Queue Empty) whose size is 11 and the elements of the queue are q[0], q[1], q[2].....,q[10]. The front and rear pointers are initialized to point at q[2] . In which position will the ninth element be added?
- Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operation are carried out using REAR and FRONT as array index variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full and queue empty are
- In a circular queue, how do you increment the rear end of the queue?
- In a circular queue the value of r will be ..
- Circular Queue is also known as
- In a queue, the initial values of front pointer f rare pointer r should be …….. and ……….. respectively.
- ………… is not the operation that can be performed on queue.
- Which of the following is not the type of queue?
- In a priority queue, insertion and deletion takes place at ………………