Free Test Containers set – C++ Lan...

Q1: What type of container is a set in STL?

A. Ordered collection of unique elements B. Ordered collection allowing duplicates C. Unordered collection allowing duplicates D. Key-value pairs

Q2: Which underlying data structure is typically used by STL set?

A. Red-black tree B. Hash table C. Linked list D. Array

Q3: Can elements in a set be modified directly?

A. No, elements are immutable once inserted B. Yes, you can modify any element C. Yes, but only the first element D. Yes, but only the last element

Q4: Which function inserts an element into a set?

A. insert() B. push_back() C. emplace() D. add()

Q5: What happens when you insert a duplicate element into a set?

A. Insertion fails, set remains unchanged B. Duplicate is added C. Set throws exception D. Set clears all elements

Q6: How to check if a set contains a certain element?

A. Using find() B. Using contains() C. Using count() D. Using search()

Q7: Which function returns the number of elements in a set?

A. size() B. length() C. count() D. capacity()

Q8: Can you access elements in a set by index?

A. No, sets do not support indexing B. Yes, using at() C. Yes, using [] operator D. Yes, using get()

Q9: What is the time complexity of insert and find operations in a set?

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

Q10: Which header file must be included to use set?

A. <set> B. <map> C. <unordered_set> D. <algorithm>

Q11: What is the difference between set and multiset?

A. Multiset allows duplicate elements; set does not B. Set allows duplicates; multiset does not C. Both allow duplicates D. Neither allow duplicates

Q12: What type of iterator does set provide?

A. Bidirectional iterator B. Random access iterator C. Input iterator D. Output iterator

Q13: Which function removes elements from a set?

A. erase() B. pop() C. remove() D. clear()

Q14: Is the order of elements in a set deterministic?

A. Yes, sorted according to the key comparison B. No, random order C. Yes, insertion order D. No, reversed order

Q15: What happens if you modify an element in a set?

A. Undefined behavior, not allowed B. Element updates automatically C. Set reorders itself D. Element is removed

Q16: Which of these containers supports fast lookup by key?

A. set B. vector C. list D. deque

Q17: Which of the following is NOT true about set?

A. Allows duplicate elements B. Stores elements in sorted order C. Elements are unique D. Provides bidirectional iterators

Q18: Which container should be used for a collection that needs fast insertions and sorted unique elements?

A. set B. vector C. list D. unordered_set

Q19: Which operation invalidates iterators in set?

A. erase() B. insert() C. clear() D. Both erase() and clear()

Quiz for Containers set