Prerequisites: CS 141
Description: A study of efficient data structures and algo- rithms for solving problems from a variety of areas such as sorting, searching, selection, linear algebra, graph theory, and computational geometry. Also cov- ers worst-case and average-case analysis using recur- rence relations, generating functions, upper and lower bounds, and other methods. May be taken Satisfactory (S) or No Credit (NC) by students advanced to candidacy for the Ph.D.