Algorithms and Data Structures Ii

Algorithm design and analysis is a fundamental part of computer science. This course introduces students to advanced techniques for the design and analysis of algorithms, and explores a variety of applications. We will focus on three main themes: computational complexity, randomized algorithms, games and markets.

Upon completion of the course, students will be able to: (1) describe the main complexity classes of decision problems and prove some of their properties; (2) describe and analyze various randomized algorithms; (3) understand some of the main ideas in game theory and their application to online auctions and digital markets. These objectives will be assessed via an oral discussion whose evaluation will determine the final grade.