This course presents fundamental ideas and techniques of modern algorithm design and analysis. After completing this course, students should be able to formally analyze and design efficient algorithms for a variety of computational problems. Topics covered include Greedy Algorithms, Dynamic Programming, Network Flow, NP-Completeness, Linear Programming, Network Algorithms, as well as probabilistic and approximate algorithms.
Spring | Summer | Fall | ||
---|---|---|---|---|
(Session 1) | (Session 2) | |||
2023 |
Design & Analysis Of Algorithm (4c)
|
|||
2022 |
Design & Analysis Of Algorithm (4c)
|
|||
2021 |
Design & Analysis Of Algorithm (4c)
|
|||
2020 |
Design And Analysis Of Algorithms (4c)
|
|||
2019 |
Design And Analysis Of Algorithms (4c)
|
|||
2018 |
Computer Algorithms (4c)
|
|||
2017 |
Computer Algorithms (4c)
|
|||
2016 |
Computer Algorithms (4c)
|
|||
2015 |
Computer Algorithms (4c)
|
|||
2014 |
Computer Algorithms (4c)
|
|||
2013 |
Computer Algorithms (4c)
|
|||
2012 |
Computer Algorithms (4c)
|
|||
2011 |
Computer Algorithms (4c)
|
|||
2010 |
Computer Algorithms (4c)
|
|||
2009 |
Computer Algorithms (4c)
|
|||
2008 |
Computer Algorithms (4c)
|
|||
2007 |
Computer Algorithms (4c)
|
|||
2006 |
Computer Algorithms (4c)
|
|||
2005 |
Computer Algorithms (4c)
|
|||
2004 |
Computer Algorithms (4c)
|
|||
2003 |
Computer Algorithms (4c)
|
|||
2002 |
Computer Algorithms (4c)
|
|||
2001 |
Computer Algorithms (4c)
|
|||
2000 |
Computer Algorithms (4c)
|
|||
1999 |
Computer Algorithms (4c)
|
|||
1998 |