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 | |||
|---|---|---|---|---|---|
CS 2337 Jason Smith | |||||
A | |||||
Search Results
| Name | Grades | Rating | |||
|---|---|---|---|---|---|
CS 2337 Jason Smith | |||||
A | |||||

Grades: 2,626
Median GPA: B
Mean GPA: 2.740
3.4
Professor rating
4.3
Difficulty
289
Ratings given
56%
Would take again
Computer Science II
CS 2337
Erik Jonsson School of Engineering and Computer Science
Further applications of programming techniques, introducing the fundamental concepts of data structures and algorithms. Topics include recursion, fundamental data structures (including stacks, queues, linked lists, hash tables, trees, and graphs), and algorithmic analysis. Includes comprehensive programming projects. Programming language of choice is C++. Credit cannot be received for both CS 2337 and (CS 2336 or CE 2336). 3 credit hours.
Prerequisite: AP score of at least 4.
Offering Frequency: Each semester
Grades: 1,753
Median GPA: A
Mean GPA: 3.280
Click a checkbox to add something to compare.

Grades: 2,626
Median GPA: B
Mean GPA: 2.740
3.4
Professor rating
4.3
Difficulty
289
Ratings given
56%
Would take again
Computer Science II
CS 2337
Erik Jonsson School of Engineering and Computer Science
Further applications of programming techniques, introducing the fundamental concepts of data structures and algorithms. Topics include recursion, fundamental data structures (including stacks, queues, linked lists, hash tables, trees, and graphs), and algorithmic analysis. Includes comprehensive programming projects. Programming language of choice is C++. Credit cannot be received for both CS 2337 and (CS 2336 or CE 2336). 3 credit hours.
Prerequisite: AP score of at least 4.
Offering Frequency: Each semester
Grades: 1,753
Median GPA: A
Mean GPA: 3.280
Click a checkbox to add something to compare.