5 Written questions
5 Matching questions
- What is the Big O of accessing some element in the middle of a LinkedList?
- For reference types, what do == and != test?
- What is a root?
- 10 bits is equal to about how many decimal digits?
- What is a doubly linked list?
- a The equality of pointer values (i.e. do they have the exact same data address in memory?)
- b It has pointers that point both forward and backward
- c The uppermost tree node that has no incoming links
- d 3
- e O(N)
5 Multiple choice questions
- A linked list links new elements onto the front of the list.
- It combines two sorted lists into one sorted list. Duplicated elements are retained.
- It tests whether a given item is an element of a list. It returns the remainder of the list beginning with the desired element
- ordering that can guarantee to terminate (go down to zero)
- The memory address of the beginning of a record, or block of storage
5 True/False questions
How can you find the Big O of an if statement? → O(log(N))
What is a runtime stack? → a stack that keeps a fresh set of values for each variable in a stack frame
What does the following produce?
(rest (rest '((a b) c))) → (c a)
What is the Big O of linear search of arrays, ArrayList, and LinkedList? → O(N)
What is an association list? → The function that constructs a pair containing two pointers