SPRING 2009
SECTIONS A-D
LECTURES
> Course Notes
Additional Materials
COURSE NOTES
Use any posted notes as support material for use in class to help you learn more effectively. You might want to print out or save a copy for yourself before class. Note that any handouts posted do NOT substitute for going to class. We will discuss more than what you see in the basic slides below. You will need Adobe Acrobat Reader to view these files.
| UNIT | TOPIC | |||
| 1 | A Brief History of Computing | Part A | Part B | |
| 2 | Expressing Computations: Algorithms & Flowcharts | Part A | Part B | Part C |
| 3 | Data Organization | Part A | Part B | |
| 4 | Compilers & Programming Languages | Part A | Part B | |
| 5 | Recursion & Other Algorithmic Techniques | Part A | Part B | |
| 6 | Computational Goals: Correctness & Efficiency | Part A | Part B | |
| 7 | The Limits of Computation | Part A | Part B | Part C |
| 8 | Concurrency | Part A | Part B | Part C |
| 9 | Applications: Cryptography, Artificial Intelligence | Part A | Part B | |
| 10 | The Future of Computing |
COURSE INFO | CALENDAR | LECTURES | ASSIGNMENTS | EXTRA HELP | PYTHON