42.
What will be the output of the following C++ code?
#include <cstdlib>
#include <iostream>
using namespace std;
class X 
{
    public:
    void* operator new(size_t sz) throw (const char*)
    {
        void* p = malloc(sz);
        if (p == 0) 
            throw "malloc() failed";
        return p;
    }
   void operator delete(void* p) 
        {
        cout << "X :: operator delete(void*)" << endl;
        free(p);
    } 
};
class Y 
{
    int filler[100];
    public:
    void operator delete(void* p, size_t sz) throw (const char*)
    {
        cout << "Freeing " << sz << " bytes" << endl;
        free(p);
    };
};
int main() 
{
    X* ptr = new X;
    delete ptr;
    Y* yptr = new Y;
    delete yptr;
}

44.
Which of the following is correct about tuple_size?

46.
What will be the output of the following C++ code?
#include <iostream> 
#include <vector> 
 
using namespace std; 
 
int main() 
{ 
    vector<int> v; 
    for (int i = 1; i <= 5; i++) 
        v.push_back(i); 
    cout<<v.size()<<endl;
    v.resize(4);
    cout<<v.size()<<endl;
    return 0; 
}

48.
What will be the output of the following C++ code?
#include <iostream>
#include <string>
#include <tuple>
using namespace std;
int main()
{
	tuple <int, char, string> tp = {"Hello", 1, 's'};
	return 0;
}

49.
Which of the following is/are advantage(s) of Sequence Container arrays over C-like arrays?

50.
Pick out the correct statement.