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

Q1: What does the STL map container store?

A. Key-value pairs with unique keys B. Only values without keys C. Duplicates of keys allowed D. Unordered elements

Q2: Which underlying data structure is commonly used by STL map?

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

Q3: Can keys in a map be modified directly?

A. No, keys are immutable once inserted B. Yes, keys can be modified freely C. Yes, but only the first key D. Yes, but only the last key

Q4: Which function inserts a key-value pair into a map?

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

Q5: What happens when inserting a key that already exists in a map?

A. Insertion fails; map remains unchanged B. Key-value pair is duplicated C. Previous value is overwritten D. Map throws an exception

Q6: How to access the value associated with a key?

A. Using operator[] or at() B. Using get() C. Using find() D. Using search()

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

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

Q8: Can you access map elements by index?

A. No, maps 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 map?

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

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

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

Q11: What is the difference between map and unordered_map?

A. map stores elements in sorted order; unordered_map does not B. map allows duplicates; unordered_map does not C. Both are unordered containers D. Both use hash tables

Q12: What type of iterator does map provide?

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

Q13: Which function removes elements from a map?

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

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

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

Q15: Which container should be used for key-value pairs with sorted keys?

A. map B. unordered_map C. multimap D. set

Q16: Which container allows multiple elements with the same key?

A. multimap B. map C. unordered_map D. set

Q17: Which of these operations invalidates iterators in a map?

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

Q18: Which function checks if a key exists in a map?

A. find() B. contains() C. count() D. all of the above

Q19: Which of these correctly accesses value for a given key k?

A. map[k] B. map.at(k) C. Both A and B D. None of the above

Quiz for Containers map