5 Written questions
5 Matching questions
- For reference types, what do == and != test?
- What is the Big O of selection sort?
- What are the disadvantages of ArrayList?
- What is a doubly linked list?
- How many children can a node have?
- a add and remove are O(N) for random positions, contains is O(N)
- b O(n²)
- c The equality of pointer values (i.e. do they have the exact same data address in memory?)
- d It has pointers that point both forward and backward
- e Any number
5 Multiple choice questions
- (dick harry)
- First can be any Object type, while rest is a Cons or null
- A function that modifies the original list's arguments
- Extensible Markup Language, it allows users to put tags around their data to describe what the pieces of data mean. <city> Austin </city>
- car and cdr (original names), or first and rest.
5 True/False questions
What is a binary tree? → 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.
How can you find the Big O of an if statement? → The loop count times the Big O of the contents
When the ratio of times as the size of input is doubled is somewhat larger than 2, what is the Big O? → O( n*log(n) )
What is design pattern? → a pattern that describes a set of similar programs
What is a circularly linked list? → A tree in which each node has at most two children