Explore topic-wise MCQs in C++ Programming.

#include <iostream>
 #include <new>
 using namespace std;
 struct N 
 {
 virtual ~N() { };
 void operator delete(void* ptr1) 
 {
 cout << "N :: operator delete" << endl;
 }
 };
 struct M : N 
 {
 void operator delete(void* ptr1) 
 {
 cout << "M :: operator delete" << endl;
 }
 };
 int main() 
 {
 N* ptr2 = new M;
 delete ptr2;
 }

#include &ltiostream>
 #include <memory>
 #include <string>
 using namespace std;
 int main () 
 {
 pair <string*, ptrdiff_t> Res = get_temporary_buffer<string>(5);
 if (Res.second > 0)
 {
 uninitialized_fill ( Res.first, Res.first + Res.second, 
 "Bye " );
 for (int k = 0; k < Res.second; k++)
 cout << Res.first[k] ;
 return_temporary_buffer(Res.first);
 }
 return 0;
 }

#include <iostream>
 #include <memory>
 #include <string>
 using namespace std;
 int main ()
 {
 string str[] = {"Interveiw", "Mania"};
 pair <string*, ptrdiff_t> Res = get_temporary_buffer<string>(2);
 if (Res.second>0) 
 {
 uninitialized_copy ( str, str + Res.second, Res.first );
 for (int k = 0; k < Res.second; k++)
 cout << Res.first[k] << " ";
 return_temporary_buffer(Res.first);
 }
 return 0;
 }

#include <iostream>
 #include <memory>
 #include <algorithm>
 using namespace std;
 int main ()
 {
 int num[] = {11, 15, 14, 15, 14, 11};
 pair <int*, ptrdiff_t> Res = get_temporary_buffer<int>(6);
 if (Res.second > 0)
 {
 uninitialized_copy (num, num + Res.second, Res.first);
 sort (Res.first, Res.first + Res.second);
 for (int k = 0; k < Res.second; k++)
 cout << Res.first[k] << " ";
 return_temporary_buffer (Res.first);
 }
 return 0;
 }

#include <iostream>
 #include <new>
 #include <cstdlib>
 using namespace std;
 const int bsize = 128;
 int *ptr1;
 bool allocate = true;
 void get_memory() 
 {
 cerr << "free store exhausted" << endl;
 delete [] ptr1;
 allocate = false;
 }
 void eat_memory(int size) 
 {
 int *ptr2 = new int[size];
 if (allocate)
 eat_memory(size);
 else
 cerr << "free store addr = " << ptr2 << endl;
 }
 int main()
 {
 set_new_handler(get_memory);
 ptr1 = new int[bsize];
 cerr << "free store addr = " << ptr1 << endl;
 eat_memory(bsize);
 return 0;
 }

#include <iostream> 
 #include <ctype.h>
 int main ()
 {
 int k = 0;
 char str[] = "Ajit Kumar Gupta";
 char ch;
 while (str[k])
 {
 ch = str[k];
 if (islower(ch)) 
 ch = toupper(ch);
 putchar (ch);
 k++;
 }
 return 0;
 }