Course Description (from the catalog)
Formerly CS 514N. This course, intended for new graduate students without a computer science background, covers the core components seen in a computer science undergraduate curriculum on which our graduate-level courses rely. Topics include algorithms, data structures, proof techniques, computational models, machine organization, and software design and implementation. This course meets no computer science degree requirement. Prerequisite: none.

Instructor: Richard Souvenir, Lopata 522, cse502@cec.wustl.edu
Office Hours:  By appointment (send e-mail to schedule)

Teaching Assistant: Jed Daily
Office Hours: Tues & Thurs 7:30pm - 9:30pm

Lecture times: Tuesday and Thursday, 5:30pm – 7:30pm
Lecture location:  Lopata 229
Laboratory time:  Thursday, 7:30pm – 9:30pm
Laboratory location:  Sever 203

Required texts:

• Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, Second Edition. MIT Press / McGraw-Hill, 2001.
• Kenneth H. Rosen. Discrete Mathematics and Its Applications, Fifth Edition. McGraw-Hill.