Prerequisite(s): ( CS162 )

This course covers complexity analysis, approximation methods, trees and graphs, file processing, binary search trees, hashing, and storage management.

This course may be taken 1 time for credit.