CS 106B: Programming Abstractions
- Materials for today:
This is our last lecture :) Thanks for a great quarter! Congratulations on being almost done with CS106B!
Here is what I wrote on the whiteboard about what to expect for each problem on the exam, and associated recommended study resources:
- Problems 1 and 2: Trees
- Lecture PollEv Qs from all 3 tree lectures (lectures 16, 20, 21).
- Practice Exam 1, Q2; Practice Exam 2, Q1; Practice Exam 3, Q4; Practice Exam 4, Q4
- Problem 3: Memory Diagram
- Practice Exam 1, Q1; Practice Exam 2, Q2; Practice Exam 3, Q3
- Section 6, Q1; Section 9, Q1
- Problem 4: Algorithms, including Backtracking
- Any Backtracking practice problem :-)
- Examples and templates in Lectures 11 and 12, especially 12
- Practice Exam 2, Q3
- Problem 5: Implement a Class
- Assignment 5 Tone Matrix (don’t need to know sound samples or anything to do with Tone Matrix itself, just good practice with making your own class, understanding link between .h file and .cpp file, etc.
Other things I would be sure to study, for some of the above problems:
- Our midterm exam
- Assignment 2 Maze, BFS
- Tree traversals (Lecture 21)
- Tree coding problems on the Practice Exams
- Assignment 7 Huffman (generally how to write code for trees)