Data Structure MCQ - Queues

void fun(Queue *Q)
{
    Stack S;  // Say it creates an empty stack S
 
    // Run while Q is not empty
    while (!isEmpty(Q))
    {
        // deQueue an item from Q and push the dequeued item to S
        push(&S, deQueue(Q));
    }
 
    // Run while Stack S is not empty
    while (!isEmpty(&S))
    {
      // Pop an item from S and enqueue the popped item to Q
      enQueue(Q, pop(&S));
    }
}

1. Removes the last from Q
2. Keeps the Q same as it was before the call
3. Makes Q empty
4. Reverses the Q

1. When a resource is shared among multiple consumers
2. When data is transferred asynchronously (data not necessarily received at same rate as sent) between two processes
3. Load Balancing
4. All of the above

1. 1
2. 2
3. 3
4. 4

1. In push operation, if new nodes are inserted at the beginning of linked list, then in pop operation, nodes must be removed from end.
2. In push operation, if new nodes are inserted at the end, then in pop operation, nodes must be removed from the beginning.
3. Both of the above
4. None of the above

1. FIFO (First In First Out)
2. LIFO (Last In First Out)
3. Ordered array
4. Linear tree

1. Square Buffer
2. Ring Buffer
3. Rectangle Buffer
4. Curve Buffer

1. Ordinary queue
2. Single ended queue
3. Circular queue
4. Priority queue

1. A queue cannot be implemented using this stack.
2. A queue can be implemented where ENQUEUE takes a single instruction and DEQUEUE takes a sequence of two instructions.
3. A queue can be implemented where ENQUEUE takes a sequence of three instructions and DEQUEUE takes a single instruction.
4. A queue can be implemented where both ENQUEUE and DEQUEUE take a single instruction each.

1. ABCD
2. DCBA
3. DCAB
4. ABCD

1. rear=(rear%1)+MAX_SIZE
2. rear=rear%(MAX_SIZE+1)
3. rear=(rear+1)%MAX_SIZE
4. rear=rear+(1%MAX_SIZE)