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 | |||||
SE 3345 Bhadrachalam Chitturi | |||||
B+ | |||||
Search Results
| Name | Grades | Rating | |||
|---|---|---|---|---|---|
Not teaching in Spring 2026 | |||||
SE 3345 Bhadrachalam Chitturi | |||||
B+ | |||||
Grades: 2,831
Median GPA: B+
Mean GPA: 3.065
3
Professor rating
3.5
Difficulty
70
Ratings given
50%
Would take again
Data Structures and Foundations of Algorithmic Analysis
SE 3345 (Same as CE 3345 and CS 3345)
Erik Jonsson School of Engineering and Computer Science
Analysis of algorithms including time complexity and Big-O notation. Analysis of stacks, queues, and trees, including B-trees. Heaps, hashing, and advanced sorting techniques. Disjoint sets and graphs. Course emphasizes design and implementation. 3 credit hours.
Prerequisites: ((CE 2305 or CS 2305) with a grade of C or better or (Data Science major and MATH 3315)) and (CE 2336 or CS 2336 or CS 2337) with a grade of C or better.
Offering Frequency: Each semester
Grades: 307
Median GPA: B+
Mean GPA: 3.028
Click a checkbox to add something to compare.
Grades: 2,831
Median GPA: B+
Mean GPA: 3.065
3
Professor rating
3.5
Difficulty
70
Ratings given
50%
Would take again
Data Structures and Foundations of Algorithmic Analysis
SE 3345 (Same as CE 3345 and CS 3345)
Erik Jonsson School of Engineering and Computer Science
Analysis of algorithms including time complexity and Big-O notation. Analysis of stacks, queues, and trees, including B-trees. Heaps, hashing, and advanced sorting techniques. Disjoint sets and graphs. Course emphasizes design and implementation. 3 credit hours.
Prerequisites: ((CE 2305 or CS 2305) with a grade of C or better or (Data Science major and MATH 3315)) and (CE 2336 or CS 2336 or CS 2337) with a grade of C or better.
Offering Frequency: Each semester
Grades: 307
Median GPA: B+
Mean GPA: 3.028
Click a checkbox to add something to compare.