Free Test Algorithms find – C++ Lan...

Q1: What does std::find return if the element is not found?

A. Iterator to the last element B. Iterator to the first element C. Iterator to the end element D. Null pointer

Q2: Which header file is required to use std::find?

A. <iostream> B. <algorithm> C. <vector> D. <iterator>

Q3: What is the time complexity of std::find on a vector?

A. O(1) B. O(n) C. O(log n) D. O(n log n)

Q4: Can std::find be used on sorted containers?

A. Yes, always B. No, never C. Yes, but not efficient D. Only on maps

Q5: Which function is more efficient than std::find for sorted containers?

A. std::find_if B. std::binary_search C. std::count D. std::search

Q6: What does std::find_if do?

A. Finds element by value B. Finds first element satisfying a predicate C. Finds last element D. Finds element using binary search

Q7: What is the difference between std::find and std::find_if?

A. std::find uses a predicate B. std::find searches for a value; std::find_if uses a predicate C. Both do the same D. std::find_if only works on sorted containers

Q8: What does std::find_end do?

A. Finds the first occurrence of a sequence B. Finds the last occurrence of a sequence C. Finds element equal to a value D. Finds elements in reverse

Q9: Which iterator types can std::find work with?

A. Input iterators or better B. Only random access iterators C. Only bidirectional iterators D. Output iterators only

Q10: How to specify a custom comparison in std::find_if?

A. Provide a comparator function as third argument B. Provide a unary predicate function as third argument C. It uses operator== by default D. It cannot use custom comparisons

Q11: What happens if std::find is called on an empty container?

A. Returns begin iterator B. Returns end iterator C. Throws exception D. Undefined behavior

Q12: Which function finds the first occurrence of a subsequence?

A. std::find B. std::search C. std::find_end D. std::find_first_of

Q13: What does std::find_first_of do?

A. Finds first element in one range found in another B. Finds first element in a container C. Finds first element equal to value D. Finds first sequence

Q14: Which of these is NOT an STL find algorithm?

A. std::find B. std::find_if C. std::find_last D. std::find_end

Q15: Is std::find guaranteed to be stable (maintain order)?

A. Yes B. No C. Only for sets D. Only for maps

Q16: What type of value does std::find return?

A. Boolean B. Iterator C. Index D. Pointer

Q17: Can std::find be used with standard arrays?

A. No B. Yes, with pointers C. Only with vectors D. Only with lists

Q18: How to check if an element exists in a container using std::find?

A. Check if returned iterator == begin() B. Check if returned iterator == end() C. Check if returned iterator is null D. Check if returned iterator is not null

Q19: Which STL algorithm finds the first element that does NOT satisfy a condition?

A. std::find B. std::find_if_not C. std::find_if D. std::search

Quiz for Algorithms find