CSE347 Course Description

This is a course about fancy algorithms.

Topics include:

Greedy Algorithms
Dynamic Programming
Divide and Conquer
Maximum Flows
Reductions
NP-Complete Problems
Approximation Algorithms
Randomized Algorithms
Online Algorithms

It’s hard if you don’t know the tricks for solving leetcode problems.

I’ve been doing leetcode daily problems for almost 2 years when I get into the course.

It’s relatively easy for me but I do have a hard time to get every proof right.

Course Description

Introduces techniques for the mathematical analysis of algorithms, including randomized algorithms and non-worst-case analyses such as amortized and competitive analysis. Introduces the standard paradigms of divide-and-conquer, greedy, and dynamic programming algorithms, as well as reductions. Also provides an introduction to the study of intractability and techniques to determine when good algorithms cannot be designed. Note: A Wednesday recitation section will be required. Times TBD based on students’ schedules. Attendance is required for two evening exams. Evening exams will be October 22 and December 3 from 6:30 - 8:30pm. Prerequisites: (CSE 240 or Math 310) and CSE 247