Exam prep

Which operation does a set provide to determine if a particular element is present?

• Aadd
• Bremove
• Ccontains
• Diterate

Why is storing set elements in no particular order less efficient for membership queries?

• AIt automatically sorts the data during insertion.
• BIt allows binary search on the unordered data.
• CIt requires scanning the entire collection to check for an element.
• DIt uses constant‑time hash lookups.

What is the time complexity of searching for an element in a sorted array using binary search?

• AO(1)
• BO(n log n)
• CO(n)
• DO(log n)

What is the runtime of the algorithm that checks whether a list is sorted by comparing each adjacent pair?

• AO(1)
• BO(log n)
• CO(n)
• DO(n^2)

After placing the maximum element at its final position in selection sort, which part of the array still needs to be sorted?

• AThe entire array
• BThe subarray after the placed maximum
• CThe subarray before the placed maximum
• DNo part; sorting is complete

What is the first step of each iteration in the described selection sort algorithm?

• AFind the minimum element in the unsorted portion
• BMerge two halves of the array
• CInsert a new element at the beginning
• DFind the maximum element in the unsorted portion

Merging two sorted lists of lengths 4 and 4 results in how many total elements?

• A8
• B4
• C16
• D0

What is the asymptotic time complexity of merging two sorted lists whose total length is n?

• AΘ(n)
• BΘ(log n)
• CΘ(1)
• DΘ(n log n)