Task
|
Reading
|
Coding
|
1
|
2
|
3
|
4
|
5
|
6
|
7
|
1
|
Chapter 1 Algorithms
|
Using GTK, implement Wallpaper
|
|
|
|
|
|
|
|
2
|
Chapter 9 Mathematical Research,
The Mandlebrot Set, Mandlebrot handout
|
Using GTK, implement Mandlebrot
without zoom.
|
|
|
|
|
|
|
|
3
|
Chapter 9, GTK Tutorial
|
Using GTK, implement Mandlebrot
with zoom.
|
|
|
|
|
|
|
|
4
|
Chapter 12, Error Correcting
Codes
|
Fill an N x N Hadamard Matrix
using Divide and Conquer
|
|
|
|
|
|
|
|
5
|
Class notes
|
Implement an N-Squared Walsh
Transform
|
|
|
|
|
|
|
|
6
|
Sara Basse Handout
|
Fill an N x N Fourier Matrix.
|
|
|
|
|
|
|
|
7
|
Sara Baase Handout
|
Compute a 1D N-Squared Fourier
Transform
|
|
|
|
|
|
|
|
8
|
Sara Baase Handout
|
Compute a straight convolution
of two vectors.
|
|
|
|
|
|
|
|
9
|
Sara Baase Handout
|
Fill an N x N Inverse Fourier
Matrix.
|
|
|
|
|
|
|
|
10
|
Sara Baase Handout, class notes
|
Compute a 1D FFT using recursion
|
|
|
|
|
|
|
|
11
|
Sara Baase Handout, class notes
|
Compute a convolution using the
N-Squared Fourier Transform
|
|
|
|
|
|
|
|
12
|
Chapter 32, The Fast Fourier
Transform, Redistributing Images
|
Compute a convolution uisng the
FFT.
|
|
|
|
|
|
|
|
13
|
Class Handouts
|
Implement Strassen's Matrix
Multiply
|
|
|
|
|
|
|
|
14
|
Class Handout
|
Graham Scan Convex Hull
|
|
|
|
|
|
|
|
15
|
Class Handout
|
Compute a 1D FFT using iteration
w/ bit reverse
|
|
|
|
|
|
|
|
16
|
Chapter 32, The Fast Fourier
Transform
|
Using GTK, take a 2D FFT of an
image as is done in the book.
|
|
|
|
|
|
|
|
17
|
Class Discussion
|
Tromino Tiling w/ Divide and
Conquer
|
|
|
|
|
|
|
|
18
|
Chapters 7, 14, 31
|
Universal Turing Machine w/
numerous examples (unary add, unary mult, etc..)
|
|
|
|
|
|
|
|
19
|
Programming Pearls Handout
|
Maximum Sum Subvector, Divide
and Conquer
|
|
|
|
|
|
|
|
20
|
Class Handout, Discussion
|
Bitonic Sort
|
|
|
|
|
|
|
|
21
|
Handout
|
Naive String Match
|
|
|
|
|
|
|
|
22
|
Handout
|
Knuth Morris Pratt String Matcher
|
|
|
|
|
|
|
|
23
|
Chapter 61, Boyer Moore
|
Boyer Moore String Matcher
|
|
|
|
|
|
|
|
24
|
|
|
|
|
|
|
|
|
|