CST 280 COMPUTER SCI III/DATA STRUCT'S
Continuation of Cst 250; focuses on basic techniques used to design and analyze efficient algorithms. The major topics include: data structures for sets, searching algorithms, divide and conquer, sorting algorithms, greedy algorithms, dynamic programming, pattern matching and fingerprinting, and computational complexity. A computer use course.
Credits:
3
Prerequisites:
MATH 245
(with a min grade of C-)
AND CST 250
(with a min grade of C-)
View the Course Finder for more detailed prerequisite information.
Course Notes:
