1. In which classes we can define the list and vector classes?
A. Abstract classes
B. child classes
C. STL classes
D. String classes
Ans:

2. By STL how many components it has been kept?
A. 3
B. 4
C.1
D. unlimited
Ans:
3. Which of the following are the components of STL?
A. Algorithms
B. containers
C. function, iterators
D. All of these
Ans:
4. Which of the following is to provide a different interface for sequential containers?
A. container adopters
B. sequence containers
C. queue
D. Associative Containers
Ans:
5. In the given below which of the following file c header files contains the only function for manipulating null-terminated arrays of character?
A.
B.
C.
D. A&B both
Ans:
6. Container Adaptors provide a how many interface for sequential containers
A. 2
B. 3
C. 4
D.1
Ans:
7. Container Adaptors provide a different interface for sequential containers these are
A. Queue
B. priority Queue
C. stack
D. all of these
Ans:
8. The integer ASCII code has a range of.
A. 0 to 500
B. 1 to 3000
C. 0 to 100
D. 200 to 227
Ans:
9. Which of the following true about sequence container?
A. Containers that implements sorted data structures for fast search in O(logn)
B. Containers that implements data structures which can be accessed sequentially
C. Containers that implements data structures which can be accessed non-sequentially
D. none of these
Ans:
10. Which of the following are implemented through sorted data structures that can be quickly searched (O (log n) complexity)
A. Associative Containers
B. sequence container
C. container adopter
D. unordered associative containers
Ans:
11. In C++ how many sequence containers are provided?
A. 3
B.1
C.5
D.2
Ans:
12. In C++ how many container adopter are provided?
A. 2
B.6
C.4
D.3
Ans:
13. What are the unordered Associative Containers?
A. implement sorted data structures that can be quickly searched (O(log n) complexity).
B. implements unordered data structures that can be quickly searched
C. implements data structures which can be accessed in a sequential manner.
D. none of these
Ans:
14. The Unordered Associative Containers are implements unordered data structures that can be quickly searched
A. unorder-set
B. unorder-multiset
C. unorder- map
D. all of these
Ans:
15. Which of the following are true about unordered sequence container?
A. these are implements through unordered data structures that can be quickly searched
B. these are implements through data structures which can be accessed in a sequential manner
C.A&B both
D. these can be implemented through sorted data structures that can be quickly searched (O(log n) complexity).
Ans:

Programming C Plus Plus MCQs Homepage

• Low-level and high-level languages MCQs
• Procedural and non Procedural languages MCQs
• C++ STANDARD LIBRARY MCQs
•  Array  MCQs 
• Arrays MCQs 2
• Pointers Solved MCQs
• Inline Function MCQs – C++
• Top 50 Programming  C++ MCQs 
• MCQs of introduction to programming
• Past Papers 2022 C++ MCQs
• Past Papers 2021 C++ MCQs
• Past Papers 2020 C++ MCQs
• Past Papers 2019 C++ MCQs
• Highly Recommended C++  Important MCQs with Explanation
• OOP
• OOP intro & examples MCQs
• Classes and Inheritance MCQs
• Friend Function MCQs
• Virtual Function MCQs
• Polymorphism MCQs
• Polymorphism MCQs 2