In this course, students will learn to design and analyze efficient algorithms for sorting, searching, graphs, sets, matrices, and other applications. Students will also learn to recognize and prove NP-Completeness.
Prerequisite Courses:CS 04222 with a minimum grade of C- and CS 07210 with a minimum grade of D- Course Attributes: CAT, UGRD
