Data Structures, Algorithms, and Intractability: An IntroductionOffered this year and most years
This course will cover the basics of how to design and analyze data structures and algorithms. We will develop algorithmic intuition through rigorous analysis of algorithmic correctness and performance. We will also study the theory of NP-completeness, which helps us understand which problems are computationally intractable.
|Meeting Time:||TTh 3-4:20pm|