PIC 10B: Intermediate Computer ProgrammingSpring 2008, UCLA | |||
|
|
|
|
|
| Week | Date | Big C++ Reading | Topic | Materials |
| 1 | Mon 3/31 | Skim Ch 1-5, 7, 12.1 | Review: Input/Output & Functions | Lecture 1 Notes 10A File I/O Notes PIC Lab Intro Handout File I/O Handout |
| Wed 4/4 | Skim Ch 9-10 | Review: Arrays, Vectors, & Pointers | Lecture 2 Notes 10A Array Notes 10A Vector Notes 10A Pointer Notes |
|
| Fri 4/6 | 15.3 | Introduction to Big O Notation | Lecture 3 Notes Wiki: Best-Average-Worst Wiki: Subset Sum Problem Wiki: Traveling Salesman Problem |
|
| 2 | Mon 4/7 | 6.1-6.9 | Classes | Lecture 4 Notes |
| Wed 4/9 | 18.1-18.4 | Constructors & Destructors | Lecture 5 Notes | |
| Fri 4/11 | 17.1-17.10, 20.4 | Operator Overloading & Friends
HW 1 Due |
Lecture 6 Notes | |
| 3 | Mon 4/14 | 22.1, 22.3 | Template Functions | Lecture 7 Notes |
| Wed 4/16 | 22.4-22.7 | Template Classes | Lecture 8 Notes The Pair Class: 1 2 3 The SortedList Class |
|
| Fri 4/18 | 14.1-14.3 | Introduction to Recursion HW 2 Due, Solution |
Lecture 9 Notes Fibonacci Numbers Program |
|
| 4 | Mon 4/21 | STUDY! | Midterm Exam 1 Exam Solutions |
Practice Exam 1, Solutions S07 Exam 1 Solutions W08 Exam 1 Solution |
| Wed 4/23 | 14.4-14.6 | Examples of Recursion | Lecture 10 Notes Star Wars Bunnies Movie |
|
| Fri 4/25 | 15.6-15.7 | Binary Search HW 3 Due |
Lecture 11 Notes Search Comparison Program |
|
| 5 | Mon 4/28 | 16.1-16.2 | Linked Lists | Lecture 12 Notes Linked List Demo Program Linked List Basics |
| Wed 4/30 | 16.2 | Linked List Functions | Lecture 13 Notes | |
| Fri 5/2 | 16.3 | Stacks
HW 4 Due |
Lecture 14 Notes Stack Demo Program Wiki: Stacks |
|
| 6 | Mon 5/5 | 16.3 | Queues | Lecture 15 Notes The Queue Class: 1 2 Bank Line Simulator Program Wiki: Queues |
| Wed 5/7 | Stanford Notes | Binary Search Trees | Lecture 16 Notes The Tree Class: 1 2 Tree Demo Program Stanford BST Notes Wiki: Binary Search Trees |
|
| Fri 5/9 | Stanford Notes | Tree Inserting/Erasing
HW 5 Due |
Lecture 17 Notes | |
| 7 | Mon 5/12 | Stanford Notes | Tree Traversal | Lecture 18 Notes Wiki: Tree Traversal |
| Wed 5/14 | 15.1-15.3 | Basic Sorting Algorithms | Lecture 19 Notes Wiki: Selection Sort Wiki: Insertion Sort |
|
| Fri 5/16 | 15.4-15.5 | Mergesort & Quicksort HW 6 Due |
Lecture 20 Notes Wiki: Merge Sort Wiki: Quick Sort Sorting Animations |
|
| 8 | Mon 5/19 | STUDY! | Midterm Exam 2 Exam Solutions |
Practice Exam 2, Solutions S07 Exam 2 Solutions W08 Exam 2 Solution |
| Wed 5/21 | 23.5 | Heaps & Priority Queues | Lecture 21 Notes Heap Demo Program Wiki: Binary Heaps Wiki: Heap Sort |
|
| Fri 5/23 | Wiki Notes | Hash Tables: Concept
HW 7 Due |
Lecture 22 Notes Wiki: Hash Tables |
|
| 9 | Mon 5/26 | REST! | NO CLASS Memorial Day |
|
| Wed 5/28 | Wiki Notes | Hash Tables: Implementation | Lecture 23 Notes The HashTable Class |
|
| Fri 5/30 | Wiki Notes | Hash Tables: Advanced Hashing
HW 8 Due |
Lecture 24 Notes Multi-Key Hash Table Program |
|
| 10 | Mon 6/2 | 23.1-23.5 | The Standard Template Library Algorithms Review |
Lecture 25 Notes |
| Wed 6/4 | Classes Review | Lecture 26 Notes | ||
| Fri 6/6 | Data Structures Review
HW 9 Due |
Lecture 27 Notes | ||
| Sun 6/8 | STUDY! | Final Exam Sunday 3:00-6:00 Humanities A51 |
Practice Final Exam, Solutions S07 Final Exam, Solutions W08 Final Exam, Solutions |