CPSC 482

Data Structures II

Lec A1 selected

This course considers the design and analysis of efficient data structures and algorithms including extensions of those studied in CPSC 200 and 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.

Sections

Lecture

Syllabus

Have the syllabus for CPSC 482? Share it and everyone gets the grading, textbooks and rules.