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:
5.0
Professor rating
5.0
Difficulty
1,000
Ratings given
99%
Would take again
Visit Rate My Professors
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+ | ||
Search Results
| Name | Grades | Rating | |||
|---|---|---|---|---|---|
Not teaching in Spring 2026 | |||||
CS 4349 Anjum Chida | |||||
A- | |||||
Search Results
| Name | Grades | Rating | |||
|---|---|---|---|---|---|
Not teaching in Spring 2026 | |||||
CS 4349 Anjum Chida | |||||
A- | |||||
Grades: 3,401
Median GPA: A
Mean GPA: 3.643
3.9
Professor rating
3.6
Difficulty
95
Ratings given
81%
Would take again
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.
Grades: 3,401
Median GPA: A
Mean GPA: 3.643
3.9
Professor rating
3.6
Difficulty
95
Ratings given
81%
Would take again
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.