Carnegie Mellon University Website Home Page
 
Spring 2008  |  Mini 3

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 Algorithms Part A Part B Part C
2 Data Organization Part A Part B  
3 Compilers & Programming Languages Part A Part B Programming Languages Poster
4 Recursion & Algorithmic Techniques Part A Part B  
5 Computational Goals: Correctness & Efficiency Part A Part B  
6 The Limits of Computation Part A Part B
7 Universal Computation: Turing Machines Part A