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

Past Term Data

Offered
Not Offered
Offered as Cross-Listing Only
No Term Data
Spring Summer Fall
(Session 1) (Session 2)
2023
Design & Analysis Of Algorithm (4c)
  • Elliot I. Anshelevich
Seats Taken: 69/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