Document Type

Syllabus

Publication Date

Spring 2024

Course Description

This course will survey a range of classic algorithms, from sorting and searching to numerical, graph, geometrical, and large-scale text processing. The emphasis will be on algorithm design principles and applications to problem solving.

Student Outcomes

Students will be able to describe and apply a wide range of classic algorithms Students will be able to use knowledge of algorithmic eciency to choose among multiple solutions to a problem Students will be able to categorize algorithm types, such as divide-and-conquer, dynamic programming, and heuristic search, and use these categories in solving new problems Students will be able to research and present in-depth topics in algorithm design

Download

Share

COinS