Grades:
Median GPA:
Mean GPA:
Search Results
| Name | Grades | Rating |
|---|---|---|
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
My PlannerExplore and compare past grades, professor ratings, and reviews to find the perfect class.
Grades:
Median GPA:
Mean GPA:
Search Results
| Name | Grades | Rating |
|---|---|---|
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
Grades:
Median GPA:
Mean GPA:
Search Results
| Name | Grades | Rating |
|---|---|---|
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
Search Results
| Name | Grades | Rating |
|---|---|---|
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
Search Results
| Name | Grades | Rating |
|---|---|---|
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
Advanced Algorithm Design and Analysis
CS 4349
Erik Jonsson School of Engineering and Computer Science
Asymptomatic analysis, recurrences, and graph algorithms. Algorithm design techniques such as greedy method, dynamic programming, and divide-and-conquer. Issues from computational complexity. Course emphasizes a theoretical approach. 3 credit hours.
Prerequisites: (CE 2305 or CS 2305) with a grade of C or better, and (CE 3345 or CS 3345 or SE 3345).
Offering Frequency: Each semester
Grades: 5,926
Median GPA: B+
Mean GPA: 3.127
Click a checkbox to add something to compare.
Advanced Algorithm Design and Analysis
CS 4349
Erik Jonsson School of Engineering and Computer Science
Asymptomatic analysis, recurrences, and graph algorithms. Algorithm design techniques such as greedy method, dynamic programming, and divide-and-conquer. Issues from computational complexity. Course emphasizes a theoretical approach. 3 credit hours.
Prerequisites: (CE 2305 or CS 2305) with a grade of C or better, and (CE 3345 or CS 3345 or SE 3345).
Offering Frequency: Each semester
Grades: 5,926
Median GPA: B+
Mean GPA: 3.127
Click a checkbox to add something to compare.
Search Results
| Name | Grades | Rating | |||
|---|---|---|---|---|---|
CS 4349 (Overall) | |||||
B+ | |||||
CS 4349 Bhadrachalam Chitturi | |||||
B | |||||
CS 4349 Parisa Darbari | |||||
B | |||||
CS 4349 Ding Du | |||||
A- | |||||
CS 4349 Serdar Erbatur | |||||
B+ | |||||
CS 4349 James Willson | |||||
B | |||||
Not teaching in Spring 2026 | |||||
CS 4349 Sergey Bereg | |||||
A- | |||||
CS 4349 Ebru Cankaya | |||||
B | |||||
CS 4349 Anjum Chida | |||||
A- | |||||
CS 4349 Ovidiu Daescu | |||||
B- | |||||
CS 4349 Partha De | |||||
C+ | |||||
CS 4349 Emily Fox | |||||
B | |||||
CS 4349 Daniel Gibney | |||||
B | |||||
CS 4349 Richard Goodrum | |||||
B | |||||
CS 4349 Yunhui Guo | |||||
A | |||||
CS 4349 Jason Jue | |||||
B | |||||
CS 4349 Balaji Raghavachari | |||||
B- | |||||
CS 4349 Benjamin Raichel | |||||
B | |||||
Search Results
| Name | Grades | Rating | |||
|---|---|---|---|---|---|
CS 4349 (Overall) | |||||
B+ | |||||
CS 4349 Bhadrachalam Chitturi | |||||
B | |||||
CS 4349 Parisa Darbari | |||||
B | |||||
CS 4349 Ding Du | |||||
A- | |||||
CS 4349 Serdar Erbatur | |||||
B+ | |||||
CS 4349 James Willson | |||||
B | |||||
Not teaching in Spring 2026 | |||||
CS 4349 Sergey Bereg | |||||
A- | |||||
CS 4349 Ebru Cankaya | |||||
B | |||||
CS 4349 Anjum Chida | |||||
A- | |||||
CS 4349 Ovidiu Daescu | |||||
B- | |||||
CS 4349 Partha De | |||||
C+ | |||||
CS 4349 Emily Fox | |||||
B | |||||
CS 4349 Daniel Gibney | |||||
B | |||||
CS 4349 Richard Goodrum | |||||
B | |||||
CS 4349 Yunhui Guo | |||||
A | |||||
CS 4349 Jason Jue | |||||
B | |||||
CS 4349 Balaji Raghavachari | |||||
B- | |||||
CS 4349 Benjamin Raichel | |||||
B | |||||