5 Written questions
5 Matching questions
- When the ratio of times as the size of input is doubled is somewhat larger than 2, what is the Big O?
- How many children can a node have?
- What is the Big O of selection sort?
- What is a "thing" concerning linked lists?
- What is the goal?
- a A simple item such as a number or string or a balanced pair of parentheses and everything inside of them.
- b O( n*log(n) )
- c Any number
- d O(n²)
- e The item being sought in a search
5 Multiple choice questions
- Binary trees, First-Child/Next-sibling, Linked lists, Implicit
- Filter removes items from a Collection if they meet a certain condition
- getFirst, addFirst, removeFirst, getLast, addLast, removeLast are all O(1)
5 True/False questions
What are the disadvantages of LinkedList? → get, set, and remove are O(N)
What are contents of a linked list? → getFirst, addFirst, removeFirst, getLast, addLast, removeLast are all O(1)
What is the Big O of inserting in the middle of an ArrayList? → O(1)
What is an abstract data type? → A tree in which each node has at most two children
What is a root? → A directed pointer from one node to another