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

Q1: What type of container is vector in STL?

A. Sequence container B. Associative container C. Container adapter D. Unordered container

Q2: Which operation is efficient with vector?

A. Accessing elements by index B. Insertion at the front C. Insertion in the middle D. Deletion from the front

Q3: What happens to vector size when elements are added?

A. It grows dynamically B. It stays fixed C. It shrinks D. It throws an error

Q4: Which STL vector function removes the last element?

A. pop_back() B. pop_front() C. remove() D. delete()

Q5: Which iterator category does vector support?

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

Q6: What is the time complexity of adding an element at the end of a vector?

A. Amortized constant time B. Linear time C. Logarithmic time D. Constant time

Q7: How does vector store its elements?

A. Contiguously in memory B. Using pointers only C. In a tree structure D. In a hash table

Q8: Which method returns the current number of elements in a vector?

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

Q9: Which method returns the maximum number of elements vector can hold without resizing?

A. capacity() B. size() C. max_size() D. reserve()

Q10: What does the reserve() method do in a vector?

A. Allocates memory to hold at least specified elements B. Releases memory C. Removes elements D. Sorts elements

Q11: Which of the following is NOT a valid vector method?

A. pop_front() B. push_back() C. size() D. clear()

Q12: Which STL container is preferred over vector for frequent insertions/removals at both ends?

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

Q13: If a vector needs to grow, what generally happens internally?

A. Allocates new larger array and copies elements B. Deletes old elements C. Throws an exception D. Does nothing

Q14: Which of these is the default initial capacity behavior of a vector?

A. Zero capacity, grows on insertion B. Fixed capacity C. Capacity equal to max_size() D. Capacity equals initial size

Q15: What is the complexity of accessing an element at index i in a vector?

A. Constant time O(1) B. Linear time O(n) C. Logarithmic time O(log n) D. Quadratic time O(n^2)

Q16: Which STL vector method erases all elements?

A. clear() B. destroy() C. release() D. remove()

Q17: Which vector method adds an element at the end?

A. push_back() B. push_front() C. insert() D. append()

Q18: What does the at() method in vector do?

A. Returns reference to element with bounds checking B. Returns pointer to element C. Inserts element at position D. Removes element

Q19: Which of the following is true about vectors?

A. They store data contiguously and support fast random access B. They store data in linked nodes C. They allow fast insertions at the front D. They do not support iterators

Q20: What happens if you access an out-of-bounds index using operator[] in vector?

A. Undefined behavior B. Throws an exception C. Returns null D. Returns default value

Quiz for Containers vector