CSE 101: Design and Analysis of
Algorithms
Fall 2024
Announcements:
- First day of class is September 27th in the CENTER 105.
- Discussion sections are Monday 2-3pm in CENTER 212.
- Please remember to compete the FinAid survey on canvas by
the end of the second week of class.
Homeworks:
- Homework 0 [pdf][LaTeX] and Solutions
- Homework 1 [pdf][LaTeX] and Solutions
- Homework 2 [pdf][LaTeX] and Solutions
- Homework 3 [pdf][LaTeX] and Solutions
- Homework 4 [pdf][LaTeX] and Solutions
- Optional Practice Problems from the textbook
- Chapter 6: 2, 3, 4, 6, 7, 10, 12, 13, 16, 17, 21, 25, 26
- Chapter 8: 1, 2, 3, 9, 10, 14, 23
Exams:
Discussion Notes:
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.