Scribd Logo
Upload

Welcome to Scribd!

  • 28 views

    Acp Part B Programs

    Uploaded by

    Vaibhav Patil
    The document contains 5 code examples (labeled B1 through B5) that implement different data structures using arrays and linked lists in C. B1 implements a stack using an array. B2 implements a queue using an array. B3 creates and displays a singly linked list of integers. B4 implements a stack using a linked list. B5 implements a queue using a linked list. Each code example contains functions to insert, remove and display elements from the respective data structure.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Acp Part B Programs

    Uploaded by

    Vaibhav Patil
    28 views10 pages
    The document contains 5 code examples (labeled B1 through B5) that implement different data structures using arrays and linked lists in C. B1 implements a stack using an array. B2 implements a queue using an array. B3 creates and displays a singly linked list of integers. B4 implements a stack using a linked list. B5 implements a queue using a linked list. Each code example contains functions to insert, remove and display elements from the respective data structure.

    Original Description:

    Advance C Programming

    Original Title

    ACP_PART_B_PROGRAMS

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document contains 5 code examples (labeled B1 through B5) that implement different data structures using arrays and linked lists in C. B1 implements a stack using an array. B2 implements a queue using an array. B3 creates and displays a singly linked list of integers. B4 implements a stack using a linked list. B5 implements a queue using a linked list. Each code example contains functions to insert, remove and display elements from the respective data structure.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    28 views10 pages

    Acp Part B Programs

    Uploaded by

    Vaibhav Patil
    The document contains 5 code examples (labeled B1 through B5) that implement different data structures using arrays and linked lists in C. B1 implements a stack using an array. B2 implements a queue using an array. B3 creates and displays a singly linked list of integers. B4 implements a stack using a linked list. B5 implements a queue using a linked list. Each code example contains functions to insert, remove and display elements from the respective data structure.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 10

    /*B1. Write C program to implement stack of integers using array.

    */
    #include <stdio.h>
    #include <stdlib.h>

    #define MAX 10

    int STACK[MAX],TOP;
    /* display stack element*/
    void display(int [ ]);

    /* push (insert) item into stack*/


    void PUSH(int [ ],int);

    /* pop (remove) item from stack*/


    void POP (int [ ]);

    void main( )
    {
    int ITEM=0;
    int choice=0;
    TOP=-1;

    while(1)
    {
    printf("Enter Choice (1: display, 2: insert (PUSH), 3: remove(POP)),
    4: Exit..:");
    scanf("%d",&choice);

    switch(choice)
    {
    case 1:
    display(STACK);
    break;
    case 2:
    printf("Enter Item to be insert :");
    scanf("%d",&ITEM);
    PUSH(STACK,ITEM);
    break;
    case 3:
    POP(STACK);
    break;
    case 4:
    exit(0);
    default:
    printf("\nInvalid choice.");
    break;
    }
    getch();
    }// end of while(1)

    }
    /* function : display(),
    to display stack elements.
    */
    void display(int stack[])
    {
    int i=0;
    if(TOP==-1)
    {
    printf("Stack is Empty .\n");
    return;
    }

    printf("%d <-- TOP ",stack[TOP]);


    for(i=TOP-1;i >=0;i--)
    {
    printf("\n%d",stack[i]);
    }
    printf("\n\n");
    }

    /* function : PUSH( ),
    to push an item into stack.
    */
    void PUSH(int stack[],int item)
    {
    if(TOP==MAX-1)
    {
    printf("\nSTACK is FULL CAN't ADD ITEM\n");
    return;
    }
    TOP++;
    stack[TOP]=item;
    }

    /* function : POP(),
    to pop an item from stack.
    */
    void POP(int stack[])
    {
    int deletedItem;
    if(TOP==-1)
    {
    printf("STACK is EMPTY.\n");
    return;
    }

    deletedItem=stack[TOP];
    TOP--;
    printf("%d deleted successfully\n",deletedItem);
    return;
    }

    /* B2. Write C program to implement linear queue of integers using array


    */
    #include<stdio.h>
    #include<stdlib.h>
    #define n 5
    int main()
    {
    int queue[n],ch=1,front=0,rear=0,i,j=1,x=n;
    printf("Queue using Array");
    printf("\n1.Insertion \n2.Deletion \n3.Display \n4.Exit");
    while(ch)
    {
    printf("\nEnter the Choice:");
    scanf("%d",&ch);
    switch(ch)
    {
    case 1:
    if(rear==x)
    printf("\n Queue is Full");
    else
    {
    printf("\n Enter no %d:",j++);
    scanf("%d",&queue[rear++]);
    }
    break;
    case 2:
    if(front==rear)
    {
    printf("\n Queue is empty");
    }
    else
    {
    printf("\n Deleted Element is %d",queue[front++]);
    x++;
    }
    break;
    case 3:
    printf("\nQueue Elements are:\n ");
    if(front==rear)
    printf("\n Queue is Empty");
    else
    {
    for(i=front; i<rear; i++)
    {
    printf("%d",queue[i]);
    printf("\n");
    }
    break;
    case 4:
    exit(0);
    default:
    printf("Wrong Choice: please see the options");
    }
    }
    }
    return 0;
    }

    /* https://www.w3resource.com/c-programming-exercises/linked_list/c-
    linked_list-exercise-1.php
    B3. Write C program to create & display singly linked list of integers */
    #include <stdio.h>
    #include <stdlib.h>

    struct node
    {
    int num; //Data of the node
    struct node *nextptr; //Address of the next node
    }*stnode;

    void createNodeList(int n); // function to create the list


    void displayList(); // function to display the list

    int main()
    {
    int n;
    printf("\n\n Linked List : To create and display Singly Linked
    List :\n");
    printf("----------------------------------------------------------
    ---\n");

    printf(" Input the number of nodes : ");


    scanf("%d", &n);
    createNodeList(n);
    printf("\n Data entered in the list : \n");
    displayList();
    return 0;
    }
    void createNodeList(int n)
    {
    struct node *fnNode, *tmp;
    int num, i;
    stnode = (struct node *)malloc(sizeof(struct node));

    if(stnode == NULL) //check whether the fnnode is NULL and if so no


    memory allocation
    {
    printf(" Memory can not be allocated.");
    }
    else
    {
    // reads data for the node through keyboard

    printf(" Input data for node 1 : ");


    scanf("%d", &num);
    stnode->num = num;
    stnode->nextptr = NULL; // links the address field to NULL
    tmp = stnode;
    // Creating n nodes and adding to linked list
    for(i=2; i<=n; i++)
    {
    fnNode = (struct node *)malloc(sizeof(struct node));
    if(fnNode == NULL)
    {
    printf(" Memory can not be allocated.");
    break;
    }
    else
    {
    printf(" Input data for node %d : ", i);
    scanf(" %d", &num);

    fnNode->num = num; // links the num field of fnNode with num


    fnNode->nextptr = NULL;// links the address field of fnNode
    with NULL

    tmp->nextptr = fnNode; // links previous node i.e. tmp to


    the fnNode
    tmp = tmp->nextptr;
    }
    }
    }
    }
    void displayList()
    {
    struct node *tmp;
    if(stnode == NULL)
    {
    printf(" List is empty.");
    }
    else
    {
    tmp = stnode;
    while(tmp != NULL)
    {
    printf(" Data = %d\n", tmp->num); // prints the data of
    current node
    tmp = tmp->nextptr; // advances the position
    of current node
    }
    }
    }

    /* B4. Write C program to implement stack using linked list */


    #include <stdio.h>
    #include <stdlib.h>
    void push();
    void pop();
    void display();
    struct node
    {
    int val;
    struct node *next;
    };
    struct node *head;

    void main ()
    {
    int choice=0;
    printf("\n*********Stack operations using linked list*********\n");
    printf("\n----------------------------------------------\n");
    while(choice != 4)
    {
    printf("\n\nChose one from the below options...\n");
    printf("\n1.Push\n2.Pop\n3.Show\n4.Exit");
    printf("\n Enter your choice \n");
    scanf("%d",&choice);
    switch(choice)
    {
    case 1:
    {
    push();
    break;
    }
    case 2:
    {
    pop();
    break;
    }
    case 3:
    {
    display();
    break;
    }
    case 4:
    {
    printf("Exiting....");
    break;
    }
    default:
    {
    printf("Please Enter valid choice ");
    }
    };
    }
    }
    void push ()
    {
    int val;
    struct node *ptr = (struct node*)malloc(sizeof(struct node));
    if(ptr == NULL)
    {
    printf("not able to push the element");
    }
    else
    {
    printf("Enter the value");
    scanf("%d",&val);
    if(head==NULL)
    {
    ptr->val = val;
    ptr -> next = NULL;
    head=ptr;
    }
    else
    {
    ptr->val = val;
    ptr->next = head;
    head=ptr;

    }
    printf("Item pushed");

    }
    }

    void pop()
    {
    int item;
    struct node *ptr;
    if (head == NULL)
    {
    printf("Underflow");
    }
    else
    {
    item = head->val;
    ptr = head;
    head = head->next;
    free(ptr);
    printf("Item popped");

    }
    }
    void display()
    {
    int i;
    struct node *ptr;
    ptr=head;
    if(ptr == NULL)
    {
    printf("Stack is empty\n");
    }
    else
    {
    printf("Printing Stack elements \n");
    while(ptr!=NULL)
    {
    printf("%d\n",ptr->val);
    ptr = ptr->next;
    }
    }
    }

    /* B5. Write C program to implement queue using linked list */


    #include<stdio.h>
    #include<stdlib.h>
    struct node
    {
    int data;
    struct node *next;
    };
    struct node *front;
    struct node *rear;
    void insert();
    void delete();
    void display();
    void main ()
    {
    int choice;
    while(choice != 4)
    {
    printf("\n*************************Main
    Menu*****************************\n");

    printf("\n=================================================================\
    n");
    printf("\n1.insert an element\n2.Delete an element\n3.Display the
    queue\n4.Exit\n");
    printf("\nEnter your choice ?");
    scanf("%d",& choice);
    switch(choice)
    {
    case 1:
    insert();
    break;
    case 2:
    delete();
    break;
    case 3:
    display();
    break;
    case 4:
    exit(0);
    break;
    default:
    printf("\nEnter valid choice??\n");
    }
    }
    }
    void insert()
    {
    struct node *ptr;
    int item;

    ptr = (struct node *) malloc (sizeof(struct node));


    if(ptr == NULL)
    {
    printf("\nOVERFLOW\n");
    return;
    }
    else
    {
    printf("\nEnter value?\n");
    scanf("%d",&item);
    ptr -> data = item;
    if(front == NULL)
    {
    front = ptr;
    rear = ptr;
    front -> next = NULL;
    rear -> next = NULL;
    }
    else
    {
    rear -> next = ptr;
    rear = ptr;
    rear->next = NULL;
    }
    }
    }
    void delete ()
    {
    struct node *ptr;
    if(front == NULL)
    {
    printf("\nUNDERFLOW\n");
    return;
    }
    else
    {
    ptr = front;
    front = front -> next;
    free(ptr);
    }
    }
    void display()
    {
    struct node *ptr;
    ptr = front;
    if(front == NULL)
    {
    printf("\nEmpty queue\n");
    }
    else
    { printf("\nprinting values .....\n");
    while(ptr != NULL)
    {
    printf("\n%d\n",ptr -> data);
    ptr = ptr -> next;
    }
    }
    }

    You might also like