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

Q1: What type of container is list in STL?

A. Doubly linked list B. Array C. Hash table D. Stack

Q2: Which operation is efficient with list?

A. Insertion and deletion at any position B. Random access by index C. Access by pointer arithmetic D. Constant time access by index

Q3: What is the time complexity to access the nth element in a list?

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

Q4: Which STL list method removes the last element?

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

Q5: Which STL list method removes the first element?

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

Q6: Does STL list support random access iterators?

A. No, only bidirectional iterators B. Yes, random access iterators C. Only forward iterators D. No iterators

Q7: What is the default underlying data structure of list?

A. Doubly linked list B. Singly linked list C. Array D. Binary tree

Q8: Which method is used to insert elements at a specified position in list?

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

Q9: What does the splice() method do in a list?

A. Transfers elements from one list to another without copying B. Copies elements from one list to another C. Deletes elements D. Sorts elements

Q10: What is the complexity of inserting an element in a list?

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

Q11: Which method removes all elements from the list?

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

Q12: What happens when you call remove(val) on a list?

A. All elements equal to val are removed B. Only the first element equal to val is removed C. Removes elements by index D. Throws exception

Q13: Which STL container allows fast insertion/removal anywhere but slow random access?

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

Q14: Which iterator category does list provide?

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

Q15: Which of the following is NOT supported by STL list?

A. Direct element access via [] operator B. Iteration using iterators C. Insertion at front D. Deletion of elements

Q16: Which method in list sorts the elements?

A. sort() B. order() C. arrange() D. sequence()

Q17: Can STL list contain duplicate elements?

A. Yes B. No C. Only if specified D. Only unique keys

Q18: Which method reverses the elements in the list?

A. reverse() B. flip() C. invert() D. turn()

Q19: Which of these containers is best suited for frequent insertion/deletion in the middle?