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:
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 | |||||
CE 6320 Kanad Basu | |||||
A- | |||||
Search Results
| Name | Grades | Rating | |||
|---|---|---|---|---|---|
Not teaching in Spring 2026 | |||||
CE 6320 Kanad Basu | |||||
A- | |||||

Grades: 515
Median GPA: A-
Mean GPA: 3.410
4.4
Professor rating
3
Difficulty
24
Ratings given
79%
Would take again
Applied Data Structures and Algorithms
CE 6320
Erik Jonsson School of Engineering and Computer Science
Introduction to complexity, basic data structures, lists, trees, graphs; Sorting, Shortest Path, and Dynamic Programming, Spanning Tree and Greedy Algorithms, Introduction to Network Flow, NP, NP-complete, and NP-hard. May not be used to satisfy degree requirements for MS CS or the MS SE degree plans. 3 credit hours.
Offering Frequency: Each year
Grades: 146
Median GPA: A-
Mean GPA: 3.576
Click a checkbox to add something to compare.

Grades: 515
Median GPA: A-
Mean GPA: 3.410
4.4
Professor rating
3
Difficulty
24
Ratings given
79%
Would take again
Applied Data Structures and Algorithms
CE 6320
Erik Jonsson School of Engineering and Computer Science
Introduction to complexity, basic data structures, lists, trees, graphs; Sorting, Shortest Path, and Dynamic Programming, Spanning Tree and Greedy Algorithms, Introduction to Network Flow, NP, NP-complete, and NP-hard. May not be used to satisfy degree requirements for MS CS or the MS SE degree plans. 3 credit hours.
Offering Frequency: Each year
Grades: 146
Median GPA: A-
Mean GPA: 3.576
Click a checkbox to add something to compare.