Lectures: ERB 130, MoTuWeTh 3:30pm-5:30pm.
Instructor: Vassilis Athitsos
This course teaches students how to design, choose, and evaluate appropriate algorithms when designing and implementing software. Students will learn a broad set of algorithms covering different problems, including sorting, search, spanning trees, and network flow. Students will also learn about basic data structures, such as linked lists, stacks, and queues. The course will also teach students basic methods for analyzing algorithmic properties such as time and space complexity.
Course web page:
Lecture times: MoTuWeTh 3:30pm-5:30pm.
Classroom: ERB 130.
Prerequisites: CSE 1320 (Intermediate Programming), CSE 2315 (Discrete Structures).
Textbook: Algorithms in C, Parts 1-5, by Robert Sedgewick. 3rd Edition, 2001, Addison-Wesley. ISBN-10: 0201756080. ISBN-13: 978-0201756081. NOTE: this textbook is usually sold as two volumes, one for parts 1-4, and one for part 5.