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+ | ||
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:
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+ | ||
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+ | ||
Design and Analysis of Computer Algorithms
Erik Jonsson School of Engineering and Computer Science
The study of efficient algorithms for various computational problems. Algorithm design techniques. Sorting, manipulation of data structures, graphs, matrix multiplication, and pattern matching. Complexity of algorithms, lower bounds, NP completeness. 3 credit hours.
Prerequisites: CS 5333 and CS 5343.
Offering Frequency: Each semester
Grades: 3,288
Median GPA: A-
Mean GPA: 3.516
Click a checkbox to add something to compare.
Design and Analysis of Computer Algorithms
Erik Jonsson School of Engineering and Computer Science
The study of efficient algorithms for various computational problems. Algorithm design techniques. Sorting, manipulation of data structures, graphs, matrix multiplication, and pattern matching. Complexity of algorithms, lower bounds, NP completeness. 3 credit hours.
Prerequisites: CS 5333 and CS 5343.
Offering Frequency: Each semester
Grades: 3,288
Median GPA: A-
Mean GPA: 3.516
Click a checkbox to add something to compare.
Search Results
| Name | Grades | Rating | |||
|---|---|---|---|---|---|
CS 6363 (Overall) | |||||
A- | |||||
CS 6363 Dung Huynh | |||||
A- | |||||
CS 6363 Benjamin Raichel | |||||
B+ | |||||
Not teaching in Fall 2026 | |||||
CS 6363 Sergey Bereg | |||||
B+ | |||||
CS 6363 Ramaswamy Chandrasekaran | |||||
A- | |||||
CS 6363 Bhadrachalam Chitturi | |||||
A- | |||||
CS 6363 Ovidiu Daescu | |||||
A- | |||||
CS 6363 Partha De | |||||
CS 6363 Ding Du | |||||
A- | |||||
CS 6363 Serdar Erbatur | |||||
A- | |||||
CS 6363 Emily Fox | |||||
A- | |||||
CS 6363 Balaji Raghavachari | |||||
B+ | |||||
Search Results
| Name | Grades | Rating | |||
|---|---|---|---|---|---|
CS 6363 (Overall) | |||||
A- | |||||
CS 6363 Dung Huynh | |||||
A- | |||||
CS 6363 Benjamin Raichel | |||||
B+ | |||||
Not teaching in Fall 2026 | |||||
CS 6363 Sergey Bereg | |||||
B+ | |||||
CS 6363 Ramaswamy Chandrasekaran | |||||
A- | |||||
CS 6363 Bhadrachalam Chitturi | |||||
A- | |||||
CS 6363 Ovidiu Daescu | |||||
A- | |||||
CS 6363 Partha De | |||||
CS 6363 Ding Du | |||||
A- | |||||
CS 6363 Serdar Erbatur | |||||
A- | |||||
CS 6363 Emily Fox | |||||
A- | |||||
CS 6363 Balaji Raghavachari | |||||
B+ | |||||