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:
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 3349 (Overall) | |||||
CS 3349 Bhadrachalam Chitturi | |||||
Search Results
| Name | Grades | Rating | |||
|---|---|---|---|---|---|
CS 3349 (Overall) | |||||
CS 3349 Bhadrachalam Chitturi | |||||
Competitive Learning in Computer Science
CS 3349
Erik Jonsson School of Engineering and Computer Science
The course explores the following topics and their related problems: number theory, combinatorics, divide and conquer technique, dynamic programming technique, greedy algorithms, computational geometry, numerical methods, graph algorithms, network flows, and other advanced computing techniques. Students will use various algorithmic problem-solving platforms to quickly develop and implement working solutions for non-trivial computing problems. During the course, students will be required to participate in contests during the class. 3 credit hours.
Prerequisites: ((CE 2336 or CS 2336 or CS 2337) with a grade of B or better and (CE 2305 or CS 2305) with a grade of B or better and (CE 3345 or CS 3345 or SE 3345) with a grade of B or better) or instructor consent required.
Offering Frequency: Each year
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.
Competitive Learning in Computer Science
CS 3349
Erik Jonsson School of Engineering and Computer Science
The course explores the following topics and their related problems: number theory, combinatorics, divide and conquer technique, dynamic programming technique, greedy algorithms, computational geometry, numerical methods, graph algorithms, network flows, and other advanced computing techniques. Students will use various algorithmic problem-solving platforms to quickly develop and implement working solutions for non-trivial computing problems. During the course, students will be required to participate in contests during the class. 3 credit hours.
Prerequisites: ((CE 2336 or CS 2336 or CS 2337) with a grade of B or better and (CE 2305 or CS 2305) with a grade of B or better and (CE 3345 or CS 3345 or SE 3345) with a grade of B or better) or instructor consent required.
Offering Frequency: Each year
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.