C++ STL Concepts and Components

1. Which container adapter is LIFO?

Std::queue

Std::priority_queue

Std::stack

Std::deque

Submit

3. What does std::distance() return between two iterators?

The memory difference in bytes

The number of elements between them

A boolean indicating if they're equal

An iterator to the midpoint

4. Which algorithm partitions a range based on a predicate?

Std::partition

Std::sort

Std::stable_partition

Both a and c

Submit

6. What is the primary advantage of std::unordered_set over std::set?

Maintains sorted order

Faster average-case lookup

Uses less memory

Supports bidirectional iteration

Submit

8. Which STL container guarantees contiguous memory?

Std::list

Std::vector

Std::deque

Std::set

Submit

10. What does std::accumulate() compute on a range?

The sum of all elements

The product of all elements

The sum or custom reduction

The count of elements

11. Which STL container provides O(1) average-case insertion and deletion?

Std::vector

Std::list

Std::unordered_map

Std::deque

Submit

13. What does std::adjacent_find() locate?

Two equal consecutive elements

The last element

The first unique element

The middle element

14. Which algorithm returns an iterator to the first element satisfying a predicate?

Std::find_if

Std::count_if

Std::any_of

Std::transform

Submit

16. Which STL container maintains insertion order and allows duplicates?

Std::set

Std::unordered_set

Std::multimap

Std::queue

17. What is the time complexity of std::map::find()?

O(1)

O(log n)

O(n)

O(n log n)

Submit

19. Which algorithm sorts a range in-place with O(n log n) complexity?

Std::sort

Std::stable_sort

Std::partial_sort

Std::nth_element

20. What is the primary purpose of iterators in the STL?

To provide random access to container elements

To abstract container traversal and element access

To enforce type safety

To manage memory allocation

CPP Standard Template Library Quiz

1. Which container adapter is LIFO?

2.

What first name or nickname would you like us to use?

2. Std::function is a template wrapper for ______ types.

3. What does std::distance() return between two iterators?

4. Which algorithm partitions a range based on a predicate?

5. Std::bind() creates a ______ by binding arguments to a callable.

6. What is the primary advantage of std::unordered_set over std::set?

7. Std::copy() requires the destination iterator to be at least a ____-access iterator.

8. Which STL container guarantees contiguous memory?

9. Bidirectional iterators support ______ and --.

10. What does std::accumulate() compute on a range?

11. Which STL container provides O(1) average-case insertion and deletion?

12. Std::priority_queue is typically implemented using a ____.

13. What does std::adjacent_find() locate?

14. Which algorithm returns an iterator to the first element satisfying a predicate?

15. Std::forward_list provides ____-directional iteration.

16. Which STL container maintains insertion order and allows duplicates?

17. What is the time complexity of std::map::find()?

18. Std::vector is a ____-based container.

19. Which algorithm sorts a range in-place with O(n log n) complexity?

20. What is the primary purpose of iterators in the STL?