C++ Programming Mock Test 7

10%

Question 1 of 10

1. How many different ways are there to access an element of array classes at the ith position?

Question 1 of 10

Question 2 of 10

2. What are the design requirements for building a container from the sratch?

Iterator requirements

Container interface requirements

Allocator interface requirements

All of the mentioned

Question 2 of 10

Question 3 of 10

3. What is the syntax of declaraing a forward_list?

forward_list f;

forward_list f<type>;

forward_list<type,size> f;

forward_list<type> f;

Question 3 of 10

Question 4 of 10

4. What must be an operand of operator delete?

Queue

Pointer

Array

Stack

Question 4 of 10

Question 5 of 10

5. In which type of storage location are the vector members stored?

Memory storage locations

Contiguous & Non-contiguous storage locations

Contiguous storage locations

Non-contiguous storage locations

Question 5 of 10

Question 6 of 10

6. Which of the following function is used to get the actual number of elements stored in vector?

v.capacity()

v.max_size()

v.no_of_elements()

v.size()

Question 6 of 10

Question 7 of 10

7. What will be the output of the following C++ code?

#include <iostream>
#include <array>

using namespace std;

int main(int argc, char const *argv[])
{
	int arr1[5] = {1,2,3,4,5};
	int arr2[5] = {6,7,8,9,10};
	arr1.swap(arr2);
	for(int i=0;i<5;i++)
		cout<<arr1[i]<<" ";
	cout<<endl;
	for(int i=0;i<5;i++)
		cout<<arr2[i]<<" ";
	cout<<endl;
	return 0;
}

1 2 3 4 5
6 7 8 9 10

Error

6 7 8 9 10
1 2 3 4 5

Segmentation fault

Question 7 of 10

Question 8 of 10

8. What is a pair?

Container consisting of two data elements of the same type

Container consisting of two data elements of different type

Container consisting of two data elements can have the same or different type

Container consisting of one header and two data elements of the same type

Question 8 of 10

Question 9 of 10

9. What will be the output of the following C++ code?

    #include <iostream>
    #include <vector>
    using namespace std;
    int main ()
    {
        vector<int> first;
        first.assign (7,100);
        vector<int>::iterator it;
        it=first.begin()+1;
        int myints[] = {1776,7,4};
        cout << int (first.size()) << '\n';
        return 0;
    }

Question 9 of 10

Question 10 of 10

10. What will be the capacity of vector at the end in 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);
    v.reserve(50);
    cout<<v.capacity();
    return 0; 
}

Question 10 of 10