5 Written Questions
5 Matching Questions
- What is well-founded ordering?
- What does it mean for a function to be intractable?
- When there is a straight line on a log-log graph, what does the slope represent?
- How does the constructing of a linked list work?
- What does the function Intersection do?
- a It can only be computed when n is relatively small (for example, exponential)
- b The order of the polynomial
- c A linked list links new elements onto the front of the list.
- d ordering that can guarantee to terminate (go down to zero)
- e It returns a set of elements that are members of both sets
5 Multiple Choice Questions
- == or !=
- A function that creates a new list, but does not modify the original list's arguments
- It returns the set of elements that are members of either set (basically all elements with no duplicates)
5 True/False Questions
With respect to linked lists, what does .set(idx, element) do? → == or !=
How big is a pointer? → The uppermost node that has no incoming links
What is random access? → a data structure that can be identified at runtime as a member of a class
What does a sentinel node hold or reference? → The memory address of the beginning of a record, or block of storage
What is the Big O of inserting at the front of an array or an ArrayList? → O(1)