Scribd Logo
Upload

Welcome to Scribd!

  • Program No - 9 Roll No - 2309030 / Write A Program To Implement Queue Using Pointers

    Uploaded by

    Shubham Kharbanda
    6 views3 pages
    This program implements a queue using pointers in C. It defines a node structure with an info field to store data and a next pointer. Global pointers front and rear are used to track the first and last nodes. Functions are defined to insert nodes at the rear and delete nodes from the front. The main function displays a menu to insert or delete nodes and calls the appropriate functions in a loop until the user exits.

    Original Description:

    Original Title

    Program 9

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This program implements a queue using pointers in C. It defines a node structure with an info field to store data and a next pointer. Global pointers front and rear are used to track the first and last nodes. Functions are defined to insert nodes at the rear and delete nodes from the front. The main function displays a menu to insert or delete nodes and calls the appropriate functions in a loop until the user exits.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as doc, pdf, or txt
    6 views3 pages

    Program No - 9 Roll No - 2309030 / Write A Program To Implement Queue Using Pointers

    Uploaded by

    Shubham Kharbanda
    This program implements a queue using pointers in C. It defines a node structure with an info field to store data and a next pointer. Global pointers front and rear are used to track the first and last nodes. Functions are defined to insert nodes at the rear and delete nodes from the front. The main function displays a menu to insert or delete nodes and calls the appropriate functions in a loop until the user exits.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as doc, pdf, or txt
    of 3

    PROGRAM NO-->9 ROLL NO->2309030

    / *WRITE A PROGRAM TO IMPLEMENT QUEUE USING POINTERS *\

    #include <stdio.h>
    #include <conio.h>
    #include<stdlib.h>
    #include<malloc.h>
    int a,n;
    void insert(int);
    int delete();
    struct node
    {
    int info;
    struct node*next;
    };
    typedef struct node node;
    node*f =NULL,node*r=NULL;
    void main()
    {
    int c;
    clrscr();
    printf("1:insert \n");
    printf("2:delete \n");
    printf("3:exit \n");
    while(1)
    {
    printf("enter the c");
    scanf("%d",&c);
    switch(c)
    {
    case 1:
    printf("enter the num to be insert");
    scanf("%d",&n);
    push(n);
    break;
    case 2:n=pop();
    if(n!=-1)
    printf("\nelement deleted:%d",n);
    else
    printf("\nqueue is empty");
    break;
    case 3:exit(0);
    default:printf("wrong choice");
    break;
    }
    }
    }

    1
    PROGRAM NO-->9 ROLL NO->2309030

    / *WRITE A PROGRAM TO IMPLEMENT QUEUE USING POINTERS *\


    void insert(int x)
    {
    node*s;
    s=(node*)malloc(sizeof(node));
    s->info=x;
    s->next=NULL;
    if(r!= NULL)
    r->next=s;
    r=s;
    }
    else
    {
    f=s;
    r=s;
    }
    }
    int delete()
    {
    int x;
    node*q;
    if(f!=NULL)
    {
    x=f->info;
    q=f;
    f=f->next;
    free(q);
    else
    {
    f=r= NULL;
    x= NULL;
    }
    return(x);
    }

    2
    PROGRAM NO-->9 ROLL NO->2309030

    / *WRITE A PROGRAM TO IMPLEMENT QUEUE USING POINTERS *\

    /*OUTPUT*\

    You might also like