CSE 101: Design and Analysis of Algorithms

Fall 2019

 Announcements:

• First day of class September 27th 1pm in CENTR 105

Homeworks:

• None yet
  

Exams:

• None yet

Other:

• Course Syllabus
• An Introductory Guide to LaTeX
• Piazza page for the class
• Archive of problems and solutions from previous iterations of the class
• Lecture podcast (coming)
  
• Rough grading rubric
  

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.