CSE 3500: Algorithms and Complexity
This course is for undergraduate students to learn basic concepts
and techniques in
algorithms and complexity.
Wednesday and Friday, 10-11 am.
Instructor: Yufeng Wu
(email@example.com), ITE 235. Office hour: Monday, Wednesday and
11:00-12 pm or by
TA: Chong Chu (
CSE 2100 (Data structure and intro. to algorithms) and CSE 2500
(Introduction to discrete systems). Some topics need some basic knowledge
Moreover, you need to know how to program. We will have
programming assignments in this class.
You can use any programming language.
The required textbook is: Algorithm Design by Kleinberg and
Occasionally I will also use some materials from: Introduction
to Algorithms, 3rd edition
by Thomas Cormen, Charles Leiserson, Ronald Rivest, and Clifford
Stein. MIT Press, 2009.
Several chapters are available online at the above web page.
Many lectures are based on this book, although we will sometimes
cover topics not in the book (where notes and handout will be
provided) and of course
we can not cover every chapter of the book.
Outline. This course is lecture-based. The planned subjects are the following
(subject to change).
1) Fundamental concepts of algorithms. Asymptotic order of growth.
Basic running time analysis.
Graph related topics.
2) Basic algorithm techniques. Divide and conquer. Dynamic programming. Greedy
Algorithms for graphs: basic algorithms, minimum spanning tree and
3) Advanced algorithms and complexity. NP-completeness. Randomized algorithms.
Selected topics in algorithms (e.g. network flows). Algorithms for
For more details on planned topics, please look at the planned
schedule (from the course web page).
We will have homework every one to two weeks. Work
hard on them, even though
homework does not carry big weights on grading. This is the best
way to prepare for exams.
Much of what you learn from this course comes from the homework.
Your solutions should be
concise, correct and legible. Some of the problems may be
challenging, depending on your
background. If you can not solve a problem, briefly explain where
the difficulty is. You are required to
submit the homework electronically (in PDF format). We appreciate
greatly if you typeset the homework.
One good typesetting tool is Latex (google it). Latex is a bit
difficult to pick up but it is very powerful.
Or you may type the English part and write by hand, very clearly,
any mathematical parts, and then scan it.
Do NOT write code, and try to limit the amount of pseudo-code you
Note: you need to
acknowledge any source of ideas other than the textbook. You must
write the solutions on your own.
assignment: while this course is mostly theoretical, I
have found that it can be useful to
put what is covered in class into action. I plan to assign up to
two programming assignments. In these
assignments, you will have chances to implement algorithms and
also evaluate their performance.
Exams. There are three 50 minutes exams for this
course and a final exam. Exams will be closed book.
Homework and programming assignments (30%), exam 1 (10%), exam 2
(15%), exam 3 (15%) and final (30%).