Aman Gupta

15BEC1162

Q-1

CODE:

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
vector<int> v;
for(int i=0;i<10;i++)
v.push_back(i);
int x1=5,x2=100;
vector<int>::iterator it;
it=find(v.begin(),v.end(),x1);
if(it!=v.end())
{
cout<<"found"<<x1<<endl;
}
else{
cout<<"could not found"<<x1<<endl;
}
it=find(v.begin(),v.end(),x2);
if(it!=v.end())
{
cout<<"found"<<x2<<endl;
}
else{
cout<<"could not found"<<x2<<endl;
}
return 0;
}

OUTPUT:

Q-2)

CODE:
#include<iostream>
#include<vector>
#include<list>
#include<algorithm>
using namespace std;
bool Greaterthan5(double d) {return 5.0 <d;}
bool Firsteven(int n){return !(n%2);}
void f1(vector<double>&v)
{
vector<double>::iterator it=find_if(v.begin(),v.end(),Greaterthan5);
if(it !=v.end())
cout<<"found"<<*it<<endl;
else
cout<<"could not found"<<endl;
}
void f2(list<int>&l)
{
list<int>::iterator it=find_if(l.begin(),l.end(),Firsteven);
if(it !=l.end())
cout<<"found"<<*it<<endl;
else
cout<<"could not found"<<endl;
}
int main()
{
vector<double> v;
for(int i=1;i<=10;i++)
v.push_back(i*1.0);
list<int> mylist;
for(int i=1;i<=10;i++)
mylist.push_back(i);
f1(v);
f2(mylist);
return 0;
}

OUTPUT:

Q-3

CODE:
#include<iostream>
#include<map>
using namespace std;
int main()
{
map<string,char> grade_list;
grade_list["John"] = 'B';
cout<< grade_list["John"];
if(grade_list.find("Tim") == grade_list.end())
{
cout<<"Tim is not in the map!"<<endl;
}
else
cout<< grade_list["Tim"];
}

Q-4

CODE:

#include<iostream>
#include<map>
using namespace std;
int main()
{
map<string,char> grade_list;
grade_list["John"] = 'B';
cout<< grade_list["John"];
grade_list["Tim"] = 'A';
map<string,char>::iterator map_It;
map_It = grade_list.begin();
cout<<"Iterator"<<endl;
cout<<map_It->first<<endl;
cout<<map_It->second<<endl;
map_It++;
cout<<map_It->first<<endl;
cout<<map_It->second<<endl;
}
Q-5

CODE:

#include<iostream>
#include<map>
using namespace std;
int main()
{
vector< vector<int> > VI2Matrix;
vector<int> A,B;
vector< vector<int> >::iterator iter_ii;
vector<int>::iterator iter_jj;
A.push_back(10);
A.push_back(20);
A.push_back(30);
A.push_back(100);
A.push_back(200);
A.push_back(300);

vI2Matrix.push_back(A);
vI2Matrix.push_back(B);

cout<< endl << "Using Iterator:" << endl;

for(iter_ii=vI2Matrix.begin(); iter_ii!=vI2Matrix.end();iter_ii++)
{
for(iter_jj=(*iter_ii).begin();iter_jj!=(*iter_ii).end();iter_jj++)
{
cout<< *iter_jj << endl;
}
}

Q-6

CODE:

#include<iostream>
#include<vector>
using namespace std;
int main()
{
vector<int> myintvector;
vector<int>::iterator myintvectoriterator;
myintvector.push_back(1);
myintvector.push_back(4);
myintvector.push_back(8);

for(myintvectoriterator=myintvector.begin();myintvectoriterator!=myintvector.end();myintvectorite
rator++)
{
cout<<*myintvectoriterator<<" ";
}
}

OUTPUT:

Q-7

CODE:

#include<iostream>
#include<vector>
using namespace std;
main()
{
vector<vector<int>> vi2matrix(3,vector<int>(2,0));
vi2matrix[0][0]=0;
vi2matrix[0][1]=1;
vi2matrix[1][0]=10;
vi2matrix[1][1]=11;
vi2matrix[2][0]=20;
vi2matrix[2][1]=21;
cout<<"Loop by index: "<<endl;
int ii,jj;
for(ii=0;ii<3;ii++)
{
for(jj=0;jj<2;jj++)
{
cout<<vi2matrix[ii][jj]<<endl;
}
 }
}

OUTPUT:

Q-8

CODE:

#include<iostream>
#include<list>
using namespace std;
int main()
{
list<int> integer_list;
integer_list.push_front(1);
integer_list.push_front(2);
integer_list.push_front(3);
integer_list.push_front(4);
list<int>::iterator list_it;
list_it = integer_list.begin();
integer_list.insert(++list_it,5);
integer_list.sort();
list<int>::iterator temp;
for(temp=integer_list.begin();temp!=integer_list.end();temp++)
cout<<*temp;
}

OUTPUT:
Q-9

CODE:

#include<iostream>
#include<numeric>
using namespace std;
int main()
{
double u[3]={1.1,2.2,3.3};
double v[3]={11.1,22.2,33.3};
double sum=accumulate(u,u+3,0.0);
double ip=inner_product(u,u+3,v,0.0);
cout<<"sum"<<sum<<endl<<"inner"<<ip<<endl;
return 0;
}

OUTPUT:

Q-10

CODE:

#include<iostream>
#include<algorithm>
using namespace std;
const int SIZE=7;
int main()
{
int intarray[SIZE]={5,3,32,-1,1,104,53};
sort(intarray,intarray+SIZE);
cout<<"SA look like this"<<endl;
for(size_t i=0;i!=SIZE;++i)
cout<<intarray[i]<<"";
return 0;
}
OUTPUT: