SPRING 2010
Sections G,H,I,J,L
(Lectures 4,5)
LECTURES
> Course Notes
Java Review
Additional Materials
COURSE NOTES
Use any posted notes as support material for use in class to help you learn more effectively. 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. A NOTE ON PRINTING: Each page of notes contains two slides. If you wish to print these out, you may want to print more than one page per sheet to save on printing costs.
| UNIT | TOPIC | |
| 0 | Java Review | 15-110 Course Notes |
| 1 | Efficiency/Big O Notation | 1A: Counting, 1B: Big O |
| 2 | Lists | 2A: Array Lists, 2B: Linked Lists |
| 3 | Stacks & Queues | 3A: Stacks, 3B: Queues |
| 4 | OOP and Collections | 4A: OOP, 4B: Iterators/Collections |
| 5 | Recursion | 5: Recursion |
| 6 | Trees | 6A: Binary Trees, 6B: Heaps/Trees |
| 7 | Sorting Algorithms | 7A: Quadratic Sorts, 7B: NlogN Sorts, 7C: More About Sorting |
| 8 | Sets, Maps & Hashing | 8A: Sets & Maps, 8B: Hash Tables |
| 9 | Intro to Graphs | 9: Graphs |
COURSE INFO | CALENDAR | LECTURES | ASSIGNMENTS | LABS | HELP