Sections

• There are 5 sections per week, led by CAs:
  • Adam: Thursdays 1:30-2:30pm, STLC 119
  • Karey: Thursdays 3:30-4:20pm, Gates B01
  • David: Thursdays 4:30-5:30pm, STLC 118
  • Anton: Fridays 10:30-11:30am, Hewlett 101
  • Nidhi: Fridays 1:30-2:30pm, McCullough 126
• During sections, we will go over the material covered in class that week and work through practice problems in preparation for the week's homework assignment.
• Section attendance is not mandatory, but highly recommended. Working through practice problems is one of the most effective ways to learn the material.
• You do not need to officially sign up for sections, you can just drop in to whichever is most convenient. We strongly encourage attending the same section each week so you can get to know your section CA and your peers in a smaller group setting.
• The 3:30 section will be recorded for SCPD students, and the videos will be posted to Canvas (alongside the lecture videos).
• Some particular topic you'd like to see covered in Section? Post on Piazza to ask for them!

Here is a tentative schedule of what each section will cover. Section material is subject to change.

• Section 1 (Week of 1/6): Asymptotic analysis, review of proof by induction, divide and conquer. [Problems] [Solutions]
• Section 2 (Week of 1/13): Recurrence relations, More Divide and Conquer [Problems] [Solutions]
• Section 3 (Week of 1/20): Quicksort & Select [Problems] [Solutions]
• Section 4 (Week of 1/27): BSTs, BucketSort, Sorting Lower Bounds [Problems] [Solutions]
• Midterm Review (2/6)
• Section 5 (Week of 2/10): Graphs (BFS/DFS/SCCs) [Problems] [Solutions]
• Section 6 (Week of 2/17): Dijkstra & Dynamic Programming [Problems] [Solutions]
• Section 7 (Week of 2/24): More DP and intro to Greedy Algorithms [Problems] [Solutions]
• Section 8 (Week of 3/2): More Greedy, Minimum Spanning Trees, Karger's algorithm [Problems] [Solutions]
• Final Review (3/12)