Standard Template Library (STL) in C++ MCQ question and answer with solution

Section 1 Section 2

11.
Which container in C++ STL does not preserve the order of elements?

A. vector

B. list

C. set

D. map

Answer & Solution Discuss in Board Save for Later

12.
What is the time complexity of searching for an element in a set in C++ STL?

A. O(1)

B. O(log n)

C. O(n)

D. O(n log n)

Answer & Solution Discuss in Board Save for Later

13.
Which algorithm in C++ STL is used to merge two sorted ranges into a single sorted range?

A. merge

B. sort

C. concatenate

D. combine

Answer & Solution Discuss in Board Save for Later

14.
What is the purpose of the 'std::unordered_map' container in C++ STL?

A. To store elements in key-value pairs with constant-time access

B. To store elements in a sorted sequence with constant-time access

C. To store elements in a stack with constant-time access

D. To store elements in a queue with constant-time access

Answer & Solution Discuss in Board Save for Later

15.
Which algorithm in C++ STL is used to remove all occurrences of a value from a container?

A. remove

B. erase

C. delete

D. eliminate

Answer & Solution Discuss in Board Save for Later

16.
What is the purpose of the 'std::deque' container in C++ STL?

A. To provide dynamic array-like functionality with efficient insertion and deletion at both ends

B. To store elements in a sorted sequence

C. To store elements in a stack

D. To store elements in a queue

Answer & Solution Discuss in Board Save for Later

17.
Which algorithm in C++ STL is used to count the number of occurrences of a value in a range?

A. count

B. find

C. search

D. find_count

Answer & Solution Discuss in Board Save for Later

18.
What is the time complexity of inserting an element into a set in C++ STL?

A. O(log n)

B. O(1)

C. O(n)

D. O(n log n)

Answer & Solution Discuss in Board Save for Later

19.
Which container in C++ STL is typically implemented using a red-black tree?

A. vector

B. list

C. set

D. map

Answer & Solution Discuss in Board Save for Later

20.
What is the purpose of the 'std::priority_queue' container in C++ STL?

A. To store elements in a sorted sequence with constant-time access to the largest element

B. To store elements in a sorted sequence with constant-time access to the smallest element

C. To store elements in a stack with constant-time access to the largest element

D. To store elements in a queue with constant-time access to the largest element

Answer & Solution Discuss in Board Save for Later

1 2 3 4 5 6 7 8 9 10

Standard Template Library (STL) in C++ MCQ question and answer with solution | C++ Programimg MCQs

11. Which container in C++ STL does not preserve the order of elements?

Answer & Solution

12. What is the time complexity of searching for an element in a set in C++ STL?

Answer & Solution

13. Which algorithm in C++ STL is used to merge two sorted ranges into a single sorted range?

Answer & Solution

14. What is the purpose of the 'std::unordered_map' container in C++ STL?

Answer & Solution

15. Which algorithm in C++ STL is used to remove all occurrences of a value from a container?

Answer & Solution

16. What is the purpose of the 'std::deque' container in C++ STL?

Answer & Solution

17. Which algorithm in C++ STL is used to count the number of occurrences of a value in a range?

Answer & Solution

18. What is the time complexity of inserting an element into a set in C++ STL?

Answer & Solution

19. Which container in C++ STL is typically implemented using a red-black tree?

Answer & Solution

20. What is the purpose of the 'std::priority_queue' container in C++ STL?

Answer & Solution

Read More Section(Standard Template Library (STL) in C plus plus)

11.
Which container in C++ STL does not preserve the order of elements?

12.
What is the time complexity of searching for an element in a set in C++ STL?

13.
Which algorithm in C++ STL is used to merge two sorted ranges into a single sorted range?

14.
What is the purpose of the 'std::unordered_map' container in C++ STL?

15.
Which algorithm in C++ STL is used to remove all occurrences of a value from a container?

16.
What is the purpose of the 'std::deque' container in C++ STL?

17.
Which algorithm in C++ STL is used to count the number of occurrences of a value in a range?

18.
What is the time complexity of inserting an element into a set in C++ STL?

19.
Which container in C++ STL is typically implemented using a red-black tree?

20.
What is the purpose of the 'std::priority_queue' container in C++ STL?