Wrap Around Demonstration

Medium Circular Queue PRO

🔒 Login to Unlock

Problem Statement

Write a C program to demonstrate the wrap-around property of a circular queue after sequential enqueues and dequeues.

Input Format

Capacity, operations sequence: enqueues and dequeues.

Output Format

Print final queue state from front to rear.

Constraints

1 <= capacity <= 50

Sample Input

Sample Output

20 30 40

Explanation

Perform enqueues and dequeues demonstrating index wrap-around in the fixed circular buffer array.

Starter Code

#include <stdio.h>
#include <stdlib.h>

int main() {
    int cap, ops;
    if (scanf("%d %d", &cap, &ops) == 2) {
        // Write your code here to demonstrate wrap-around
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

🔒 Login to Unlock