INSTRUCTOR: Sanjoy Baruah. (Click here for instructor's office hours, which are held at Jolley 404)

Teaching Assistants and office hours (in Jolley 408):

1. Charlie Wu (jiaye.wu[at]wustl[dot]edu). Office hours: Mon 10:30 am - 12:00 noon
2. Chloe Wright (Wright.e.chloe[at]gmail[dot]com). Office hours: Mon 4:30 - 6 pm
3. Zach Glick (zacharyglick[at]wustl[dot]edu). Office hours: Wed 8:30 - 10:00 am
4. Devanshu Save (devanshu[at]wustl[dot]edu). Office hours: Wed 2:30 - 4:00 pm
5. Xueyan Xie (xueyan.xie[at]wustl[dot]edu). Office hours: Thu 1:00 - 2:30 pm
6. Chen Lu (lu.chen[at]wustl[dot]edu). Office hours: Fri 5:30 - 7:00 pm
7. Tyler Orden (tylerorden[at]gmail[dot]com). Office hours: contact via email

TEXT: There is one required text for this course:

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein. Introduction to Algorithms, Third Edition. MIT Press.

The University Bulletin 2017-2018 description of this course says:

Provides a broad coverage of fundamental algorithm design techniques with the focus on developing efficient algorithms for solving combinatorial and optimization problems. The topics covered include: greedy algorithms, dynamic programming, linear programming, NP-completeness, approximation algorithms, lower bound techniques, and on-line algorithms. Throughout this course there is an emphasis on correctness proofs and the ability to apply the techniques taught to design efficient algorithms for problems from a wide variety of application areas.

SYLLABUS: Here is the syllabus (latest update: Jan 11) for this offering of CSE 541T.

PREREQUISITES:

• CSE 247: Data Structures and Algorithms
• (Although CSE 347: Analysis of Algorithms is listed as a prerequisite, this requirement will not be enforced nor assumed for this offering of the class.)

SPECIAL NEEDS: If you are entitled to extra accommodation for any reason (such as a disability), we make every reasonable attempt to accommodate you. However, it is your responsibility to discuss this with the instructor during the first week of the course.

TOPICS COVERED: Lecture outlines and handouts are made available here