Skip to main content
TR EN

Course Catalog

CS 301 Algorithms 3 Credits
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, order-statistics, shortest path problems, and network-flows. An introduction to the computational complexity classes (such as P, NP, NP- hard, NP-complete, PSPACE) together with approximation algorithms and the performance evaluation of algorithm implementations in practice are also covered in the course.
Last Offered Terms Course Name SU Credit
Spring 2023-2024 Algorithms 3
Fall 2023-2024 Algorithms 3
Summer 2022-2023 Algorithms 3
Spring 2022-2023 Algorithms 3
Fall 2022-2023 Algorithms 3
Spring 2021-2022 Algorithms 3
Fall 2021-2022 Algorithms 3
Spring 2020-2021 Algorithms 3
Fall 2020-2021 Algorithms 3
Spring 2019-2020 Algorithms 3
Fall 2019-2020 Algorithms 3
Spring 2018-2019 Algorithms 3
Fall 2018-2019 Algorithms 3
Spring 2017-2018 Algorithms 3
Spring 2016-2017 Algorithms 3
Spring 2015-2016 Algorithms 3
Spring 2014-2015 Algorithms 3
Spring 2013-2014 Algorithms 3
Spring 2012-2013 Algorithms 3
Spring 2011-2012 Algorithms 3
Fall 2011-2012 Algorithms 3
Fall 2010-2011 Algorithms 3
Fall 2009-2010 Algorithms 3
Fall 2008-2009 Algorithms 3
Fall 2007-2008 Algorithms 3
Fall 2006-2007 Algorithms 3
Fall 2005-2006 Algorithms 3
Fall 2004-2005 Algorithms 3
Fall 2003-2004 Algorithms 3
Fall 2002-2003 Algorithms 3
Fall 2001-2002 Algorithms 3
Prerequisite: (MATH 204 - Undergraduate - Min Grade D
and CS 300 - Undergraduate - Min Grade D)
Corequisite: CS 301R
ECTS Credit: 6 ECTS (6 ECTS for students admitted before 2013-14 Academic Year)
General Requirements: