Search Results
Your search for courses · during 25FA · tagged with LING Related Field · returned 3 results
-
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.
- Fall 2025
- 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 254 Computability and Complexity 6 credits
An introduction to the theory of computation. What problems can and cannot be solved efficiently by computers? What problems cannot be solved by computers, period? Topics include formal models of computation, including finite-state automata, pushdown automata, and Turing machines; formal languages, including regular expressions and context-free grammars; computability and uncomputability; and computational complexity, particularly NP-completeness.
- Fall 2025
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): CS 200 with a grade of C- or better or CS 201 with a grade of C- or better or received a Carleton Computer Science 200 Requisite Equivalency AND CS 202 with a grade of C- or better or received a Carleton Computer Science 202 Requisite Equivalency or MATH 236 with a grade of C- or better or received a Carleton Math 236 Requisite Equivalency. MATH 236 will be accepted in lieu of CS 202.
-
CS 322 Natural Language Processing 6 credits
Advances like deep learning and large language models have led to computer programs that seem to converse intelligently with people. But how do these programs work, and do they really understand language? In this course, we’ll explore techniques that aim to enable computers to interpret and respond appropriately to ideas expressed using natural languages (such as Chinese or English) as opposed to formal languages (such as Python or C). Topics may include classical and modern approaches, and varying applications, such as machine translation, semantic analysis, and question answering.
- Fall 2025
- FSR, Formal or Statistical Reasoning QRE, Quantitative Reasoning
-
Student has completed any of the following course(s): CS 200 with a grade of C- or better or CS 201 with a grade of C- or better or received a Carleton Computer Science 200 Requisite Equivalency AND CS 202 with a grade of C- or better or received a Carleton Computer Science 202 Requisite Equivalency or MATH 236 with a grade of C- or better or received a Carleton Math 236 Requisite Equivalency. MATH 236 will be accepted in lieu of CS 202.
-
CS 322.01 Fall 2025
- Faculty:Anna Rafferty 🏫 👤
- Size:34
- M, WAnderson Hall 329 9:50am-11:00am
- FAnderson Hall 329 9:40am-10:40am
-
17 seats held for CS Match until the day after rising junior priority registration.