Your answers to these questions will help us set the pace of the course.
1. Will you be programming class projects in Java or C++?
2. Do you have Unix programming experience?
3. Do prefer Unix or Windows OS for programming?
4. Have you used "big-O" notation, e.g. O(n2)?
5. Have you solved recursive equations, e.g. f(n) = 2*f(n-1) + c?
6. Do you have experience simplifying formulas using logs, e.g. log(a/b2)?
7. Which, if any, of the following data structures have you implemented before? Place a check next to each.
a. linked lists
b. sparse arrays
c. self-adjusting arrays
d. binary search trees
e. self-balancing search trees
f. heaps or priority queues
g. hash tables
h. graphs
8. Which, if any, of the following algorithms have you implemented before?
1. bubble sort
2. quicksort
3. depth-first search
4. breadth-first search
5. tree algorithms
6. graph algorithms