https://www.bybit.com/register?affiliate_id=38000&group_id=52135&group_type=1
[856x508] Get $90 Rewards

C Programming code | All operations on Students linked lists | Data Structure

Write a Modular C Programming code for All Operations Student Details -> Name, R.no, Marks ( inserting at the beginning & End | deleting from beginning & end | Display & exit) used in Nodes of Singly linked list | Data Structure.

The Program should be like a Menu card:(using case numbers)  The code should perform the operation which is given by the user.

Read & Delete the Student Data given to the node. 

Refer to Notes: Notes on Data Structures And Algorithms – Linked List

CODE:

#include<stdio.h>
#include<stdlib.h>
struct student
{
 char name[30];
 int rno;
 float marks;
 struct student *next;
};
struct student *head;
struct student* insert_at_beg(struct student *);
struct student* insert_at_end(struct student *);
struct student* delete_at_beg(struct student *);
struct student* delete_at_end(struct student *);
void display(struct student *);
struct student *temp,*temp1,*newstudent;
main()
{
int ch;
head=NULL;


   while(1)
   {
     printf("\n+++++++++++++++++++++++++++++++++++++++++++++\n");
     printf("1) insert at the begining\n");
     printf("2) insert at the end\n");
     printf("3) delete from begining\n");
     printf("4) delete from the end\n");
     printf("5) display the linked list\n");
     printf("6) exit\n");
     printf("+++++++++++++++++++++++++++++++++++++++++++++\n");

     printf("\n--> Enter your choice: ");
     scanf("%d",&ch);
     switch(ch)
     {
      case 1:newstudent=(struct student*)malloc(sizeof(struct student));
             printf("Enter the Student name roll no and marks\n");
             scanf("%s%d%f",&newstudent->name,&newstudent->rno,&newstudent->marks);
             head=insert_at_beg(newstudent);
             break;
    case 2: newstudent=(struct student*)malloc(sizeof(struct student));
             printf("Enter the Student name roll no and marks\n");
             scanf("%s%d%f",&newstudent->name,&newstudent->rno,&newstudent->marks);
             head=insert_at_end(newstudent);
             break;
    case 3: if(head==NULL)
             printf("NO STUDENT PRESENT---cant delete\n");
             else
             {
                head=delete_at_beg(head);
             }
             break;
    case 4: if(head==NULL)
             printf("NO STUDENT PRESENT---cant delete\n");
             else
             {
                head=delete_at_end(head);
             }
             break;
    case 5: display(head);break;
    case 6: exit(0);break;
    default: printf("Invalid choice\n");
     }
   }
}

struct student* insert_at_beg(struct student *newstudent)
{
   if(head==NULL)
   {
     head=newstudent;
     head->next=NULL;
     return(head);
   }
   else
   {
     newstudent->next=head;
     head=newstudent;
     return(head);
   }
}


struct student* insert_at_end(struct student *newstudent)
{
   if(head==NULL)
   {
     head=newstudent;
     head->next=NULL;
     return(head);
   }
   else
   {
     temp=head;
     while(temp->next!=NULL)
     {
        temp=temp->next;

     }
     temp->next=newstudent;
        newstudent->next=NULL;
        return(head);

   }
}

void display(struct student *head)
{
   if(head==NULL)
   {
     printf("NO STUDENT PRESENT\n");
   }
   else
   {
      temp=head;
      while(temp!=NULL)
      {
         printf("Name=%s\t RNo=%d\t Marks=%f\n",temp->name,temp->rno,temp->marks);
         temp=temp->next;
      }
      printf("\n");
   }
}

struct student* delete_at_beg(struct student *head)
{
    if(head==NULL)
    {
        printf("NO STUDENT PRESENT---cant delete\n\n");
    }
    else
    {
       if(head->next==NULL)
       {
           printf("student deleted==>name=%s\t rno=%d\t marks=%f\n",head->name,head->rno,head->marks);
           free(head);
           head=NULL;
           return(head);
       }
       else
       {
           temp=head;
           head=head->next;
           printf("student deleted==>name=%s\t rno=%d\t marks=%f\n",temp->name,temp->rno,temp->marks);
           free(temp);
           return(head);

       }
    }

}


struct student* delete_at_end(struct student *head)
{
    if(head==NULL)
    {
        printf("NO STUDENT PRESENT---cant delete\n");
    }
    else
    {
       if(head->next==NULL)
       {
            printf("student deleted==>name=%s\t rno=%d\t marks=%f\n",head->name,head->rno,head->marks);
           free(head);
           head=NULL;
           return(head);
       }
       else
       {
           temp=head;

           while(temp->next!=NULL)
           {
               temp1=temp;
               temp=temp->next;
           }
          printf("student deleted==>name=%s\t rno=%d\t marks=%f\n",temp->name,temp->rno,temp->marks);
           free(temp);
           temp1->next=NULL;
           return(head);

       }
    }

}


OUTPUT

+++++++++++++++++++++++++++++++++++++++++++++
1) insert at the beginning
2) insert at the end
3) delete from begining
4) delete from the end
5) display the linked list
6) exit
+++++++++++++++++++++++++++++++++++++++++++++

--> Enter your choice: 1
Enter the Student name roll no and marks
Jimmy
99
520

+++++++++++++++++++++++++++++++++++++++++++++
1) insert at the beginning
2) insert at the end
3) delete from beginning
4) delete from the end
5) display the linked list
6) exit
+++++++++++++++++++++++++++++++++++++++++++++

--> Enter your choice: 2
Enter the Student name roll no and marks
MrBeast
100
600

+++++++++++++++++++++++++++++++++++++++++++++
1) insert at the beginning
2) insert at the end
3) delete from beginning
4) delete from the end
5) display the linked list
6) exit
+++++++++++++++++++++++++++++++++++++++++++++

--> Enter your choice: 5
Name=Jimmy       RNo=99  Marks=520.000000
Name=MrBeast     RNo=100         Marks=600.000000


+++++++++++++++++++++++++++++++++++++++++++++
1) insert at the beginning
2) insert at the end
3) delete from beginning
4) delete from the end
5) display the linked list
6) exit
+++++++++++++++++++++++++++++++++++++++++++++

--> Enter your choice: 3
student deleted==>name=Jimmy     rno=99  marks=520.000000

+++++++++++++++++++++++++++++++++++++++++++++
1) insert at the beginning
2) insert at the end
3) delete from beginning
4) delete from the end
5) display the linked list
6) exit
+++++++++++++++++++++++++++++++++++++++++++++

--> Enter your choice: 4
student deleted==>name=MrBeast   rno=100         marks=600.000000

+++++++++++++++++++++++++++++++++++++++++++++
1) insert at the beginning
2) insert at the end
3) delete from beginning
4) delete from the end
5) display the linked list
6) exit
+++++++++++++++++++++++++++++++++++++++++++++

--> Enter your choice: 6

Process returned 0 (0x0)   execution time : 66.901 s
Press any key to continue.

© Credits

Anushika Kothari (1)
'H' div
Department of Computer Science


(  ) — Number of Contributions!

 

Please find some more codes of 1D Arrays, 2D Arrays, Strings, Pointers, Data Structures, Files, Linked lists, and MISC on the below page:

Top 100+ C Programming codes – KLE Technological University

 

Leave a Comment