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

A. find

B. search

C. locate

D. find_first

A. O(1)

B. O(log n)

C. O(n)

D. O(n log n)

A. To provide last-in, first-out (LIFO) access to elements

B. To provide first-in, first-out (FIFO) access to elements

C. To store elements in a sorted sequence

D. To store elements in a hash table

A. find_last

B. rfind

C. search_last

D. find_end

A. O(log n)

B. O(1)

C. O(n)

D. O(n log n)

A. To store multiple elements in sorted order

B. To store multiple elements in random order

C. To store unique elements in sorted order

D. To store unique elements in random order

A. union

B. merge

C. combine

D. join

A. To provide first-in, first-out (FIFO) access to elements

B. To provide last-in, first-out (LIFO) access to elements

C. To store elements in a sorted sequence

D. To store elements in a hash table

A. O(log n)

B. O(1)

C. O(n)

D. O(n log n)

A. intersect

B. set_intersection

C. common

D. intersect_range