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 | |||
|---|---|---|---|---|---|
CS 3345 Siva Sai Nagender Vasireddy | |||||
Search Results
| Name | Grades | Rating | |||
|---|---|---|---|---|---|
CS 3345 Siva Sai Nagender Vasireddy | |||||
Siva Sai Nagender Vasireddy
[email protected]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
Data Structures and Foundations of Algorithmic Analysis
CS 3345 (Same as CE 3345 and SE 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: 7,529
Median GPA: B+
Mean GPA: 3.245
Click a checkbox to add something to compare.
Siva Sai Nagender Vasireddy
[email protected]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
Data Structures and Foundations of Algorithmic Analysis
CS 3345 (Same as CE 3345 and SE 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: 7,529
Median GPA: B+
Mean GPA: 3.245
Click a checkbox to add something to compare.