Data Structures II

3 credits · Undergraduate

This course considers the design and analysis of efficient data structures and algorithms including extensions of those studied in CPSC 281. Also considered are general techniques for building and analyzing algorithms (greedy, divide and conquer, dynamic programming) and topics from: amortized time estimates, complexity analysis, and NP completeness. Prerequisite(s): CPSC 281-3, or permission of the instructor