EXPERIMENT NUMBER –1.

Student Name: PRAVESH AZAN UID: 19BCS2979

Branch: CSE Section/Group: A
Semester: 3rd Date of Performance: 22/06/23
Subject Name: DSA Subject Code:CSP231

AIM OF THE EXPERIMENT -

Write a menu driven program that maintains a linear linked list whose elements are
stored in on ascending order and implements the following operations (using
separate functions):

a) Insert a new element

b) Delete an existing element

c) Search an element

d) Display all the elements

PROGRAM CODE-
YOUR PROGRAM CODE HERE

#include <iostream>

using namespace std;

struct Node
{
int info;
Node *link;
}*start;
void insert();
void display();
void search();
void delete_element();
int main()
SUBJECT NAME-Data Structures SUBJECT CODE-CSP231
 {
int ch,
flag=0;

start=NULL;

while(flag!=1)
{ cout<<"\nENTER YOUR CHOICE \n";
cout<<"1)INSERT A NEW ELEMENT\n";
cout<<"2)DELETE AN ELEMENT\n";
cout<<"3)SEARCH AN ELEMENT\n";
cout<<"4)DISPLAY ELEMENT\n";
cout<<"5)Exit:\n";

cin>>ch;
switch (ch)
{
case 1:
insert();
break;
case 2:
delete_element();
break;
case 3:
search();
break;
case 4:
display();
break;
case 5:
flag=1;
break;
default:
SUBJECT NAME-Data Structures SUBJECT CODE-CSP231
 cout<<"invalid choice"<<endl;
break;

}
}

}
void insert()
{

Node *temp=new Node;

cout<<"enter info";

cin>>temp->info;
temp->link=NULL;

if(start==NULL)
{
start=temp;
return;
}
else
{
struct Node *p=start;
while(p->link!=NULL)
{
p=p->link;
}
p->link=temp;
}

}
void display()
SUBJECT NAME-Data Structures SUBJECT CODE-CSP231
 {
struct Node* ptr=start;
cout<<"elements are"<<endl;

while(true)
{
cout<<ptr->info<<endl;
if(ptr->link==NULL)
{
break;
}

ptr=ptr->link;
}
}
void delete_element()
{
struct Node *prev=NULL;
struct Node *end=start;
while(end->link)
{
prev=end;
end=end->link;
}
prev->link=NULL;
delete end;
cout<<"ELEMENT DELETED"<<endl;
}
void search()
{
int elem,fg=0;
struct Node *current=start;
cout<<"enter element to be searched"<<endl;
cin>>elem;
SUBJECT NAME-Data Structures SUBJECT CODE-CSP231
 while(current!=NULL)
{
if(current->info==elem)
{
fg=1;
break;
}
current=current->link;
}
if(fg==1)
{
cout<<"ELEMENT FOUND"<<endl;

}
else
{
cout<<"ELEMENT NOT FOUND"<<endl;
}
}
OUTPUT:

SUBJECT NAME-Data Structures SUBJECT CODE-CSP231

 Evaluation Grid :

Sr. No. Parameters Marks Obtained Maximum Marks

1. Student Performance 12
(Conduct of experiment)
objectives/Outcomes.
2. Viva Voce 10
3. Submission of Work Sheet 8
(Record)
Total 30

SUBJECT NAME-Data Structures SUBJECT CODE-CSP231