# Design And Analysis Of Algorithms

## CSCI-4020

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.

4 credits
Prereqs:
CSCI-2300 Introduction To Algorithms

# Past Term Data
Offered
Not Offered
Offered as Cross-Listing Only
No Term Data
Simple View
Detailed View

| Spring | Summer | Fall
--- | --- | --- | ---
| (Session 1) | (Session 2) |
2025 | Design And Analysis Of Algorithms (4c) Elliot I. Anshelevich Seats Taken: 0/65 |  |
2024 | Design And Analysis Of Algorithms (4c) Elliot I. Anshelevich Seats Taken: 56/65 |  |
2023 | Design & Analysis Of Algorithm (4c) Elliot I. Anshelevich Seats Taken: 65/70 |  |
2022 | Design & Analysis Of Algorithm (4c) Elliot I. Anshelevich Seats Taken: 61/70 |  |
2021 | Design & Analysis Of Algorithm (4c) Elliot I. Anshelevich Shianne M. Hulbert Seats Taken: 61/70 |  |
2020 | Design And Analysis Of Algorithms (4c) Elliot I. Anshelevich Seats Taken: 64/70 |  |
2019 | Design And Analysis Of Algorithms (4c) Elliot I. Anshelevich Seats Taken: 31/45 |  |
2018 | Computer Algorithms (4c) Elliot I. Anshelevich Seats Taken: 61/100 |  |
2017 | Computer Algorithms (4c) Elliot I. Anshelevich Seats Taken: 53/60 |  |
2016 | Computer Algorithms (4c) Elliot I. Anshelevich Seats Taken: 54/60 |  |
2015 | Computer Algorithms (4c) Elliot I. Anshelevich Seats Taken: 36/50 |  |
2014 | Computer Algorithms (4c) Elliot I. Anshelevich Seats Taken: 30/32 |  |
2013 | Computer Algorithms (4c) Elliot I. Anshelevich Seats Taken: 44/60 |  |
2012 | Computer Algorithms (4c) Elliot I. Anshelevich Seats Taken: 33/60 |  |
2011 | Computer Algorithms (4c) Elliot I. Anshelevich Seats Taken: 44/60 |  |
2010 | Computer Algorithms (4c) Elliot I. Anshelevich Seats Taken: 36/50 |  |
2009 | Computer Algorithms (4c) Elliot I. Anshelevich Seats Taken: 44/50 |  |
2008 | Computer Algorithms (4c) Elliot I. Anshelevich Seats Taken: 23/30 |  |
2007 | Computer Algorithms (4c) Elliot I. Anshelevich Seats Taken: 46/60 |  |
2006 | Computer Algorithms (4c) Mark K Goldberg Seats Taken: 52/60 |  |
2005 | Computer Algorithms (4c) Bulent Yener Seats Taken: 52/60 |  |
2004 | Computer Algorithms (4c) Bulent Yener Seats Taken: 49/60 |  |
2003 | Computer Algorithms (4c) David R Musser Seats Taken: 48/60 |  |
2002 | Computer Algorithms (4c) David R Musser Seats Taken: 48/60 |  |
2001 | Computer Algorithms (4c) Mark K Goldberg Seats Taken: 51/60 |  |
2000 | Computer Algorithms (4c) Mohammed J. Zaki Seats Taken: 27/70 |  |
1999 | Computer Algorithms (4c) Mark K Goldberg Seats Taken: 21/60 |  |
1998 |  |  |