Basic techniques of design and analysis of efficient algorithms for standard computational problems. NP-Completeness. Credit not allowed for both CS 3510 and CS 3511.
Requisites
Prerequisites:
(CS 2050 (Min. Grade: C) or CS 2051 (Min. Grade: C) or MATH 2106 (Min. Grade: C)) and (CS 1332 (Min. Grade: C) or MATH 3012 (Min. Grade: D) or MATH 3022 (Min. Grade: D))
Restrictions:
Must be enrolled in one of the following Campuses: Georgia Tech-Atlanta * (A)
All Instructors
This total includes data from semesters with unknown instructors
David Hillegass
Summer 2025
Gerandy Brito
14 terms from Summer 2019 to Summer 2025
Spring 2025
Fall 2024
Summer 2024
Summer 2023
Fall 2022
Spring 2022
Summer 2021
Spring 2021
Fall 2020
Summer 2020
Spring 2020
Fall 2019
Summer 2019
Abrahim Ladha
5 terms from Spring 2023 to Summer 2025
Spring 2024
Fall 2023
Spring 2023
Zongchen Chen
Frederic Faulkner
2 terms from Spring 2022 to Summer 2024
Merrick Furst
3 terms from Spring 2017 to Spring 2024
Spring 2017
Gerard Jan Van Den Brand
Sahil Singla
William Perkins
He Jia
Konstantinos Dovrolis
4 terms from Spring 2019 to Spring 2023
Spring 2019
Dana Randall
3 terms from Fall 2018 to Fall 2022
Fall 2018
Shahrokh Shahi
Summer 2022
Jacob Abernethy
Fall 2021
Eric Vigoda
3 terms from Spring 2018 to Spring 2020
Spring 2018
Di Wang
Kolomira-Elini Mihail
2 terms from Summer 2016 to Fall 2018
Summer 2016
Megan Bernstein
Summer 2018
Yang Peng
2 terms from Fall 2016 to Fall 2017
Fall 2017
Fall 2016
Sarah Cannon
Summer 2017
H. Venkateswaran
2 terms from Fall 2016 to Spring 2017
Website Lead
Buzz Grades is maintained by Donghyun "Vince" Kim · Data: LITE (2016-2025), Course Catalog & OSCAR
Copyright
2025 Donghyun Kim, Buzz Grades
·