5 Written questions
5 Matching questions
- What is preorder?
- What is a circularly linked list?
- With respect to linked lists, what does .set(idx, element) do?
- What is the Big O of selection sort?
- How can you find the Big O of an if statement?
- a O(n²)
- b The last link points back to the front of the list rather than to null or nil
- c a way of processing a tree where the parent node is processed before the children
- d The max of the Big O of the test, then statement, and else statement
- e Replaces the element at the specified position in this list with the specified element.
5 Multiple choice questions
- A simple item such as a number or string or a balanced pair of parentheses and everything inside of them.
- a data structure that can be identified at runtime as a member of a class
- O(N). Much, much better.
- A pointer to the next element
5 True/False questions
What does depth-first search do? → It combines two sorted lists into one sorted list. Duplicated elements are retained.
What does it mean to divide and conquer? → 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)
10 bits is equal to about how many decimal digits? → 19
32-bits can represent about how many decimal digits? → 32
What is a parent? → In a tree, it is a node that points to a given node