Dequeue Operation in DSA C - Build from Scratch

Dequeue Operation

📖 Scenario: Imagine you are managing a line of customers waiting for service. Sometimes customers leave from the front or the back of the line. You want to keep track of this line using a data structure called a dequeue (double-ended queue).

🎯 Goal: You will create a dequeue using an array, set its size, perform removal operations from both ends, and then print the current state of the dequeue.

📋 What You'll Learn

Create an array called dequeue with exactly these 5 integers: 10, 20, 30, 40, 50

Create an integer variable called size and set it to 5

Remove one element from the front and one element from the back of the dequeue

Print the remaining elements of the dequeue separated by spaces

💡 Why This Matters

🌍 Real World

Dequeue operations are useful in real-world scenarios like managing customer lines, undo-redo features in software, and task scheduling where elements can be added or removed from both ends.

💼 Career

Understanding dequeue operations is important for software developers working with data structures, especially in system design, performance optimization, and real-time processing.

1

Create the initial dequeue array

Create an integer array called dequeue with these exact values: 10, 20, 30, 40, 50

DSA C

// Your code here

Hint

Use array initialization syntax with the exact values inside curly braces.

2

Set the size of the dequeue

Create an integer variable called size and set it to 5

DSA C

int dequeue[5] = {10, 20, 30, 40, 50};
// Your code here

Hint

Declare an integer variable and assign it the value 5.

3

Remove elements from front and back

Remove one element from the front by increasing the start index and one element from the back by decreasing size. Use an integer variable start initialized to 0 to track the front index. Increase start by 1 and decrease size by 1 to remove elements from both ends.

DSA C

int dequeue[5] = {10, 20, 30, 40, 50};
int size = 5;
// Your code here

Hint

Use a variable start to track the front index and update it to remove the front element. Decrease size to remove the last element.

4

Print the current dequeue elements

Use a for loop with an integer variable i from start to size - 1 to print each element of dequeue separated by spaces.

DSA C

int dequeue[5] = {10, 20, 30, 40, 50};
int size = 5;
int start = 0;
start = start + 1;
size = size - 1;
// Your code here

Hint

Use a for loop to print elements from start to size - 1 with a space after each number.