fundamental data structures and algorithms for computational design
| syllabus | ||||
| > | lectures | |||
| exercises | ||||
| material | ||||
| ----- | ||||
lecture presentations: |
||||
|
Feb 19
|
Introduction | |||
|
Feb 26
|
Arrays - Ordered Arrays | |||
Mar 04 |
Linked lists | |||
|
Mar 11 |
Sorting | |||
|
Mar 18 |
Algorithm analysis | |||
|
Mar 25 |
Dynamic programming | |||
|
Apr 01 |
Stacks and queues | |||
|
Apr 08 |
Trees | |||
|
Apr 15 |
Midterm | |||
|
Apr 22 |
Advanced sorting | |||
|
Apr 29 |
Graphs | |||
May 06 |
Hash tables | |||
|
May 13 |
Finite Automata | |||
May 20 |
Heuristics | |||
