Great Ideas in Theoretical Computer Science

12 units · Undergraduate

Fall and Spring: 12 units This course is about how to use theoretical ideas to formulate and solve problems in computer science. It integrates mathematical material with general problem solving techniques and computer science applications. Examples are drawn from algorithms, complexity theory, game theory, probability theory, graph theory, automata theory, algebra, cryptography, and combinatorics. Assignments involve both mathematical proofs and programming. NOTE: students must achieve a C or better in order to use this course to satisfy the pre-requisite for any subsequent Computer Science course. Prerequisites: ( 15-122 Min. grade C or 15-150 Min. grade C) and ( 21-128 Min. grade C or 21-127 Min. grade C or 15-151 Min. grade C) Course Website: https://www.cs251.com