Section 001 Lectures Tue,Thu 9:30am-10:50am, online
Section 900 Lectures Tue,Thu 9:30am-10:50am, online
Section 002 Lectures Tue,Thu 11am-12:20pm, online
Instructor: Alexandra Stefan
You can see any TA for help, not only the one assigned to your section.
Mon, Wed 2:30-3pm; Tue, Thu 12:30-1:30pm
or by appointment. Online, using Teams chat.
Textbook: Introduction to Algorithms, by Thomas H. Cormen, Charles E. Leiserson, Ronald E. Rivest, Clifford Stein,3rd edition (CLRS). - NOT required. All the material covered in homework and exams/quizzes will be provided in slides and discussed in lectures. Other reference: Algorithms in C, Parts 1-5, by Robert Sedgewick. 3rd Edition, 2001, Addison-Wesley. ISBN-10: 0201756080. ISBN-13: 978-0201756081. NOTE: this book is usually sold as two volumes, one for parts 1-4, and one for part 5. Most of the class topics are covered in part 1. This is a good text book with interesting code (available online as well) and algorithms. - NOT required
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.