IMPLEMENTATION OF QUEUE BY ARRAY : C PROGRAM

 


Here is the C program for implementation of queue using array. 

Queue is a data structure. 

program code :

#include<stdio.h>

#include<stdlib.h>


int que[6],f=-1;r=-1;


void enque(int d)

{

    if(f==5)

    {

        printf("queue is full,enque not possible.\n");

        return;

    }

    if(f==-1)

    {

        f=r=0;

        que[r]=d;

    }

    else{

        r++;

        que[r]=d;

    }

}


void deque()

{

    if(f==-1){

        printf("list is empty,deletion not possible\n");

        return;

    }

    if(f==r){

        printf("deleted element is %d\n",que[r]);

        f=r=-1;

    }

    else{

        printf("deleted element is %d\n.",que[f]);

        f++;

        return;

    }

}


void display()

{

    int i;

    if(f==-1){

        printf("queue is empty.\n");

        return;

    }

    printf("queue elements are : ");

    for(i=f;i<=r;i++)

        printf("%d ",que[i]);

    printf("\n");

}


int main()

{

    int op,d,exit=0;

    do

    {

        printf("1.enqueue  2.dequeue  3.display  4.exit\n");

        printf("enter your choice : ");

        scanf("%d",&op);

        switch(op)

        {

        case 1:

            printf("enter data : ");

            scanf("%d",&d);

            enque(d);

            break;

        case 2:

            deque();

            break;

        case 3:

            display();

            break;

        case 4:

            exit=1;

            break;

        default:

            printf("enter valid key\n");

            break;

        }

    }while(exit==0);

}

output:


Happy coding, 

Comment what you need 🙂. 


Comments

Post a Comment

Popular posts from this blog

infix to postfix expression converter in "C" language

 program: #include<stdio.h> void infix_to_postfix(char[],char[]); int precedence(char); void main() { char infix[20],postfix[20]; printf("enter infix string : "); scanf("%s",infix); infix_to_postfix(infix,postfix); printf("\npostfix exp= %s",postfix); } void infix_to_postfix(char infix[],char postfix[]) { char s[20],symbol; int top=-1,i=0,j=0; while(infix[i]!='\0') { symbol=infix[i]; switch(symbol) { case '(':++top;          s[top]=symbol;          break;     case ')':while(s[top]!='(')              {               postfix[j++]=s[top];               top--; }           top--;           break;     case '+':     case '-':     case '*':     case '...
Read more

swapping first and last digits of a number :Python Program

Image
  Here is the program for swapping first and last digits of a number in Python programming language program code : n=int(input("number:")) last=n%10 n=int(n/10) n1=str(n) n2=str(1) n6=str(1) for i in range(len(n1)-1):     n2=n2+str(0)     n6=n6+str(0) n6=int(n6) n2=int(n2) n5=int(n/n6) n3=n%n2 print(n5) n4=str(last)+str(n3)+str(n5) print(int(n4)) output : enter number :284517 784512 happy coding. comment what you need.
Read more

DOUBLE LINKED LIST IMPLEMENTATION

Image
welcome to yocoding, a place where you can find what you need, if not comment what you need.   CODE :  #include<stdio.h> #include<conio.h> #include<stdlib.h> struct Node {   int data;   struct Node *prev,*next; }; struct Node *head=NULL; void insert_beg(int d) {     struct Node *p;     p= (struct Node*)malloc(sizeof(struct Node));     p->data=d;     p->prev=NULL;     if(head == NULL)     {        p->next = NULL;        head=p;     }     else     {        p->next=head;        head->prev=p;        head=p;     } } void insert_end(int d) {    struct Node *p;    p=(struct Node*)malloc(sizeof(struct Node));    p->data=d;    p->next = NULL;    if(head == NULL)    {   ...
Read more