Algorithms

Catalog description

This course examines the range of algorithms for various computational problems, recognizing their strengths and weaknesses, and their suitability in particular contexts. Algorithm design techniques with time and space efficiency are a pervasive theme throughout this course. Course will cover sorting, manipulation of data structures, graphs, matrix multiplication, and pattern matching.