CSE 101: Design and Analysis of
- First day of class is January 3rd at 1pm pacific over zoom here.
- Discussion sections are Thursdays at 6pm on zoom here.
- Starting January 31st class will be held in CENTR 115
: 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.