- Computer Science Engineering (CSE)
- Data Structure (DS)
- Suppose a circular queue of capacity (n ...

Q. |
## 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 |

A. | full: (rear+1) mod n == front, empty: rear == front |

B. | full: (rear+1) mod n == front, empty: (front+1) mod n == rear |

C. | full: rear == front, empty: (rear+1) mod n == front |

D. | full: (front+1) mod n == rear, empty: rear == front |

Answer» A. full: (rear+1) mod n == front, empty: rear == front |

View all MCQs in:
Data Structure (DS)

- 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?
- Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation.
- 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.Which of the following is correct?
- In a priority queue, insertion and deletion takes place at ………………
- When a stack is organized as an array, a variable named Top is used to point to the top element of the stack. Initially, the value of Top is set to_______to indicate an empty stack.
- Which data structure allows deleting data elements from front and inserting at rear?
- In a queue, the initial values of front pointer f rare pointer r should be …….. and ……….. respectively.
- In stack deletion operation is referred as _____
- In Circular Linked List insertion of a node involves the modification of ____ links.

Login to Continue

It will take less than 2 minutes

Report MCQ