This will also be an introduction to the role of randomization in algorithm design. Next, we will study hashtables: a highly useful data structure that allows for efficient search and retrieval from ...

Students must have completed Algorithms and Computation (MA407) or have taken an equivalent course to provide a basic knowledge in analysis of ... Rivest and C. Stein, Introduction to Algorithms, 3rd ...

Managing program complexity using abstraction. Introduction to algorithm analysis and Big-O notation. Advanced language features. Basic sorting and searching algorithms. Recursion. Lecture two hours, ...