Which changes introduced independently will allow the code to compile and display 0 0 1 1
8 8 9 9 (choose all that apply)?
#include <iostream>
# include <set>
# include <vector>
using namespace std;
class A {
int a;
public:
A(int a):a(a){}
int getA() const { return a;}
/* Insert Code Here 1 */
};
/* Insert Code Here 2*/
int main(){
A t[] ={ 3, 4, 2, 1, 6, 5, 7, 9, 8, 0 };
set<A>s(t, t+10);/* Replace Code Here 3 */
multiset<A> s1(s.begin(),s.end());/* Replace Code Here 4 */
s1.insert(s.begin(),s.end());
s1.erase(s1.lower_bound(2),s1.upper_bound(7));
multiset<A>::iterator i=s1.begin();/* Replace Code Here 5 */
for( ;i!= s1.end(); i++)
{
cout<<i?>getA()<<" ";
}
cout<<endl;
return 0;
}

• A. bool operator < (const A & b) const { return a<b.a;} inserted at Place 1
• B. struct R { bool operator ()(const A & a, const A & b) { return a.getA()<b.getA();} }; inserted at Place 2
  replacing line marked 3 with set<A, R>s(t, t+10);
  replacing line marked 4 with multiset<A,R> s1(s.begin(),s.end());
  replacing line marked 5 with multiset<A,R>::iterator i=s1.begin();
• C. bool operator < (const A & b) const { return b.a<a;} inserted at Place 1
• D. operator int() const { return a;} inserted at Place 1

What happens when you attempt to compile and run the following code?
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
using namespace std;
void myfunction(int i) {
cout << " " << i;
}
int main() {
vector<int> v1(10,1);
fill(v1.begin()+2, v1.end()?2,2);
fill_n(v1.begin()+4,2,3);
for_each(v1.begin(), v1.end(), myfunction);
return 0;
}
Program outputs:

• A. none of these
• B. 1 1 2 2 3 3 2 2 1 1
• C. 1 1 2 2 2 2 2 2 1 1
• D. compilation error

What happens when you attempt to compile and run the following code?
# include <vector>
# include <set>
# include <iostream>
# include <algorithm>
using namespace std;
void print(int v) { cout<<v<<" "; }
struct Sequence {
int start;
Sequence(int start):start(start){}
int operator()() { return start++; }
};
bool predicate(int v) { return v%2==0; }
int main() {
vector<int> v1(10);
generate_n(v1.begin(), 10, Sequence(1));
set<int> s1(v1.begin(), v1.end());
remove_if(s1.begin(), s1.end(), predicate);
for_each(s1.begin(), s1.end(), print);cout<<endl;
return 0;
}
Program outputs:

• A. 1 3 5 7 9
• B. 2 4 6 8 10
• C. compilation error
• D. 1 3 5 7 9 6 7 8 9 10

Which sentence is correct about the code below? Choose all that apply.
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
class F {
int val;
public:
F(int v):val(v){}
bool operator() (int v) {
if (v == val) return true;
return false;
}
};
int main() {
int t[] = { 10, 5, 9, 6, 2, 4, 7, 8, 3, 1 };
vector<int> v1(t, t + 10);
if (find(v1.begin(), v1.end(), 6) == find(v1.begin(), v1.end(), F(6))) { cout<<"Found!\n";
} else {
cout<<"Not found!\n";
}
return 0;
}

• A. it will display Not found!
• B. it will display Found!
• C. it will not compile successfully
• D. it will compile successfully

What will happen when you attempt to compile and run the code below, assuming that file test.in contains the following sequence: 1 2 3?
#include <iostream>
#include <fstream>
#include <string>
#include <list>
#include <algorithm>
using namespace std;
template<class T>struct Out {
ostream & out;
Out(ostream & o): out(o){}
void operator() (const T & val ) {out<<val<<" "; } };
int main () {
ifstream f("test.in");
list<int> l;
for( ; !f.fail() ; ) {
int i;
f>>i;
l.push_back(i);
}
f.close();
for_each(l.begin(), l.end(), Out<int>(cout));
return 0;
}
Programwill output:

• A. program runs forever without output
• B. 1 2 3
• C. no output
• D. compilation error
• E. 1 2 3 3