Lecture and Reading Schedule
Week 1
- Tuesday, June 25: Course overview, command line arguments, HW1 overview (pptx | pdf | example code)
- Thursday, June 27: Memory layout, start of input/output (I/O) (pptx | pdf | example code)
Readings:
- Textbook Chapter 1: Software Engineering Priciples
Week 2
- Tuesday, July 2: File Input/Output, Project 1: List ADT (pptx | pdf | example code)
- Wednesday, July 3: Black Box Testing (pptx | pdf)
- Thursday, July 4: NO CLASS
Readings:
- Textbook Chapter 3 (review/skim chapter 2 as necessary)
Week 3
- Tuesday, July 9: Separate Compilation, Project 1: Array-based Walk Through (pptx | pdf | example code)
- Thursday, July 11: Linked Structure (pptx | pdf | example code)
Readings:
- Complete Textbook Chapter 3
Week 4
- Tuesday, July 16: Big-O, C++ (pptx | pdf | example code)
- Thursday, July 18: Finish C++ Overview (pptx | pdf | example code)
Week 5
Week 6
- Tuesday, July 30: Stacks and Queues (pptx | pdf)
- Thursday, August 1: Trees, Binary Search Trees, Recursion, Project 2 Overview (pptx | pdf | example code)
Readings:
- Textbook Chapters: 5 (Stack and Queue), 6 (for C++ Template info), 8 (Binary Search Trees)
Week 7
- Tuesday, August 6: Tree Traversal and Project 2 (pptx | pdf | example code)
- Thursday, August 8: Sorting, BST Removal (pptx | pdf)
Readings:
- Review Textbook Chapters: 5 (Stack and Queue), 6 (for C++ Template info), 8 (Binary Search Trees)
Week 8
Readings:
- Textbook Chapter 9: Priority Queues, Heaps, Graphs and Sets (section 1 and 2)
Week 9
- Tuesday, August 20: Project 3 Overview, STL (pptx | pdf | example code)
- Thursday, August 22: Hash Tables (pptx | pdf | example code)
Readings:
- Textbook Chapter 10: Sorting and Searching Algorithms (sections 1, 2, and 3)
Week 10
- Tuesday, August 27: Final Review
- Thursday, August 29: Final Examination