Question

Write a C++ program to manage a list of students waiting to register for a course using a linked list. Operations should include adding a new student at the end of the list, adding a new student at the beginning of the list, removing a student from the beginning of the list, removing a student from the end of the list, and removing a student by name. Allow the user an option to exit.

NOTE: Functions/Methods must used throughout program. Function main() should be SMALL.

Be sure to use good programming methodology and keep your project modular.

Functions/Methods created and called:

- add student at the end of the list

- add student at the beginning of the list

- remove student from the end of the list

- remove student from the beginning of the list

- remove student by name

- display the list of students

- exit

Please keep main() function small

Answer 1

#include<iostream.h>

#include<string.h>

#include<stdio.h>

#include<stdlib.h>

#include<conio.h>

/*

* Node Declaration

*/

struct node

{

int id;

char name[50],course[50];

struct node *next;

}*start;

/*

* Class Declaration

*/

class single_llist

{

public:

node* create_node(int,char [],char []);

void insert_begin();

void insert_pos();

void insert_last();

void delete_name();

void delete_beg();

void delete_last();

void display();

single_llist()

{

start = NULL;

}

};

/*

* Main :contains menu

*/

main()

{

int choice, nodes, element, position, i;

single_llist sl;

start = NULL;

clrscr();

while (1)

{

cout<<endl<<"---------------------------------"<<endl;

cout<<endl<<"Operations on singly linked list"<<endl;

cout<<endl<<"---------------------------------"<<endl;

cout<<"1.Add Student at beginning"<<endl;

cout<<"2.Add Student at last"<<endl;

cout<<"3.Remove Student from Last"<<endl;

cout<<"4.Remove Student from beginning"<<endl;

cout<<"5.Remove Student by name"<<endl;

cout<<"6.Display Linked List"<<endl;

cout<<"7.Exit "<<endl;

cout<<"Enter your choice : ";

cin>>choice;

switch(choice)

{

case 1:

cout<<"Add Student Node at Beginning: "<<endl;

sl.insert_begin();

cout<<endl;

break;

case 2:

cout<<"Add Student Node at Last: "<<endl;

sl.insert_last();

cout<<endl;

break;

case 3:

cout<<"Delete Student from last "<<endl;

sl.delete_last();

break;

case 4:

cout<<"Delete Student from begin "<<endl;

sl.delete_beg();

break;

case 5:

cout<<"Delete Student by name "<<endl;

sl.delete_name();

break;

case 6:

cout<<"Display elements of link list"<<endl;

sl.display();

cout<<endl;

break;

case 7:

cout<<"Exiting..."<<endl;

exit(1);

break;

default:

cout<<"Wrong choice"<<endl;

}

}

}

/*

* Creating Node

*/

node *single_llist::create_node(int value,char n[50],char c[50])

{

struct node *temp, *s;

temp = new(struct node);

if (temp == NULL)

{

cout<<"Memory not allocated "<<endl;

return 0;

}

else

{

temp->id = value;

strcpy(temp->name,n);

strcpy(temp->course,c);

temp->next = NULL;

return temp;

}

}

/*

* Inserting element in beginning

*/

void single_llist::insert_begin()

{

int value;

char n[50],c[50];

cout<<"Enter the Id number to be registered: ";

cin>>value;

cout<<"Enter the name ";

gets(n);

cout<<"\n Enter the course name";

gets(c);

struct node *temp, *p;

temp = create_node(value,n,c);

if (start == NULL)

{

start = temp;

start->next = NULL;

}

else

{

p = start;

start = temp;

start->next = p;

}

cout<<"Element Inserted at beginning"<<endl;

}

/*

* Inserting Node at last

*/

void single_llist::insert_last()

{

int value;

char n[50],c[50];

cout<<"Enter the Id number to be registered: ";

cin>>value;

cout<<"Enter the name ";

gets(n);

cout<<"\n Enter the course name";

gets(c);

struct node *temp, *s;

temp = create_node(value,n,c);

s = start;

while (s->next != NULL)

{

s = s->next;

}

temp->next = NULL;

s->next = temp;

cout<<"Element Inserted at last"<<endl;

}

/*

* Delete when name is given

*/

void single_llist::delete_name()

{

int i, counter = 0;

char n[50];

if (start == NULL)

{

cout<<"List is empty"<<endl;

return;

}

cout<<"Enter the NAME TO DELETE: ";

gets(n);

struct node *s, *ptr;

s = start;

while (s != NULL)

{

s = s->next;

counter++;

}

s=start;

if(counter==1 && strcmp(n,s->name)==0)

{

start= s->next; free(s);

}

else

{

s=start;

ptr=start->next;

while(s!=NULL)

{

if(strcmp(n,ptr->name)==0)

{

s->next = ptr->next;

free(ptr);

}

else

{

s=s->next;

ptr=ptr->next;

}

}

}

}

/***DELETION OF A STUDENT FROM LAST***********/

void single_llist::delete_last()

{

int pos, i, counter = 0;

if (start == NULL)

{

cout<<"List is empty"<<endl;

return;

}

struct node *s, *ptr;

s = start;

while (s != NULL)

{

s = s->next;

counter++;

}

s = start;

if(counter==1)

{

start= s->next; free(s);

return;

}

cout<<"List having"<<counter<<"number of nodes";

s = start;

for (i = 1;i < counter;i++)

{

ptr = s;

s = s->next;

}

ptr->next = s->next;

free(s);

cout<<"Element Deleted"<<endl;

}

/******DELETE FROM THE BEGINNING***********/

void single_llist::delete_beg()

{

if (start == NULL)

{

cout<<"List is empty"<<endl;

return;

}

struct node *s, *ptr;

s = start;

start = s->next;

free(s);

cout<<"Element Deleted"<<endl;

}

/*

* Display Elements of a link list

*/

void single_llist::display()

{

struct node *temp;

if (start == NULL)

{

cout<<"The List is Empty"<<endl;

return;

}

temp = start;

cout<<"Elements of list are: "<<endl;

while (temp != NULL)

{

cout<<"\n "<<temp->id<<" "<<temp->name<<" "<<temp->course;

temp = temp->next;

}

}

OUTPUT