Q2: None of the answers is correct. An correct answer would be something like
Q10: Not coverd. Don't know how to work it out. I will learn how to calculate it later.
Q26: The original data structure used to implement insertion sort is array. It requires both swaps and comparisons. However, if we use linked list to optimize it, only comparison is needed(with a deletion and insertion at last). Therefore, the complexity is the same but constant is smaller due to fewer moves.
Q30: "bottom right most leaf" means the right most node on the bottom layer.
Q31: The idea comes from selection sort which selects the minimum/maximum element each time.
Q39: The term Hash buckets refers to the slots used in hashtables.
Q40: Not sure about the answer. Mark says he won't ask something ambiguous like this. So don't worry if you can solve it.
2014S1 past test
Q6: Not covered this semester, so don't worry.
Q14: The answer is C, others are all pretty important.
