Modify Your Search
Search Results
Your search for · CS 202 · during 27WI · returned 1 result
-
CS 202 Mathematics of Computer Science 6 credits
This course introduces some of the formal tools of computer science, using a variety of applications as a vehicle. You’ll learn how to encode data so that when you scratch the back of a DVD, it still plays just fine; how to distribute “shares” of your floor’s PIN so that any five of you can withdraw money from the floor bank account (but no four of you can); how to play chess; and more. Topics that we’ll explore along the way include: logic and proofs, number theory, elementary complexity theory and recurrence relations, basic probability, counting techniques, and graphs.
- Winter 2027
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): CS 111 with a grade of C- or better or received a score of 4 or better on the AP Computer Science exam or received a Carleton Computer Science 111 or better Requisite Equivalency AND MATH 101 or MATH 111 or greater with a grade of C- or better or greater or received a score of 4 or better on the Calculus AB AP exam or received a score of 4 or better on the Calculus BC AP exam or received a score of 5 or better on the Mathematics IB exam or received a Carleton MATH 111 or better Requisite Equivalency.
-
CS 202.01 Winter 2027
- Faculty: Sneha Narayan 🏫 👤
- Size:28
- M, WAnderson Hall 329 1:50pm-3:00pm
- FAnderson Hall 329 2:20pm-3:20pm
-
x Seats held for CS Match until the day after X priority registration.
Anticipated prefect-supported section.