Search Results

C S 331 C S 331. Algorithms and Complexity. 3 Hours.

An investigation of algorithmic paradigms: divide and conquer, dynamic programming, greedy algorithms, graph algorithms, randomized algorithms, undecidability, NP-completeness, and approximation algorithms. Three lecture hours and one discussion hour a week for one semester. Only one of the following may be counted: Computer Science 331, 331H, 378 (Topic: Algorithms and Complexity). Prerequisite: The following coursework with a grade of at least C-: Computer Science 429 or 429H; Mathematics 362K or Statistics and Data Sciences 321; and credit with a grade of at least C- or registration for: Mathematics 340L, 341, or Statistics and Data Sciences 329C.

Bachelor of Science in Nutrition



...Honors : Dean's Scholars Honors...at least C- Foundation Science...321 , 330 , 331 , 332 , 370...

Admission and Registration



...331 with grades of at least a C...addition to the student's application for admission...

Bachelor of Science in Computer Science



...section Dean's Scholars Honors...flagged course c. Global cultures...or 311H , 331 or 331H...