|
Computer Science 361 Algorithms and Data Structures Fall 2018 |
| Course Details | Syllabus | Lectures | Resources |
|
Course Description: This course is an introduction to the design and analysis of algorithms for fundamental problems that arise in computer science. Students will learn about techniques such as greedy algorithms, divide-and-conquer, and dynamic programming along with more advanced topics (e.g. NP-completeness). Students will also learn how to analyze the complexity of an algorithm using asymptotic analysis, and how to prove the correctness of a algorithm using proof techniques such as induction. In addition to algorithms, this course also covers more advanced data structures -- e.g., balanced trees. |
|
Instructor: Prof. Chambers, Thompson 405, alchambers@pugetsound.edu Office Hours: 1-3pm Thursdays or by appointment Textbook: Jon Kleinberg and Eva Tardos. Algorithm Design. 1st Edition (Required) |
|
Classroom Emergency Response Guidance Please review university emergency preparedness, response procedures and a training video posted here. There is a link on the university home page. Familiarize yourself with hall exit doors and the designated gathering area for your class and laboratory buildings. If building evacuation becomes necessary (e.g. earthquake), meet your instructor at the designated gathering area so she/he can account for your presence. Then wait for further instructions. Do not return to the building or classroom until advised by a university emergency response representative. If confronted by an act of violence, be prepared to make quick decisions to protect your safety. Flee the area by running away from the source of danger if you can safely do so. If this is not possible, shelter in place by securing classroom or lab doors and windows, closing blinds, and turning off room lights. Lie on the floor out of sight and away from windows and doors. Place cell phones or pagers on vibrate so that you can receive messages quietly. Wait for further instructions. |