5 Written questions
5 Matching questions
- O(log(n)) is better than which function?
- Describe how log(n) grows.
- What does the function merge do?
- Which function will produce a linear plot on semi-log paper?
- What is random access?
- a Exponential
- b O(N). Much, much better.
- c It combines two sorted lists into one sorted list. Duplicated elements are retained.
- d describes a data structure in which all accesses have the same costs, O(1). e.g. an array.
- e Slowly. log(1000) = 10, log(1,000,000) = 20, log(1,000,000,000) = 30.
5 Multiple choice questions
- The same list structure is part of more than one list.
- A linked list links new elements onto the front of the list.
- 64 bits, or about 19 decimal digits.
5 True/False questions
What is the goal? → The function that constructs a pair containing two pointers
What is sometimes called a boxed integer? → Something as simple as a number, or a pointer to another linked list
How big is a pointer? → 64 bits on modern machines.
Since log(n) grows at the rate it does, what number can it be compared to? → First can be any Object type, while rest is a Cons or null
What is the Big O of quicksort? → O(n*log(N)), but could be O(n²) in the worst case.