# Winter 2021

Announcements:

• First day of class January 4th 1:00pm pacific on zoom here.
• Discussion sections are held on zoom Mondays at 2pm pacific here.

Homeworks:

Exams:

• Exam 1 Instructions.
• Suggested practice problems from the book: 3.2, 3.3, 3.4, 3.11, 3.12, 3.13, 3.16, 3.22, 3.23, 3.25, 4.4, 4.14, 4.17 (note: some of these problems need you to understand Dijkstra's algorithm, which will not be covered on the test)
• Exam 1 Review [video][ppt][pdf]
• Exam 1 and Solutions
• Exam 2 Instructions
• Exam 2 Corrections
• Exam 2 Suggested Practice Problems: 2.1, 2.4, 2.14, 2.16, 2.19, 2.22, 2.28, 4.1, 4.2, 4.5, 4.8, 4.9, 4.13, 4.19, 4.20, 4.21, 4.22
• Exam 2 Review [video][ppt][pdf]
• Exam 2 and Solutions
• Exam 3 Instructions and Problem Corrections
• Exam 3 Suggested Practice Problems: 5.1, 5.4, 5.5, 5.9, 5.13, 5.20, 5.24, 5.28, 5.30, 5.32, 6.2, 6.3, 6.4, 6.6, 6.9, 6.10, 6.16, 6.24
• Exam 3 Review [video][ppt][pdf]
• Exam 3 and Solutions
• Final Exam Instructions and Problem Corrections
• Final Exam Extra Practice Problems: 8.2, 8.3, 8.12, 8.13, 8.16, 8.20, 8.23, 9.1, 9.5, 9.8
• Final Exam Review [video][ppt][pdf]
• Final Exam and Solutions.

Lecture Recordings:

Other:

Course Description: CSE 101 will covers the basics of the design and analysis of algorithms with a focus on non-numerical algorithms. We will cover general algorithmic techniques such as divide and conquer, greedy algorithms and dynamic programming. We will also discuss some important graph algorithms as well as NP-completeness and techniques for dealing with it. In the process of doing so, we will investigate several important algorithms such as sorting, shortest paths and longest common substrings. Time permitting we may also cover additional topics such as linear programming, number theoretic algorithms and quantum computation.