2023-02-10 05:09:16 +00:00
<!DOCTYPE html>
2023-02-10 04:02:50 +00:00
< html >
< head >
< title >
2023-02-10 22:45:16 +00:00
CSCI-4020: Design and Analysis of Algorithms
2023-02-10 04:02:50 +00:00
< / title >
2023-02-10 22:45:16 +00:00
< meta property = "og:title" content = "CSCI-4020: Design and Analysis of Algorithms" >
2023-02-10 04:02:50 +00:00
< meta property = "og:description" content = "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." >
2023-02-10 04:31:43 +00:00
< link rel = "stylesheet" href = "../css/common.css" >
< link rel = "stylesheet" href = "../css/coursedisplay.css" >
2023-02-10 22:45:16 +00:00
< script src = "../js/fuse.js" >
< script src = "../js/search_helper.js" >
2023-02-10 04:02:50 +00:00
< / head >
< body class = "search_plugin_added" >
< div id = "qlog-header" >
2023-02-10 05:09:16 +00:00
< a id = "qlog-wordmark" href = "../" > < svg > < use href = "../images/quatalogHWordmark.svg#QuatalogHWordmark" > < / use > < / svg > < / a >
2023-02-10 21:00:10 +00:00
< form onsubmit = "search_helper()" >
< input type = "text" id = "search" class = "header-search" placeholder = "Search..." >
< / form >
2023-02-10 04:02:50 +00:00
< / div >
< div id = "cd-flex" >
< div id = "course-info-container" >
< h1 id = "name" >
Design and Analysis of Algorithms
< / h1 >
< h2 id = "code" >
CSCI-4020
< / h2 >
< p >
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.
< / p >
< div id = "cattrs-container" >
< span id = "credits-pill" class = "attr-pill" >
4 credits
< / span >
< / div >
< div id = "prereq-container" class = "rel-info-container" >
< div id = "prereq-title" class = "rel-info-title" >
Prereqs:
< / div >
< div id = "prereq-classes" class = "rel-info-courses" >
< a class = "course-pill" href = "CSCI-2300.html" > CSCI-2300 Introduction to Algorithms< / a >
< / div >
< / div >
< / div >
< div id = "past-container" >
2023-02-10 05:09:16 +00:00
< h1 id = "past-title" >
2023-02-10 04:02:50 +00:00
Past Term Data
< / h2 >
2023-02-10 04:31:43 +00:00
< input type = "radio" id = "simple-view-input" name = "view-select" value = "simple" checked = "checked" >
< input type = "radio" id = "detail-view-input" name = "view-select" value = "detailed" >
2023-02-10 04:02:50 +00:00
< div id = "opt-container" >
< div id = "key-panel" >
< div id = "yes-code" class = "key-code" >
< span class = "code-icon" id = "yes-code-icon" >
2023-02-10 05:09:16 +00:00
< svg > < use href = "../icons.svg#circle-check" > < / use > < / svg >
2023-02-10 04:02:50 +00:00
< / span >
Offered
< / div >
< div id = "no-code" class = "key-code" >
< span class = "code-icon" id = "no-code-icon" >
2023-02-10 05:09:16 +00:00
< svg > < use href = "../icons.svg#circle-no" > < / use > < / svg >
2023-02-10 04:02:50 +00:00
< / span >
Not Offered
< / div >
< div id = "diff-code" class = "key-code" >
< span class = "code-icon" id = "diff-code-icon" >
2023-02-10 05:09:16 +00:00
< svg > < use href = "../icons.svg#circle-question" > < / use > < / svg >
2023-02-10 04:02:50 +00:00
< / span >
Offered as Cross-Listing Only
< / div >
< div id = "nil-code" class = "key-code" >
< span class = "code-icon" id = "nil-code-icon" >
2023-02-10 05:09:16 +00:00
< svg > < use href = "../icons.svg#circle-empty" > < / use > < / svg >
2023-02-10 04:02:50 +00:00
< / span >
No Term Data
< / div >
< / div >
< div id = "control-panel" >
< label for = "simple-view-input" id = "simple-view-label" class = "view-option-label" >
< span class = "view-icon" id = "simple-view-icon" >
2023-02-10 05:09:16 +00:00
< span class = "view-icon-selected" > < svg > < use href = "../icons.svg#circle-dot" > < / use > < / svg > < / span >
< span class = "view-icon-unselected" > < svg > < use href = "../icons.svg#circle-empty" > < / use > < / svg > < / span >
2023-02-10 04:02:50 +00:00
< / span >
Simple View
< / label >
< label for = "detail-view-input" id = "detail-view-label" class = "view-option-label" >
< span class = "view-icon" id = "detail-view-icon" >
2023-02-10 05:09:16 +00:00
< span class = "view-icon-selected" > < svg > < use href = "../icons.svg#circle-dot" > < / use > < / svg > < / span >
< span class = "view-icon-unselected" > < svg > < use href = "../icons.svg#circle-empty" > < / use > < / svg > < / span >
2023-02-10 04:02:50 +00:00
< / span >
Detailed View
< / label >
< / div >
< / div >
2023-02-10 21:00:10 +00:00
< table id = "years-table" >
2023-02-10 04:02:50 +00:00
< thead >
< tr >
< th > < / th >
< th class = "spring season-label" > Spring< / th >
< th class = "summer season-label" colspan = "2" > Summer< / th >
< th class = "fall season-label" > Fall< / th >
< / tr >
< tr >
< th colspan = "2" > < / th >
< th class = "summer2 midsum-label" > (Session 1)< / th >
< th class = "summer3 midsum-label" > (Session 2)< / th >
< th > < / th >
< / tr >
< / thead >
< tbody >
< tr >
< th class = "year" > 2023< / th >
< td class = "term spring offered" >
< div class = "view-container detail-view-container" >
< span class = "term-course-info" >
Design & Analysis Of Algorithm (4c)
< / span >
< ul class = "prof-list" >
< li > Elliot I. Anshelevich< / li >
< / ul >
< span class = "course-capacity" >
Seats Taken: 69/70
< / span >
< / div >
< / td >
< td colspan = "2" class = "term summer not-offered" >
< / td >
< td class = "term fall not-offered" >
< / td >
< / tr >
< tr >
< th class = "year" > 2022< / th >
< td class = "term spring offered" >
< div class = "view-container detail-view-container" >
< span class = "term-course-info" >
Design & Analysis Of Algorithm (4c)
< / span >
< ul class = "prof-list" >
< li > Elliot I. Anshelevich< / li >
< / ul >
< span class = "course-capacity" >
Seats Taken: 61/70
< / span >
< / div >
< / td >
< td colspan = "2" class = "term summer not-offered" >
< / td >
< td class = "term fall not-offered" >
< / td >
< / tr >
< tr >
< th class = "year" > 2021< / th >
< td class = "term spring offered" >
< div class = "view-container detail-view-container" >
< span class = "term-course-info" >
Design & Analysis Of Algorithm (4c)
< / span >
< ul class = "prof-list" >
< li > Elliot I. Anshelevich< / li >
< li > Shianne M. Hulbert< / li >
< / ul >
< span class = "course-capacity" >
Seats Taken: 61/70
< / span >
< / div >
< / td >
< td colspan = "2" class = "term summer not-offered" >
< / td >
< td class = "term fall not-offered" >
< / td >
< / tr >
< tr >
< th class = "year" > 2020< / th >
< td class = "term spring offered" >
< div class = "view-container detail-view-container" >
< span class = "term-course-info" >
Design And Analysis Of Algorithms (4c)
< / span >
< ul class = "prof-list" >
< li > Elliot I. Anshelevich< / li >
< / ul >
< span class = "course-capacity" >
Seats Taken: 64/70
< / span >
< / div >
< / td >
< td colspan = "2" class = "term summer not-offered" >
< / td >
< td class = "term fall not-offered" >
< / td >
< / tr >
< tr >
< th class = "year" > 2019< / th >
< td class = "term spring offered" >
< div class = "view-container detail-view-container" >
< span class = "term-course-info" >
Design And Analysis Of Algorithms (4c)
< / span >
< ul class = "prof-list" >
< li > Elliot I. Anshelevich< / li >
< / ul >
< span class = "course-capacity" >
Seats Taken: 31/45
< / span >
< / div >
< / td >
< td colspan = "2" class = "term summer not-offered" >
< / td >
< td class = "term fall not-offered" >
< / td >
< / tr >
< tr >
< th class = "year" > 2018< / th >
< td class = "term spring offered" >
< div class = "view-container detail-view-container" >
< span class = "term-course-info" >
Computer Algorithms (4c)
< / span >
< ul class = "prof-list" >
< li > Elliot I. Anshelevich< / li >
< / ul >
< span class = "course-capacity" >
Seats Taken: 61/100
< / span >
< / div >
< / td >
< td colspan = "2" class = "term summer not-offered" >
< / td >
< td class = "term fall not-offered" >
< / td >
< / tr >
< tr >
< th class = "year" > 2017< / th >
< td class = "term spring offered" >
< div class = "view-container detail-view-container" >
< span class = "term-course-info" >
Computer Algorithms (4c)
< / span >
< ul class = "prof-list" >
< li > Elliot I. Anshelevich< / li >
< / ul >
< span class = "course-capacity" >
Seats Taken: 53/60
< / span >
< / div >
< / td >
< td colspan = "2" class = "term summer not-offered" >
< / td >
< td class = "term fall not-offered" >
< / td >
< / tr >
< tr >
< th class = "year" > 2016< / th >
< td class = "term spring offered" >
< div class = "view-container detail-view-container" >
< span class = "term-course-info" >
Computer Algorithms (4c)
< / span >
< ul class = "prof-list" >
< li > Elliot I. Anshelevich< / li >
< / ul >
< span class = "course-capacity" >
Seats Taken: 54/60
< / span >
< / div >
< / td >
< td colspan = "2" class = "term summer not-offered" >
< / td >
< td class = "term fall not-offered" >
< / td >
< / tr >
< tr >
< th class = "year" > 2015< / th >
< td class = "term spring offered" >
< div class = "view-container detail-view-container" >
< span class = "term-course-info" >
Computer Algorithms (4c)
< / span >
< ul class = "prof-list" >
< li > Elliot I. Anshelevich< / li >
< / ul >
< span class = "course-capacity" >
Seats Taken: 36/50
< / span >
< / div >
< / td >
< td colspan = "2" class = "term summer not-offered" >
< / td >
< td class = "term fall not-offered" >
< / td >
< / tr >
< tr >
< th class = "year" > 2014< / th >
< td class = "term spring offered" >
< div class = "view-container detail-view-container" >
< span class = "term-course-info" >
Computer Algorithms (4c)
< / span >
< ul class = "prof-list" >
< li > Elliot I. Anshelevich< / li >
< / ul >
< span class = "course-capacity" >
Seats Taken: 30/32
< / span >
< / div >
< / td >
< td colspan = "2" class = "term summer not-offered" >
< / td >
< td class = "term fall not-offered" >
< / td >
< / tr >
< tr >
< th class = "year" > 2013< / th >
< td class = "term spring offered" >
< div class = "view-container detail-view-container" >
< span class = "term-course-info" >
Computer Algorithms (4c)
< / span >
< ul class = "prof-list" >
< li > Elliot I. Anshelevich< / li >
< / ul >
< span class = "course-capacity" >
Seats Taken: 44/60
< / span >
< / div >
< / td >
< td colspan = "2" class = "term summer not-offered" >
< / td >
< td class = "term fall not-offered" >
< / td >
< / tr >
< tr >
< th class = "year" > 2012< / th >
< td class = "term spring offered" >
< div class = "view-container detail-view-container" >
< span class = "term-course-info" >
Computer Algorithms (4c)
< / span >
< ul class = "prof-list" >
< li > Elliot I. Anshelevich< / li >
< / ul >
< span class = "course-capacity" >
Seats Taken: 33/60
< / span >
< / div >
< / td >
< td colspan = "2" class = "term summer not-offered" >
< / td >
< td class = "term fall not-offered" >
< / td >
< / tr >
< tr >
< th class = "year" > 2011< / th >
< td class = "term spring offered" >
< div class = "view-container detail-view-container" >
< span class = "term-course-info" >
Computer Algorithms (4c)
< / span >
< ul class = "prof-list" >
< li > Elliot I. Anshelevich< / li >
< / ul >
< span class = "course-capacity" >
Seats Taken: 44/60
< / span >
< / div >
< / td >
< td colspan = "2" class = "term summer not-offered" >
< / td >
< td class = "term fall not-offered" >
< / td >
< / tr >
< tr >
< th class = "year" > 2010< / th >
< td class = "term spring offered" >
< div class = "view-container detail-view-container" >
< span class = "term-course-info" >
Computer Algorithms (4c)
< / span >
< ul class = "prof-list" >
< li > Elliot I. Anshelevich< / li >
< / ul >
< span class = "course-capacity" >
Seats Taken: 36/50
< / span >
< / div >
< / td >
< td colspan = "2" class = "term summer not-offered" >
< / td >
< td class = "term fall not-offered" >
< / td >
< / tr >
< tr >
< th class = "year" > 2009< / th >
< td class = "term spring offered" >
< div class = "view-container detail-view-container" >
< span class = "term-course-info" >
Computer Algorithms (4c)
< / span >
< ul class = "prof-list" >
< li > Elliot I. Anshelevich< / li >
< / ul >
< span class = "course-capacity" >
Seats Taken: 44/50
< / span >
< / div >
< / td >
< td colspan = "2" class = "term summer not-offered" >
< / td >
< td class = "term fall not-offered" >
< / td >
< / tr >
< tr >
< th class = "year" > 2008< / th >
< td class = "term spring offered" >
< div class = "view-container detail-view-container" >
< span class = "term-course-info" >
Computer Algorithms (4c)
< / span >
< ul class = "prof-list" >
< li > Elliot I. Anshelevich< / li >
< / ul >
< span class = "course-capacity" >
Seats Taken: 23/30
< / span >
< / div >
< / td >
< td colspan = "2" class = "term summer not-offered" >
< / td >
< td class = "term fall not-offered" >
< / td >
< / tr >
< tr >
< th class = "year" > 2007< / th >
< td class = "term spring unscheduled" >
< / td >
< td colspan = "2" class = "term summer unscheduled" >
< / td >
< td class = "term fall not-offered" >
< / td >
< / tr >
< / tbody >
< / table >
< / div >
< / div >
< / body >
< / html >
