linear queue using array

-

linear queue using array

linear queue using array linear queue using array linear queue using array linear queue using array linear queue using array linear queue using array linear queue using array linear queue using array

In this representation we take one variable array type to contain elements of queue,other side we use to variable as name FRONT and REAR which represent index value of array.
A queue is called underflow if both FRONT and REAR must be assigned with -1. It is called overflow if rare is equivalent to(size-1)


Implementation Queue using Array


#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
#include<process.h>
int queue[50],size,front=-1,rear=-1;
void insertion();//function prototype
void deletion();
void show();
 main()
{
    int choice;
    printf("enter the sixe of queue-");
    scanf("%d",&size);
    printf("enter choice===");
    do
    {
        system("cls");
        printf("press 1 for insert value in queue\npress 2 for delete value\npress 3 for show all element\n");
        scanf("%d",&choice);
        switch(choice)
        {
        case 1:
            insertion(); break;
           case 2:
               deletion(); break;
           case 3:
            show(); break;
           default:
            printf("Invalid choice!");
        }
       }
        while(choice>=1||choice<=3);

        system("pause");
    }



void insertion()
{
    int iteam;
    if(rear==size-1)
        printf("queue is overflow");
    else{
        printf("enter the vlaue of queue=");
        scanf("%d",&iteam);
        if(rear==-1)
            front=rear=0;
        else
            rear=rear+1;
        queue[rear]=iteam;
    }

}

void deletion()
{
    if(front==-1)
        printf("queue is underflow");
    else
    {
        printf("deleted element=%d",queue[front]);
        if(front==rear)
        front=rear=-1;
        else
            front=front+1;
    }
}

void show()
{
    int i;
    if( front==-1)
        printf("queue is underflow");
    else
    {
        printf("All element of queue=\n");
        for(i=front;i<=rear;i++)
        {
            printf("%d\t",queue[i]);
        }
       system("pause");
    }
}



I hope this post is helpful for you.
plzzz like and share my post........
now you can also follow me on facebook.


Comments

Post a Comment

Popular posts from this blog

python pattern programming

-
Image
PYTHON PATTERN PROGRAMMING Python nested loop: Python allow programmer to use nested loops.Nested loop means when one loop is define into another loop is known as nested loop,in which one is called inner loop and another is called outer loop.In which when outer loop's condition is true than inner loop will be execute. we use the concept of nested loop in pattern programming etc. syntax: while (condition):      while (condition):         statement x     statement y   Some examples of nested loop. Nested loop program. Q. write  a program to print following pattern. P P Y P Y T P Y T H P Y T H O P Y T H O N str = "PYTHON" for  i  in   range ( 0 , 6 ):      print ()      for  j  in   range ( 0 ,i+ 1 ):      ...
Read more

Searching and sorting in array

-
Image
                   Searching and sorting in array   Searching in array. It is a process in which we search particular element in array.  example:  program for searching a element in array. 10 20 30 40 50 0              1              2              3              4 In above example we can find any element of array. now  i am going to write code---- #include <stdio.h> #include <stdlib.h> void search( int a[],int size, int element) {     int i,flag=0;     for(i=0;i<size;i++)     {       if(a[i]==element)       { ...
Read more