circular queue implementation in c

By lakahman malviya
// Circular Queue implementation in C

#include <stdio.h>

#define SIZE 5

int items[SIZE];
int front = -1, rear = -1;

// Check if the queue is full
int isFull() {
  if ((front == rear + 1) || (front == 0 && rear == SIZE - 1)) return 1;
  return 0;
}

// Check if the queue is empty
int isEmpty() {
  if (front == -1) return 1;
  return 0;
}

// Adding an element
void enQueue(int element) {
  if (isFull())
    printf("\n Queue is full!! \n");
  else {
    if (front == -1) front = 0;
    rear = (rear + 1) % SIZE;
    items[rear] = element;
    printf("\n Inserted -> %d", element);
  }
}

// Removing an element
int deQueue() {
  int element;
  if (isEmpty()) {
    printf("\n Queue is empty !! \n");
    return (-1);
  } else {
    element = items[front];
    if (front == rear) {
      front = -1;
      rear = -1;
    } 
    // Q has only one element, so we reset the 
    // queue after dequeing it. ?
    else {
      front = (front + 1) % SIZE;
    }
    printf("\n Deleted element -> %d \n", element);
    return (element);
  }
}

// Display the queue
void display() {
  int i;
  if (isEmpty())
    printf(" \n Empty Queue\n");
  else {
    printf("\n Front -> %d ", front);
    printf("\n Items -> ");
    for (i = front; i != rear; i = (i + 1) % SIZE) {
      printf("%d ", items[i]);
    }
    printf("%d ", items[i]);
    printf("\n Rear -> %d \n", rear);
  }
}

int main() {
  // Fails because front = -1
  deQueue();

  enQueue(1);
  enQueue(2);
  enQueue(3);
  enQueue(4);
  enQueue(5);

  // Fails to enqueue because front == 0 && rear == SIZE - 1
  enQueue(6);

  display();
  deQueue();

  display();

  enQueue(7);
  display();

  // Fails to enqueue because front == rear + 1
  enQueue(8);

  return 0;
}

Comments

Post a Comment

Popular posts from this blog

250+ C Programs for Practice

By lakahman malviya
250+ C Programs for Practice PDF Free Download 1. Simple C Questions ● Area and Circumference of a Circle ● Print Ascii Value of the Character ● Area of Triangle ● Convert a Person’s Name in Abbreviated ● Simple Interest ● Gross Salary of an Employee ● Percentage of 5 Subjects ● Converting Temperature Celsius into Fahrenheit ● The Display Size of the Different Data Type ● Factorial of a Given Number ● Read Integer (N) and Print the First Three Powers (N^1, N^2, N^3) ● Area of a Circle ● LCM of Two Numbers ● GCD of Two Numbers 2. If/Else Statement ● The Greatest Number Among the Given Three Number ● The Number Is Positive or Negative ● Character Is Vowel or Consonant ● A Character Is an Alphabet or Not ● Uppercase, Lowercase, Special Character, or Digit ● The Number Is Positive or Negative ● The Number Is Even or Odd ● Greatest of Two Numbers ● Greatest Among Three Numbers ● Leap Year ● The Date Is Correct or Not ● Voting Eligibility Checker ● Find the maximum between two numbers. ● Fin...
Read more

FUNCTION OVERRIDING IN CPP

By lakahman malviya
  #include<conio.h> #include<iostream> using namespace std; class overriding {     int age;     public:          void over(){         cout<<"Enter your age :"<<endl;         cin>>age;         cout<<"Age: "<<age;              } }; class override{       char name[20];       public:       void over(){                cout<<"Enter your name "<<endl;     cin>>name;     cout<<"Name :"<<name; }       }; int main(){     overriding obj1;     obj1.over();          override obj;     obj.over();           return 0;      }
Read more