Techniques of design and analysis of efficient algorithms for standard computational problems. NP-Completeness Project. Credit not allowed for both CS 3511 and CS 3510.
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
Merrick Furst
5 terms from Spring 2018 to Spring 2025
Spring 2025
Fall 2021
Spring 2020
Spring 2019
Spring 2018
Gerandy Brito
2 terms from Fall 2022 to Fall 2024
Fall 2024
Fall 2022
Gerard Jan Van Den Brand
2 terms from Fall 2023 to Spring 2024
Spring 2024
Fall 2023
Sahil Singla
Spring 2023
Prasad Tetali
Spring 2021
Kolomira-Elini Mihail
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
·