Prerequisites: CS 141
Description: A study of efficient data structures and algorithms for solving problems from a variety of areas such as sorting, searching, selection, linear algebra, graph theory, and computational geometry. Also covers worst-case and average-case analysis using recurrence relations, generating functions, upper and lower bounds, and other methods.
Credit: May be taken Satisfactory (S) or No Credit (NC) with consent of instructor and graduate advisor.