5 Written questions
5 Matching questions
- What is the Big O of quicksort?
- What is similar to people waiting in line?
- What is XML?
- What is well-founded ordering?
- What does the function Union do?
- a O(n*log(N)), but could be O(n²) in the worst case.
- b It returns the set of elements that are members of either set (basically all elements with no duplicates).
(union '(i c e) '(c r e a m)) = (i c r e a m)
- c Extensible Markup Language, it allows users to put tags around their data to describe what the pieces of data mean. <city> Austin </city>
- d ordering that can guarantee to terminate (go down to zero)
- e A queue
5 Multiple choice questions
- A directed pointer from one node to another
- a pattern that describes a set of similar programs
- Slowly. log(1000) = 10, log(1,000,000) = 20, log(1,000,000,000) = 30.
5 True/False questions
How big is a pointer? → A pointer to the next element
What does the function nreverse do? → It reverses a list in place by turning the pointers around.
What is a Cons? → A kind of graph composed of nodes and links. It has one root node. Each node except the root has exactly one parent. All nodes are reachable from the root.
What is a parent? → The uppermost tree node that has no incoming links
What is the Big O of a matrix multiply? → O(n*log(N)), but could be O(n²) in the worst case.