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

Q1: What does std::copy algorithm do?

A. Copies elements from one range to another B. Merges two sorted ranges C. Sorts elements in a range D. Finds an element in a range

Q2: Which header file contains std::copy?

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

Q3: What iterator type requirements does std::copy have?

A. Input iterators for source, output iterators for destination B. Random access iterators only C. Bidirectional iterators only D. Forward iterators for both

Q4: What happens if the destination range overlaps the source range in std::copy?

A. Undefined behavior B. Safe copy C. Different elements get copied D. Compile-time error

Q5: Which algorithm is safer to use when source and destination overlap?

A. std::copy B. std::copy_backward C. std::move D. std::transform

Q6: What is the return value of std::copy?

A. Iterator to the last copied element B. Iterator to the end of destination range C. Iterator to the last element in source range D. Void

Q7: Can std::copy be used with arrays?

A. Yes, using pointers B. No, only containers C. Yes, but only for constant arrays D. No, only vectors

Q8: What is the time complexity of std::copy?

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

Q9: Which of these is NOT a valid destination for std::copy?

A. std::back_inserter B. Raw pointer C. Input iterator D. Output iterator

Q10: What happens if destination does not have enough space for std::copy?

A. Runtime error B. Overwrite memory leading to undefined behavior C. Compile error D. Copies partial elements only

Q11: Which function inserts elements at the end of a container safely when copying?

A. std::copy B. std::copy_backward C. std::copy with std::back_inserter D. std::move

Q12: Can std::copy be used to copy elements between different container types?

A. Yes, as long as iterators are compatible B. No, container types must match C. Yes, only between vectors and lists D. No, only for arrays

Q13: Which of the following copies elements backwards?

A. std::copy B. std::copy_backward C. std::move D. std::transform

Q14: What is the main difference between std::copy and std::copy_backward?

A. std::copy_backward is faster B. std::copy_backward copies in reverse order C. std::copy_backward requires random access iterators only D. std::copy_backward works only on lists

Q15: Which iterator does std::copy return?

A. Iterator to the last element copied in destination B. Iterator to one past the last element copied in destination C. Iterator to the last element copied in source D. Iterator to the first element in source

Q16: Is std::copy noexcept (guaranteed not to throw exceptions)?

A. Yes B. No C. Depends on element types D. Only for primitive types

Q17: Can std::copy be used to copy overlapping ranges safely?

A. Yes, always B. No, never C. Only with std::copy_backward D. Only with std::move

Q18: Which STL algorithm can be used as an alternative to std::copy when moving elements?

A. std::move B. std::swap C. std::fill D. std::replace

Quiz for Algorithms copy