Class time will be devoted to live lectures on Zoom, and students are expected to work on problem sets outside of class. This class is remote with synchronous components. This means that we look at theoretical limitations, regardless of the functionalities offered by any given programming language. In this class, we study algorithms independently of their implementation. Therefore, analysis of algorithms goes along with asymptotic combinatorics, as we count the cost of running an algorithm in relationship to the size Most arguments in the analysis of algorithms assume that we repeat the procedure often enough, so it is worth analyzing its cost. Part of our exploration will imply asymptotic methods. This study needs an understanding of combinatorial structures and probabilistic arguments, which will be detailed in this course. Namely, we look at best-case, worst-case and average-case performance analysis, with emphasis on the latter. The approach for this class is the one introduced in the 60’s by Donald Ervin Knuth. Office hours: Monday 1:30-3:30 on Zoom (same meeting as lectures), and by appointment.Īnalysis of algorithms is a field of research on the edge of computer science and mathematics. X-hour: Th 12:30-1:20 PM, will likely not be used Practical payoff when their theories make it possible to get other jobsĭone more quickly and more economically.” That surround elegant computational procedures.
They experience the sheer beauty of elegant mathematical patterns “People who analyze algorithms have double happiness. Math 118, Topics in combinatorics, Mathematical Analysis of Algorithms
0 kommentar(er)
