C++ Institute Related Exams
CPP Exam
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
#include
#include
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 };
sets(t, t+10);/* Replace Code Here 3 */
multiset 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::iterator i=s1.begin();/* Replace Code Here 5 */
for( ;i!= s1.end(); i++)
{
cout<<i?>getA()<<" ";
}
cout<<endl;
return 0;
}
What will happen when you attempt to compile and run the following code? Choose all that apply.
#include
#include
#include
#include
using namespace std;
class A {
int a;
public:
A(int a) : a(a) {}
int getA() const { return a; } void setA(int a) { this?>a = a; }
bool operator < (const A & b) const { return a }; class F { A val; public: F(A & v):val(v){} bool operator() (A & v) { if (v.getA() == val.getA()) return true; return false; } }; int main() { int t[] = { 10, 5, 9, 6, 2, 4, 7, 8, 3, 1 }; vector v1(t, t + 10); set s1(t, t + 10); A a(6); F f(a); find_if(s1.begin(), s1.end(), f); if (find_if(v1.begin(), v1.end(), f) !=v1.end()) { cout<<"Found!\n"; } else { cout<<"Not found!\n"; } return 0; }
What happens when you attempt to compile and run the following code?
#include
#include
#include
using namespace std;
template
public:
B(T v):val(v){}
T getV() const {return val;} bool operator < (const B & v) const { return val template template ostream & out; Out(ostream & o): out(o){} void operator() (const T & val ) { out< bool Less(const B int main() { float t[]={2.28, 1.66, 1.32, 3.94, 3.64, 2.3, 2.98, 1.96, 2.62, 1.13}; vector > v1; v1.assign(t, t+10); stable_sort(v1.begin(), v1.end(), Less); for_each(v1.begin(), v1.end(), Out >(cout));cout<<endl; return 0; } Program outputs: