Q1. A stack processes elements in which order?
Q2. An O(n²) algorithm can beat an O(n) one in practice when
Q3. Accessing the i-th element of an array is
Q4. Binary search requires that the list is
Q5. for i in n { for j in n { work } } has complexity
Q6. In a binary search tree, values smaller than a node go
Q7. Two keys hashing to the same bucket is
Q8. Breadth-first search uses which auxiliary structure?
Q9. Which sort repeatedly swaps adjacent out-of-order pairs?
Q10. Linked lists beat arrays when the workload is