CS 301
Algorithms
Fall 2020-2021
Change Term
Main Statistics
FENS
Faculty
#37
Popularity
3.0
Credits
81.5%
Fill Rate
172
Actual Student
211
Total Capacity
Instructor Statistics
Hüsnü Yenigün
81.5%
172/211
Hüsnü Yenigün (100.0%)
Prerequisites
Corequisites
Other Terms
1999-2000
2000-2001
2001-2002
2002-2003
2003-2004
2004-2005
2005-2006
2006-2007
2007-2008
2008-2009
2009-2010
2010-2011
2011-2012
2012-2013
2013-2014
2014-2015
2015-2016
2016-2017
2017-2018
2018-2019
2019-2020
2020-2021
Course Catalog Entry
This course will cover algorithms for a variety of problems, as well as general algorithm design and analysis techniques such as divide-and-conquer, dynamic programming, and greedy algorithms. Specific topics include algorithm analysis, recurrences and asymptotic analysis; searching, sorting; algorithms for fundamental graph problems, such as depth-first search,connected components,topological sort,shortest paths.