Formal study of algorithms associated with various data structures. After precisely defining a mathematical model for algorithm analysis, there is a systematic study of various data structures such as list, tree and graph. Different designs of those data structures and operations are presented and discussed. In particular, the time complexity and space complexity of those algorithms are evaluated, analyzed and computed. Some other important topics on computational complexity such as NP-completeness and approximation algorithms are also covered. Springs. Prerequisite(s): CS 2380 and MA 3200.