linear queue

RDX Gaming answered on September 5, 2023 Popularity 3/10 Helpfulness 1/10

answer linear queue

related linear queue c

linear queue

Comment

#include<stdio.h>
#include<stdlib.h>
#define MAXSIZE 10
int Q[MAXSIZE],front=-1,rear=-1;
void qinsert(int x)
{
 if(rear==MAXSIZE-1)
  printf("\n Queue is Full.");
 else if(front==-1)
 {
  front=0;
  rear=0;
  Q[front]=x; 
 }
 else
 {
  rear++;
  Q[rear]=x;
 }
}
void qdelete()
{
 if(front==-1)
  printf("\n Queue is Empty.");
 else if(front==rear)
 {
  printf("\n %d is removed from Queue.",Q[front]);
  front=-1;
  rear=-1;
 }
 else
 {
  printf("\n %d is deleted from Queue.",Q[front]);
  front++;
 }
}
void display()
{
 int i;
 printf("\n The Queue elements are...\n");
 if(front==-1)
  printf("\n No elements in Queue.");
 else
 {
  for(i=front;i<=rear;i++)
   printf(" %d ",Q[i]);
 }
}
int main()
{
 int choice,x;
 while(1)
 {
  printf("\n 1.Data insert\n 2.Data Delete\n 3.Data Display\n 4.Exit");
  printf("\n Please, Enter your choice : ");
  scanf("%d",&choice);
  switch(choice)
  {
   case 1: printf("\n Please, Enter the element : ");
     scanf("%d",&x);
     qinsert(x);
     break;
   case 2: qdelete();
     break;
   case 3: display();
     break;
   case 4: exit(0);
   default : printf("\n wrong Choice.");
  }
 }
}

Popularity 3/10 Helpfulness 1/10 Language whatever

Source: programjoy.blogspot.com

Tags: queue whatever

Link to this answer
Share Copy Link

Contributed on Apr 07 2024

RDX Gaming

0 Answers Avg Quality 2/10

Closely Related Answers

linear queue c

Comment

#include <stdio.h>
#include<stdlib.h>
#define CAPACITY 50
 
void insert();
void delete();
void display();
int queue_array[CAPACITY];
int rear = - 1;
int front = - 1;
void main()
{
    int choice;
    while (1)
    {
        printf("1.Enter 1 to insert element to queue \n");
        printf("2.Enter 2 to delete element from queue \n");
        printf("3.Enter 3 to display all elements of queue \n");
        printf("4.Enter 4 to quit \n");
        printf("Enter your choice : ");
        scanf("%d", &choice);
        switch (choice)
        {
            case 1:
            insert();
            break;
            case 2:
            delete();
            break;
            case 3:
            display();
            break;
            case 4:
            exit(1);
            default:
            printf("Wrong choice \n");
        } 
    } 
} 
 
void insert()
{
    int element;
    if (rear == CAPACITY - 1)
    printf("Queue is full\n");
    else
    {
        if (front == - 1)
        
        front = 0;
        printf("Enter element which is to be inserted ");
        scanf("%d", &element);
        rear = rear + 1;
        queue_array[rear] = element;
    }
} /* End of insert() */
 
void delete()
{
    if (front == - 1 || front > rear)
    {
        printf("Queue is empty we cannot delete an element  \n");
        return ;
    }
    else
    {
        printf("Element deleted from queue is : %d\n", queue_array[front]);
        front = front + 1;
    }
} /* End of delete() */
 
void display()
{
    int i;
    if (front==-1 || front > rear)
        printf("Queue is empty \n");
    else
    {
        printf("Elements of Queue are: \n");
        for (i = front; i <= rear; i++)
            printf("%d ", queue_array[i]);
        printf("\n");
    }
}

Popularity 6/10 Helpfulness 5/10 Language c

Source: www.tutorialandexample.com

Tags: c queue

Link to this answer
Share Copy Link

Contributed on Sep 05 2023

GodsTheGuy

0 Answers Avg Quality 2/10

linear queue

Contents

More Related Answers

linear queue

Closely Related Answers

linear queue c

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.