Review for Written Test 2

San Skulrattanakulchai

November 11, 2016

Recursion

You should be able to
- translate methods with loops into a recursive one
- implement recursive algorithms
Programs you need to know
- print integers in base k (2 ≤ k ≤ 10)
- Towers of Hanoi puzzle

Program Performance

The ~ notation. You should be able to
- give definition
- answer whether or not f ~ g when given 2 functions f and g
Doubling Hypothesis. You should
- know what it means
- be able to use to predict the formula given experiment data

Dynamic Programming

You should know about how to solve these problems in detail.
- Fibonacci numbers
- Binomial coefficients
- Longest Common Subsequence

Implementation of Dynamic Programming

Bottom-up
Memoization