CSCI 0302
Algorithms and Complexity
Algorithms and Complexity
This course focuses on the development of correct and efficient algorithmic solutions to computational problems, on the underlying data structures to support these algorithms, and on the social implications of algorithms. Topics include computational complexity, analysis of algorithms, proof of algorithm correctness, some advanced data structures, algorithmic techniques including greedy and dynamic programming, and the consequences of real-world applications of algorithms. The course complements the treatment of NP-completeness in CSCI 0301. (CSCI 0200 and CSCI 0201) 3 hrs. lect./disc.
This course focuses on the development of correct and efficient algorithmic solutions to computational problems, on the underlying data structures to support these algorithms, and on the social implications of algorithms. Topics include computational complexity, analysis of algorithms, proof of algorithm correctness, some advanced data structures, algorithmic techniques including greedy and dynamic programming, and the consequences of real-world applications of algorithms. The course complements the treatment of NP-completeness in CSCI 0301. (CSCI 0200 and CSCI 0201) 3 hrs. lect./disc.
- Subject:
- Computer Science
- Department:
- Computer Science
- Division:
- Natural Sciences
- Requirements Fulfilled:
- DED
- Levels:
- Undergraduate
Sections
Spring 2026
CSCI0302A-S26
Lecture
CSCI0302B-S26
Lecture
Fall 2025
Spring 2025
Fall 2024
Spring 2024
Fall 2023
Spring 2023
Spring 2022
Fall 2021
Spring 2021
Fall 2020
Spring 2020
Fall 2019
Spring 2019
Fall 2018
Spring 2018
Fall 2017
Spring 2017
Fall 2016
Spring 2016
Spring 2015
Spring 2014
Spring 2013
Spring 2012
Spring 2011
Spring 2010
Spring 2009
CSCI0302A-S09
Lecture
Spring 2008
CSCI0302A-S08
Lecture
Spring 2007
Spring 2006
CSCI0302A-S06
Lecture
Spring 2005
Spring 2004
CSCI0302A-S04
Lecture