Answer Posted / soumya

Represent a list of integers as singly linked list. Write
functions for ADD, DELETE and SEARCH operations.
#include<iostream>
using namespace std;
class student
{
int age;
student *nxt;
public:
void add_at_front();
void add_at_end();
void add_at_any();
void del_at_front();
void del_at_end();
void del_at_any();
void display();
void search();
};
student *start=NULL;
void student::add_at_front()
{
student *s1;
s1=new student;
cout<<"Enter the age";
cin>>s1-­>age;
s1-­>nxt=start;
start=s1;
}
void student:: add_at_end()
{
student *s1;
s1=new student;
cout<<"Enter the age";
cin>>s1-­>age;
s1­>nxt=NULL;
if(start==NULL)
{
start=s1;
}
else
{
student *temp;
temp=new student;
temp=start;
while(temp­->nxt!=NULL)
{
temp=temp-­>nxt;
}
temp­->nxt=s1;
}
}
void student::add_at_any()
{
student *s1;
s1=new student;
int x;
cout<<"Enter age of the node you want to specify:";
cin>>x;
cout<<"Enter the age of the new node";
cin>>s1­>age;
student *temp;
temp=new student;
temp=start;
while((temp­->age!=x)&&(temp-­>nxt!=NULL))
{
temp=temp-­>nxt;
}
if(temp-­>nxt=NULL)
{
cout<<"Error";
}
else
{
s1­->nxt=temp­->nxt;
temp-­>nxt=s1;
}
}
void student::del_at_front()
{
student *temp;
if(start==NULL)
{
cout<<"Empty list";
}
else
{
temp=start;
start=start­->nxt;
delete temp;
}
}
void student::del_at_end()
{
student *temp,*temp1;
if(start==NULL)
{
cout<<"Empty list";
}
else
{
temp=start;
temp1=start;
while(temp­->nxt!=NULL)
{
temp1=temp;
temp=temp-­>nxt;
}
}
delete temp;
temp1-­>nxt=NULL;
}
void student::del_at_any()
{
student *temp,*temp1;
int x;
cout<<"Enter the age of the node to be deleted:";
cin>>x;
temp=start;
temp1=start;
while((temp-­>nxt!=NULL)&&(temp­->age!=x))
{
temp1=temp;
temp=temp­->nxt;
}
if(temp­->nxt==NULL)
{
cout<<"Error in inputs:";
}
else
{
temp1­->nxt=temp­->nxt;
delete temp;
}
}
int main()
{
int opt;
char ch;
student s;
do
{
cout<<"*******OPERATIONS******\n:1.add_front\n2.add_end\n3.add_any\
n4.del_fround\n5.del
_end\n6.del_any\n7.display\n8.search\n9.exit\nEnter your
choice:";
cin>>opt;
switch(opt)
{
case 1:s.add_at_front();
break;
case 2:s.add_at_end();
break;
case 3:s.add_at_any();
break;
case 4:s.del_at_front();
break;
case 5:s.del_at_end();
break;
case 6:s.del_at_any();
break;
case 7:s.display();
break;
case 8:s.search();
break;
case 9:break;
default : cout<<"Error";
break;
}
//cout<<"Do you want to continue (Y/N)";
//cin>>ch;
}
while(opt!=9);
}
void student::display()
{
student *temp;
temp=start;
while(temp!=NULL)
{
cout<<temp-­>age<<"\n" ;
temp=temp-­>nxt;
}
}
void student::search()
{
student *s1;
s1=new student;
int x,n,f=0;
n=1;
cout<<"Enter the age you want to search ";
cin>>x;
s1=start;
while(s1­->age!=x)
{
s1=s1­->nxt;
n=n+1;
if((s1­->nxt==NULL)&&(s1-­>age!=x))
{
f=1;
break;
}
}
if(f==1)
cout<<"Element not fount";
else
cout<<s1­->age<<"is at position"<<n<<"\n\n";
}

What is c++ hash?

873

---

What is c++ code?

865

---

Why do we need constructors in c++?

875

---

What are the different types of comments allowed in c++?

800

---

What is c++ vb?

871

---

Out of fgets() and gets() which function is safe to use?

882

---

write a program that withdrawals,deposits,balance check,shows mini statement. (using functions,pointers and arrays)

2067

---

Differentiate between a template class and class template in c++?

866

---

What is the difference between struct and class?

1085

---

Suppose that data is an array of 1000 integers. Write a single function call that will sort the 100 elements data [222] through data [321].

1243

---

What is an inline function in c++?

887

---

Will a catch statement catch a derived exception if it is looking for the base class?

774

---

How do you instruct your compiler to print the contents of the intermediate file showing the effects of the preprocessor?

862

---

Why iomanip is used in c++?

868

---

What is a wchar_t in c++?

831

---