5 Written Questions
5 Matching Questions
- What is a pointer (aka reference)?
- What is a doubly linked list?
- What does it mean to divide and conquer?
- When the ratio of times as the size of input is doubled is about 4, what is the Big O?
- What is a binary tree?
- a It has pointers that point both forward and backward
- b To break down a large problem into two smaller problems, until the problem becomes easy
- c A tree in which each node has at most two children
- d O(n²)
- e The memory address of the beginning of a record, or block of storage
5 Multiple Choice Questions
- a stack that keeps a fresh set of values for each variable in a stack frame
- It makes a new linked list whose elements are in reverse order of the original list
5 True/False Questions
What is random access? → describes a data structure in which all accesses have the same costs
Which algorithms show up as straight lines on log-log graphs? → Polynomial
What does it mean for something to be random access? → Access to any element has the same cost (for example, arrays)
64-bits can represent about how many decimal digits? → 19
What will a filter function do? → It provides a simple lookup tool to find information in a linked list