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 | |||||
TE 3345 Greg Ozbirn | |||||
Search Results
| Name | Grades | Rating | |||
|---|---|---|---|---|---|
Not teaching in Spring 2026 | |||||
TE 3345 Greg Ozbirn | |||||
Grades: 3,874
Median GPA: B+
Mean GPA: 3.017
4.1
Professor rating
3.2
Difficulty
191
Ratings given
81%
Would take again
Data Structures and Introduction to Algorithmic Analysis
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 or TE 2305 with a grade of C or better) and (CE 2336 or CS 2336 or TE 2336 with a grade of C or better).
Prerequisite or Corequisite: (CS 3341 or SE 3341 or ENGR 3341).
Offering Frequency: Each semester
This professor/course combination hasn't been taught in the semesters you selected. To see more grade data, try changing your filters.
Grades: 0
Median GPA: None
Mean GPA: None
Click a checkbox to add something to compare.
Grades: 3,874
Median GPA: B+
Mean GPA: 3.017
4.1
Professor rating
3.2
Difficulty
191
Ratings given
81%
Would take again
Data Structures and Introduction to Algorithmic Analysis
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 or TE 2305 with a grade of C or better) and (CE 2336 or CS 2336 or TE 2336 with a grade of C or better).
Prerequisite or Corequisite: (CS 3341 or SE 3341 or ENGR 3341).
Offering Frequency: Each semester
This professor/course combination hasn't been taught in the semesters you selected. To see more grade data, try changing your filters.
Grades: 0
Median GPA: None
Mean GPA: None
Click a checkbox to add something to compare.