| 1. | January 26, 2026 | Course policies and introduction |
| 2. | January 28, 2026 | Announcement about academic integrity quiz and academic integrity essay; Variables, branches and loops (Reading assignment: Chapter 2 of the lecture notes) |
| 3. | February 2, 2026 | Functions and recursions (Chapter 3) |
| 4. | February 4, 2026 | Functions and recursions: practice |
| 5. | February 9, 2026 | Pointers |
| 6. | Problems for February 11, 2026 | Pointers and linked lists |
| 7. | February 18, 2026 | Arrays, new and delete |
| 8. | February 23, 2026 | Stacks |
| 9. | February 25, 2026 | Practice: pointers, arrays, stacks |
| 10. | March 2, 2026 | Practice for the midterm 1 |
| 11. | March 9, 2026 | References; sorting |
| 12. | March 11, 2026 | Merge sort |
| 13. | March 16, 2026 | Object oriented programming: class, object, attribute, method, member, declaration, implementation, public, private, constructor, destructor |
| 14. | March 18, 2026 | Problems and solutions involving IceCreamShop (in-person class) |
| 15. | March 23, 2026 | Copy constructor, copy assignment, mutators, accessors, const (code from class on 2026/03/23) |
| 16. | March 25, 2026 | Move constructor and move assignment |
| 17. | March 30, 2026 | Practice: sorting, stacks, arrays, references, and pointers (code from class on 2026/03/30)
|
| 18. | April 13, 2026 | Practice: stacks, object oriented programming
(code from class on 2026/04/15)
|
| 19. | April 20, 2026 | Binary trees and binary search trees
(code from class on 2026/04/20)
|
| 20. | April 22, 2026 | ssm::set
(code from class on 2026/04/22)
|
| 21. | April 27, 2026 |
AVL trees |
| 22. | April 29, 2026 |
Dynamic programming. (code from class on 2026/04/29) |
| 23. | May 4, 2026 |
Representation of integers |
| 24. | May 6, 2026 |
Floating point representation. (code from class on 2026/05/06) |
| 25. | May 11, 2026 | Practice: ssm::set, memoization, pointers, references, arrays. Announcement: Chapters for the final: 1-19 except the chapter 15.
|
| 26. | May 13, 2026 | Practice: ssm::set, binary search trees, breadth-first search
|