Search Results
Your search for courses · during 25FA, 26WI, 26SP · meeting requirements for FSR, Formal or Statistical Reasoning · returned 60 results
-
ARTS 220* Art, Interactivity, and Microcontrollers (*=Junior Seminar) 6 credits
In this hands-on course, taught (in an art studio) by a sculpture professor and computer science professor, we'll explore and create interactive three dimensional art. Using basic construction techniques, microprocessors, and programming, we bring together sculpture, engineering, computer science, and aesthetic design. Students engage the nuts and bolts of fabrication, learn to program microcontrollers, and study the design of interactive constructions. Additionally, students will deliver technical presentations describing their work and receive feedback for improvement. Collaborative labs and individual projects culminate in a campus-wide exhibition. No prior building experience is required.
ARTS 220* is cross listed with CS 220*.
Seats held for Art and Art History majors and CS Match.
Extra Time Required: Field trip to the Walker sculpture garden.
- Spring 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): CS 111 a grade of C- or better or a score of 4 or better on the Computer Science A AP exam or received a Carleton Computer Science 111 Requisite Equivalency. Not open to students who have taken CS 232 or CS 220.
-
CS 111 Introduction to Computer Science 6 credits
This course will introduce you to computer programming and the design of algorithms. By writing programs to solve problems in areas such as image processing, text processing, and simple games, you will learn about recursive and iterative algorithms, complexity analysis, graphics, data representation, software engineering, and object-oriented design. No previous programming experience is necessary.
Sophomore Priority section is available
- Fall 2025, Winter 2026, Spring 2026
- FSR, Formal or Statistical Reasoning QRE, Quantitative Reasoning
-
NOT open to students who have completed any of the following course(s): CS 200 or greater with a grade of C- or better.
-
CS 200 Data Structures with Problem Solving 6 credits
Think back to your favorite assignment from Introduction to Computer Science. Did you ever get the feeling that “there has to be a better/smarter way to do this problem”? The Data Structures course is all about how to store information intelligently and access it efficiently. How can Google take your query, compare it to billions of web pages, and return the answer in less than one second? How can one store information so as to balance the competing needs for fast data retrieval and fast data modification? To help us answer questions like these, we will analyze and implement stacks, queues, trees, linked lists, graphs, and hash tables. This version of Data Structures includes extra class time to support students’ problem solving by meeting five days per week, and is encouraged for students who may have struggled in CS111 or otherwise believe they would benefit from extra support. This course fulfills all requirements of CS 201, and students should take only one of CS 200 or CS 201.
Not open to students who have taken CS 201. This course meets 5 days a week
- Winter 2026
- FSR, Formal or Statistical Reasoning QRE, Quantitative Reasoning
-
Student has completed any of the following course(s): CS 111 with a grade of C- or better or a score of 4 or better on the Computer Science A AP exam or received a Carleton Computer Science 111 Requisite Equivalency. Not open to students that have taken CS 201.
-
CS 201 Data Structures 6 credits
Think back to your favorite assignment from Introduction to Computer Science. Did you ever get the feeling that “there has to be a better/smarter way to do this problem”? The Data Structures course is all about how to store information intelligently and access it efficiently. How can Google take your query, compare it to billions of web pages, and return the answer in less than one second? How can one store information so as to balance the competing needs for fast data retrieval and fast data modification? To help us answer questions like these, we will analyze and implement stacks, queues, trees, linked lists, graphs, and hash tables. Students who have received credit for a course for which Computer Science 201 is a prerequisite are not eligible to enroll in Computer Science 201.
Sophomore Priority section is available
- Fall 2025, Winter 2026, Spring 2026
- FSR, Formal or Statistical Reasoning QRE, Quantitative Reasoning
-
Student has completed any of the following course(s): CS 111 with a grade of C- or better or a score of 4 or better on the Computer Science A AP exam or received a Carleton Computer Science 111 Requisite Equivalency. Not open to students that have taken CS 200.
-
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, Winter 2026, Spring 2026
- 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 208 Introduction to Computer Systems 6 credits
Are you curious what’s really going on when a computer runs your code? In this course we will demystify the machine and the tools that we use to program it. Our broad survey of how computer systems execute programs, store information, and communicate will focus on the hardware/software interface, including data representation, instruction set architecture, the C programming language, memory management, and the operating system process model.
- Fall 2025, Winter 2026, Spring 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): CS 200 or CS 201 with a grade of C- or better or received a Carleton Computer Science 201 or better Requisite Equivalency.
-
CS 220* Art, Interactivity, and Microcontrollers (*=Junior Seminar) 6 credits
In this hands-on course, taught (in an art studio) by a sculpture professor and computer science professor, we'll explore and create interactive three dimensional art. Using basic construction techniques, microprocessors, and programming, we bring together sculpture, engineering, computer science, and aesthetic design. Students engage the nuts and bolts of fabrication, learn to program microcontrollers, and study the design of interactive constructions. Additionally, students will deliver technical presentations describing their work and receive feedback for improvement. Collaborative labs and individual projects culminate in a campus-wide exhibition. No prior building experience is required.
ARTS 220* is cross listed with CS 220*.
Seats held for Art and Art History majors and CS Match.
Extra Time Required: Field trip to the Walker sculpture garden.
- Spring 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): CS 111 a grade of C- or better or a score of 4 or better on the Computer Science A AP exam or received a Carleton Computer Science 111 Requisite Equivalency. Not open to students who have taken CS 232 or CS 220.
-
CS 251 Programming Languages: Design and Implementation 6 credits
What makes a programming language like “Python” or like “Java”? This course will look past superficial properties (like indentation) and into the soul of programming languages. We will explore a variety of topics in programming language construction and design: syntax and semantics, mechanisms for parameter passing, typing, scoping, and control structures. Students will expand their programming experience to include other programming paradigms, including functional languages like Scheme and ML.
- Fall 2025, Winter 2026, Spring 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): CS 200 or CS 201 with a grade of C- or better or received a Carleton Computer Science 201 or better Requisite Equivalency.
-
CS 252 Algorithms 6 credits
A course on techniques used in the design and analysis of efficient algorithms. We will cover several major algorithmic design paradigms (greedy algorithms, dynamic programming, divide and conquer, and network flow). Along the way, we will explore the application of these techniques to a variety of domains (natural language processing, economics, computational biology, and data mining, for example). As time permits, we will include supplementary topics like randomized algorithms, advanced data structures, and amortized analysis.
- Fall 2025, Winter 2026, Spring 2026
- 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 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, Winter 2026, Spring 2026
- 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 257 Software Design 6 credits
It’s easy to write a mediocre computer program, and lots of people do it. Good programs are quite a bit harder to write, and are correspondingly less common. In this course, we will study techniques, tools, and habits that will improve your chances of writing good software. While working on several medium-sized programming projects, we will investigate code construction techniques, debugging and profiling tools, testing methodologies, UML, principles of object-oriented design, design patterns, and user interface design.
- Fall 2025, Winter 2026, Spring 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): CS 200 or CS 201 with a grade of C- or better or received a Carleton Computer Science 201 or better Requisite Equivalency.
-
CS 301 History of Computing in England Program: History of Computing 6 credits
In the mid-1800s, Charles Babbage’s analytical engine, inspired by programmable looms, was the first conception of an automated programmable computing device. A century later, British researchers built some of the first physical computers—particularly WWII-era code-breaking work, and programmable machines developed immediately after the war. We will explore those two eras, through historical writings (including Babbage and Ada Lovelace, who wrote programs for the analytical engine, and Alan Turing) and visits to relevant museums and archives. We will also study some of the more recent history of computing, particularly the major advances in the 1960s and 1970s.
Participation in OCS History of Computing in England program.
- Fall 2025
- FSR, Formal or Statistical Reasoning
-
Acceptance in the Carleton OCS History of Computing in England program.
-
CS 302* The Why Behind Everyday Technologies (*=Junior Seminar) 6 credits
What makes computers computers? Are computers defined by their existing functionalities, future capabilities, individual components, or something else? Are there inherent risks to the technologies we surround ourselves with, and are there ways we can mitigate those risks to live happier lives? How do we arrive at a ‘true’ interpretation of data, and does its presentation and visualization matter?
By peering into the black-box of everyday technologies alongside the philosophical discussions they engender, we will investigate the fundamental questions computing technologies and its mind-bending pace of advancement are posing in our lives, communities, and society. Technical communication is emphasized through student-led discussions, project pages for written and visual communication, and presentations.
16 seats held for CS Match until the day after X priority registration.
- Winter 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): CS 200 or CS 201 with a grade of C- or better or received a Carleton Computer Science 201 or better Requisite Equivalency.
-
CS 314* Data Visualization (*=Junior Seminar) 6 credits
Though the wealth of data surrounding us can be overwhelming, we have evolved incredible tools for finding patterns in large amounts of information: our eyes! Data visualization is concerned with turning information into pictures to better communicate patterns or discover new insights, drawing from computer graphics, human-computer interaction, design, and perceptual psychology. In this junior seminar, we will learn different ways in which data can be expressed visually and which methods work best for which tasks, with a particular focus on technical communication. Using this knowledge, we will critique existing visualizations as well as design and build new ones.
- Spring 2026
- FSR, Formal or Statistical Reasoning QRE, Quantitative Reasoning
-
Student has completed any of the following course(s): CS 200 or CS 201 with a grade of C- or better or received a Carleton Computer Science 201 or better Requisite Equivalency. Not open to students who have taken CS 314.
-
CS 320 Machine Learning 6 credits
What does it mean for a machine to learn? Much of modern machine learning focuses on identifying patterns in large datasets and using these patterns to make predictions about the future. Machine learning has impacted a diverse array of applications and fields, from scientific discovery to healthcare to education. In this artificial intelligence-related course, we’ll both explore a variety of machine learning algorithms in different application areas, taking both theoretical and practical perspectives, and discuss impacts and ethical implications of machine learning more broadly. Topics may vary, but typically focus on regression and classification algorithms, including neural networks.
X seats held for CS Match until the day after X priority registration.
- Winter 2026
- 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 327* Introduction to Robotics (*=Junior Seminar) 6 credits
Have you ever wondered how a robotic vacuum is able to navigate back to its charger after cleaning? In this course we will explore concepts of robotic systems including: kinematics, sensors and perception, path planning, and control. In addition to learning the theory behind these topics, students will have the opportunity to design, program, and deploy behaviors for a mobile robot. This course emphasizes technical communication, including both writing and speaking components.
- Spring 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): CS 200 or CS 201 with a grade of C- or better or received a Carleton Computer Science 201 or better Requisite Equivalency AND MATH 134 or MATH 232 with a grade of C- or better or received a Carleton Math 232 Requisite Equivalency AND CS 202 (MATH 236 will be accepted in lieu of CS 202) with a grade of C- or better or received a Carleton Computer Science 202 Requisite Equivalency.
-
CS 331* Computer Networks (*=Junior Seminar) 6 credits
The Internet is composed of a large number of heterogeneous, independently-operating computer networks that work together to transport data all over the world. The fact that it does this so well given its complexity is a minor miracle. We’ll study the structure of these individual networks, of smaller-scale local networks, and of the Internet, and learn how this “magic” takes place. Topics include protocols, routing, security, network architecture, and performance measurement along with economic, ethical, and privacy issues. Students will develop technical communication skills in writing and oral presentations through several network analysis projects.
- Fall 2025
- FSR, Formal or Statistical Reasoning QRE, Quantitative Reasoning
-
Student has completed any of the following course(s): CS 200 or CS 201 with a grade of C- or better or received a Carleton Computer Science 201 or better Requisite Equivalency. Not open to students who have previously taken CS 331.
-
CS 334 Database Systems 6 credits
Database systems are used in almost every aspect of computing, including managing data for websites and apps, but also large-scale data science archives. Why, and how? This course takes a multi-pronged approach. From a systems perspective, we will look at the low-level details of how a database system works internally, studying data storage, indexing, and query optimization. From a theory perspective, we will examine ideas such as normal forms and relational algebra. From a utilization perspective, we will look at how query languages such as SQL interface with the database system, and understand how SQL queries really work.
- Spring 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): CS 200 or CS 201 with a grade of C- or better or received a Carleton Computer Science 201 or better Requisite Equivalency.
-
CS 338 Computer Security 6 credits
When hackers can disable gas pipelines, national hospital systems, and electrical grids, and data brokers can create a largely unregulated world-wide surveillance system, there’s a clear need for people who understand the mechanisms of computer security and insecurity. Towards that end, in this course we will study technical and social aspects of computer and network security. Topics will include threat modeling, cryptography, secure network protocols, web security, ethical hacking and penetration testing, authentication, authorization, historical hacking incidents, usability, privacy, and security-related law.
- Fall 2025
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): CS 200 or CS 201 with a grade of C- or better or received a Carleton Computer Science 201 or better Requisite Equivalency.
-
CS 341 History of Computing in England Program: Cryptography 6 credits
Modern cryptographic systems allow parties to communicate in a secure way, even if they don’t trust the channels over which they are communicating (or maybe even each other). Cryptography is at the heart of a huge range of applications: online banking and shopping, password-protected computer accounts, and secure wireless networks, to name just a few. In this course, we will introduce and explore some fundamental cryptographic primitives. Topics will include public-key encryption, digital signatures, code-breaking techniques (like those used at Bletchley Park during WWII to break the Enigma machine’s cryptosystem), pseudorandom number generation, and other cryptographic applications.
Participation in OCS History of Computing in England program.
- Fall 2025
- FSR, Formal or Statistical Reasoning QRE, Quantitative Reasoning
-
Acceptance in the Carleton OCS History of Computing in England program.
-
CS 344 Human-Computer Interaction 6 credits
The field of human-computer interaction addresses two fundamental questions: how do people interact with technology, and how can technology enhance the human experience? In this course, we will explore technology through the lens of the end user: how can we design effective, aesthetically pleasing technology, particularly user interfaces, to satisfy user needs and improve the human condition? How do people react to technology and learn to use technology? What are the social, societal, health, and ethical implications of technology? The course will focus on design methodologies, techniques, and processes for developing, testing, and deploying user interfaces.
- Winter 2026
- FSR, Formal or Statistical Reasoning QRE, Quantitative Reasoning
-
Student has completed any of the following course(s): CS 200 or CS 201 with a grade of C- or better or received a Carleton Computer Science 201 or better Requisite Equivalency.
-
CS 362 Computational Biology 6 credits
Recent advances in high-throughput experimental techniques have revolutionized how biologists measure DNA, RNA and protein. The size and complexity of the resulting datasets have led to a new era where computational methods are essential to answering important biological questions. This course focuses on the process of transforming biological problems into well formed computational questions and the algorithms to solve them. Topics include approaches to sequence comparison and alignment; molecular evolution and phylogenetics; DNA/RNA sequencing and assembly; and specific disease applications including cancer genomics.
- Spring 2026
- 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.
-
LING 110 Introduction to Linguistics 6 credits
The capacity to acquire and use natural languages such as English is surely one of the more remarkable features of human nature. In this course, we explore several aspects of this ability. Topics include the sound systems of natural languages, the structure of words, principles that regulate word order, the course of language acquisition in children, and what these reveal about the nature of the mind.
Sophomore Priority section is available
- Winter 2026, Spring 2026
- FSR, Formal or Statistical Reasoning
-
LING 115 Introduction to the Theory of Syntax 6 credits
This course is organized to enable the student to actively participate in the construction of a rather elaborate theory of the nature of human cognitive capacity to acquire and use natural languages. In particular, we concentrate on one aspect of that capacity: the unconscious acquisition of a grammar that enables a speaker of a language to produce and recognize sentences that have not been previously encountered. In the first part of the course, we concentrate on gathering notation and terminology intended to allow an explicit and manageable description. In the second part, we depend on written and oral student contributions in a cooperative enterprise of theory construction.
Sophomore Priority section is available
- Fall 2025, Winter 2026, Spring 2026
- FSR, Formal or Statistical Reasoning
-
LING 216 Generative Approaches to Syntax 6 credits
This course has two primary goals: to provide participants with a forum to continue to develop their analytical skills (i.e., to ‘do syntax’), and to acquaint them with generative syntactic theory, especially the Principles and Parameters approach. Participants will sharpen their technological acumen, through weekly problem solving, and engage in independent thinking and analysis, by means of formally proposing novel syntactic analyses for linguistic phenomena. By the conclusion of the course, participants will be prepared to read and critically evaluate primary literature couched within this theoretical framework.
- Winter 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed and of the following course(s): LING 115 with grade of C- or better.
-
LING 217 Phonetics and Phonology 6 credits
Although no two utterances are ever exactly the same, we humans don’t function like tape recorders; we overlook distinctions to which mechanical recording devices are sensitive, and we “hear” contrasts which are objectively not there. What we (think we) hear is determined by the sound system of the language we speak. This course examines the sound systems of human languages, focusing on how speech sounds are produced and perceived, and how these units come to be organized into a systematic network in the minds of speakers of languages.
- Fall 2025
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): One 100-level LING course with grade of C- or better.
-
LING 340 Topics in Semantics 6 credits
Semantics is the study of what words and constructions mean in a language and how speakers come to actually interpret those meanings. In this course we explore several objects of inquiry within the field of semantics, including compositional semantics (i.e., the computation of meaning over syntactic structures), lexical semantics (with a particular emphasis on verb meanings), and how the various interpretations of ambiguous constructions are derived.
- Spring 2026
- FSR, Formal or Statistical Reasoning
-
MATH 101 Calculus with Problem Solving 6 credits
An introduction to the central ideas of calculus with review and practice of those skills needed for the continued study of calculus. Problem solving strategies will be emphasized. In addition to regular MWF class time, students will be expected to attend two problem-solving sessions each week, one on Monday or Tuesday, and one on Wednesday or Thursday. Details will be provided on the first day of class.
Extra time for TTH labs. Not open to students who have received credit for MATH 111
- Fall 2025, Winter 2026
- FSR, Formal or Statistical Reasoning
-
Student has received a score of 101 on the Carleton Math Placement exam. Not open to students who have received credit for Mathematics 111. For more information, see the Mathematics' web page.
-
MATH 111 Introduction to Calculus 6 credits
An introduction to the differential and integral calculus. Derivatives, antiderivatives, the definite integral, applications, and the fundamental theorem of calculus.
Not open to students who have received credit for MATH 101
- Fall 2025, Winter 2026
- FSR, Formal or Statistical Reasoning
-
Student has received a score of 111 on the Carleton Math Placement exam. Not open to students who have received credit for Mathematics 101 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 Calculus IB exam or received a Carleton Math 111 or better Requisite Equivalency. For more information, see the Mathematics' web page.
-
MATH 120 Calculus 2 6 credits
Inverse functions, integration by parts, improper integrals, modeling with differential equations, vectors, calculus of functions of two independent variables including directional derivatives and double integrals, Lagrange multipliers.
Not open to students who have received credit for MATH 211 or have a score of 4 or 5 on the AP Calculus BC exam.
- Fall 2025, Winter 2026, Spring 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): MATH 101 or MATH 111 with a grade of C- or better or received a scored of 4 or better on AP Calculus AB test or received a scored of 5 or better on Calculus IB test or received a Carleton Math 111 Requisite Equivalency or placement exam. Not open to students who received a scored of 4 or better on the AP Calculus BC test or completed MATH 211 with a grade of C- or better.
-
MATH 134 Linear Algebra with Applications 6 credits
Linear algebra centers on the geometry, algebra, and applications of linear equations. It is pivotal to many areas of mathematics, natural sciences, computer science, and engineering. To study linear equations, we will develop concepts including matrix algebra, linear independence, determinants, eigenvectors, and orthogonality. Students will use these tools to model real world problems and solve these problems using computational software.
This course is not open to students who have received credit for MATH 232.
- Fall 2025, Winter 2026, Spring 2026
- FSR, Formal or Statistical Reasoning
-
Not open to students who have taken MATH 232 or equivalents.
-
MATH 210 Calculus 3 6 credits
Vectors, curves, calculus of functions of three independent variables, including directional derivatives and triple integrals, cylindrical and spherical coordinates, line integrals, Green's theorem, sequences and series, power series, Taylor series. This course cannot be substituted for MATH 211.
This course cannot be substituted for MATH 211
- Winter 2026, Spring 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): MATH 120 with a grade of C- or better. Students who have received a score of 4 or greater on the AP Calculus BC exam should register for MATH 211.
-
MATH 211 Introduction to Multivariable Calculus 6 credits
Vectors, curves, partial derivatives, gradient, multiple and iterated integrals, line integrals, Green’s theorem.
- Fall 2025, Winter 2026
- FSR, Formal or Statistical Reasoning
-
Student has received a score of 4 or better on the AP Calculus BC exam or received a score of 211 on the Carleton Math Placement exam or received a Carleton Math 121 Requisite Equivalency.
-
MATH 232 Linear Algebra 6 credits
Linear algebra centers on the study of highly structured functions called linear transformations. Given the abundance of nonlinear functions in mathematics, it may come as a surprise that restricting to linear ones opens the door to a rich and powerful theory that finds applications throughout mathematics, statistics, computer science, and the natural and social sciences. Linear transformations are everywhere, once we know what to look for. They appear in calculus as the functions that are used to define lines and planes in Euclidean space. In fact, differentiation is also a linear transformation that takes one function to another. The course focuses on developing geometric intuition as well as computational matrix methods. Topics include kernel and image of a linear transformation, vector spaces, determinants, eigenvectors and eigenvalues.
This course is not open to students who have received credit for MATH 134.
- Fall 2025, Winter 2026, Spring 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): MATH 120 or MATH 211 with a grade of C- or better or received a Carleton Math 211 Requisite Equivalency.
-
MATH 236 Mathematical Structures 6 credits
Basic concepts and techniques used throughout mathematics. Topics include logic, mathematical induction and other methods of proof, problem solving, sets, cardinality, equivalence relations, functions and relations, and the axiom of choice. Other topics may include: algebraic structures, graph theory, and basic combinatorics.
Sophomore Priority section is available
- Fall 2025, Winter 2026, Spring 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): MATH 134 or MATH 232 AND MATH 210 or MATH 211 with a grade of C- or better or equivalent.
-
MATH 240 Probability 6 credits
Introduction to probability and its applications. Topics include discrete probability, random variables, independence, joint and conditional distributions, expectation, limit laws and properties of common probability distributions.
- Fall 2025, Winter 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): MATH 120 or MATH 211 or greater with a grade of C- or better or received a Carleton MATH 211 or better Requisite Equivalency or equivalent.
-
MATH 241 Ordinary Differential Equations 6 credits
Ordinary differential equations are a fundamental language used by mathematicians, scientists, and engineers to describe processes involving continuous change. In this course we develop ordinary differential equations as models of real world phenomena and explore the mathematical ideas that arise within these models. Topics include separation of variables; phase portraits; equilibria and their stability; non-dimensionalization; bifurcation analysis; and modeling of physical, biological, chemical, and social processes.
- Fall 2025, Winter 2026, Spring 2026
- FSR, Formal or Statistical Reasoning
-
Student must have completed any of the following course(s): MATH 134 or MATH 232 AND MATH 120 or MATH 211 with a grade of C- or better or equivalents.
-
MATH 244 Geometries 6 credits
Euclidean geometry from an advanced perspective; projective, hyperbolic, inversive, and/or other geometries. Recommended for prospective secondary school teachers.
- Winter 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): MATH 236 with a grade of C- or better.
-
MATH 271 Optimization 6 credits
Optimization is all about selecting the "best" thing. Finding the most likely strategy to win a game, the route that gets you there the fastest, or the curve that most closely fits given data are all examples of optimization problems. In this course we study linear optimization (also known as linear programming), the simplex method, and duality from both a theoretical and a computational perspective. Applications will be selected from statistics, economics, computer science, and more. Additional topics in nonlinear and convex optimization will be covered as time permits.
- Spring 2026
- FSR, Formal or Statistical Reasoning
-
Student must have completed any of the following course(s): MATH 134 or MATH 232 AND MATH 120 or MATH 211 with a grade of C- or better or equivalents.
-
MATH 282 Number Theory 6 credits
A first course in number theory, covering properties of the integers. Topics include the Euclidean algorithm, prime factorization, Diophantine equations, congruences, divisibility, Euler’s phi function and other multiplicative functions, primitive roots, and quadratic reciprocity. Along the way we will encounter and explore several famous unsolved problems in number theory. If time permits, we may discuss further topics, including integers as sums of squares, continued fractions, distribution of primes, Mersenne primes, the RSA cryptosystem.
- Winter 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): MATH 236 with a grade of C- or better or received a Carleton Math 236 Requisite Equivalency exam.
-
MATH 295 Tessellation 6 credits
This course explores a particularly visual sort of mathematical pattern: a tessellation. A tessellation is a way of covering the plane with shapes (called “tiles”) that don’t overlap. This class will explore questions like: Is it possible to make a tessellation out of a given set of tiles? How many different tessellations can I create from this set of tiles? We’ll cover both classical results (it is impossible to tile the plane with heptagons!), and the 2023 construction of the “Einstein tile”: the first known polygon that tiles the plane but never periodically. Links will be made with graph theory, topology, and geometry.
Repeatable: This course is repeatable provided the topics are different.
Sophomore Priority
- Spring 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): MATH 236 with a grade of C- or better or received a Carleton Math 236 Requisite Equivalency exam.
-
MATH 321 Real Analysis I 6 credits
A systematic study of single-variable functions on the real numbers. This course develops the mathematical concepts and tools needed to understand why calculus really works: the topology of the real numbers, limits, differentiation, integration, convergence of sequences, and series of functions.
- Fall 2025, Spring 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): MATH 236 AND MATH 210 or MATH 211 with a grade of C- or better or equivalents.
-
MATH 332 Advanced Linear Algebra 6 credits
Selected topics beyond the material of Mathematics 232. Topics may include the Cayley-Hamilton theorem, the spectral theorem, factorizations, canonical forms, determinant functions, estimation of eigenvalues, inner product spaces, dual vector spaces, unitary and Hermitian matrices, operators, infinite-dimensional spaces, and various applications.
- Fall 2025
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): MATH 236 with a grade of C- or better.
-
MATH 341 Partial Differential Equations 6 credits
An introduction to partial differential equations with emphasis on the heat equation, wave equation, and Laplace’s equation. Topics include the method of characteristics, separation of variables, Fourier series, Fourier transforms and existence/uniqueness of solutions.
- Spring 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): MATH 241 with grade of C- or better.
-
MATH 342 Abstract Algebra I 6 credits
Introduction to algebraic structures, including groups, rings, and fields. Homomorphisms and quotient structures, polynomials, unique factorization. Other topics may include applications such as Burnside’s counting theorem, symmetry groups, polynomial equations, or geometric constructions.
- Winter 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): MATH 236 with a grade of C- or better or received a Carleton Math 236 Requisite Equivalency exam.
-
MATH 352 Galois Theory 6 credits
In the nineteenth century, Évariste Galois discovered a deep connection between field theory and group theory. Now known as Galois theory, this led to the resolution of several centuries-old problems, including whether there is a version of the quadratic formula for higher-degree polynomials, and whether the circle can be squared. Today Galois theory is a fundamental concept for many mathematical fields, from topology to algebra to number theory. This course develops the theory in a modern framework, and explores several applications. Topics include field extensions, classical constructions, splitting fields, the Galois correspondence, Galois groups of polynomials, and solvability by radicals.
This course can be repeated only by students who took MATH 352 22-23
- Spring 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): MATH 342 with grade of C- or better.
-
MATH 354 Topology 6 credits
An introduction to the study of topological spaces. We develop concepts from point-set and algebraic topology in order to distinguish between different topological spaces up to homeomorphism. Topics include methods of construction of topological spaces; continuity, connectedness, compactness, Hausdorff condition; fundamental group, homotopy of maps.
- Winter 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): MATH 236 with a grade of C- or better or received a Carleton Math 236 Requisite Equivalency exam.
-
MATH 361 Complex Analysis 6 credits
The theoretical foundations for the calculus of functions of a complex variable.
- Winter 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): MATH 321 with a grade of C- or better.
-
MATH 362 Representation Theory of Finite Groups 6 credits
Representation theory is the study of mathematical structures via the tools of linear algebra. The first objects to be studied in this way were finite groups at the end of the nineteenth century, motivated by the powerful framework of characters in number theory, but the field has generalized incredibly due to the prevalence of symmetry throughout mathematics, physics, and beyond. In this course the focus is on finite groups. Topics include Maschke’s theorem, complete reducibility, and Schur’s lemma; characters, orthogonality relations, and character tables; Fourier transformations and random walks. Additional topics may include Burnside’s Lemma, Frobenius reciprocity, and an exploration of representations of infinite groups.
- Spring 2026
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): MATH 342 with grade of C- or better.
-
PHIL 210 Logic 6 credits
The study of formal logic has obvious and direct applicability to a wide variety of disciplines (including mathematics, computer science, linguistics, philosophy, cognitive science, and many others). Indeed, the study of formal logic helps us to develop the tools and know-how to think more clearly about arguments and logical relationships in general; and arguments and logical relationships form the backbone of any rational inquiry. In this course we will focus on propositional logic and predicate logic, and look at the relationship that these have to ordinary language and thought.
- Winter 2026
- FSR, Formal or Statistical Reasoning
-
PSYC 200 Measurement and Data Analysis in Psychology 6 credits
The course considers the role of measurement and data analysis focused on behavioral sciences. Various forms of measurement and standards for the evaluation of measures are explored. Students learn how to summarize, organize, and evaluate data using a variety of techniques that are applicable to research in psychology and other disciplines. Among the analyses discussed and applied are tests of means, various forms of analysis of variance, correlation and regression, planned and post-hoc comparisons, as well as various non-parametric tests. Research design is also explored.
- Fall 2025, Winter 2026, Spring 2026
- FSR, Formal or Statistical Reasoning QRE, Quantitative Reasoning
-
Student has completed any of the following course(s): PSYC 110 or received a score of 4 or better on the Psychology AP exam or received a score of 6 or better on the Psychology IB exam OR CGSC/PSYC 232 and CGSC/PSYC 233 with a grade of C- or better.
- PSYC 201: Measurement and Data Analysis Lab
-
STAT 120 Introduction to Statistics 6 credits
Introduction to statistics and data analysis. Practical aspects of statistics will be emphasized, including extensive use of programming in the statistical software R, interpretation and communication of results. Topics include: exploratory data analysis, correlation and linear regression, design of experiments, the normal distribution, randomization approach to inference, sampling distributions, estimation, and hypothesis testing. Students who have taken Mathematics 211 are encouraged to consider the more advanced Mathematics 240/Statistics 250 Probability/Statistical Inference sequence.
Not open to students who have already received credit for Psychology 200/201, Sociology/Anthropology 239 or Statistics 250
- Fall 2025, Winter 2026, Spring 2026
- FSR, Formal or Statistical Reasoning QRE, Quantitative Reasoning
-
Not open to students that have taken PSYC 200 , PSYC 201, SOAN 239 or STAT 250.
-
STAT 220 Introduction to Data Science 6 credits
This course will cover the computational side of data analysis, including data acquisition, management, and visualization tools. Topics may include: data scraping, data wrangling, data visualization using packages such as ggplots, interactive graphics using tools such as Shiny, an introduction to classification methods, and understanding and visualizing spatial data. We will use the statistics software R in this course.
- Fall 2025, Winter 2026, Spring 2026
- FSR, Formal or Statistical Reasoning QRE, Quantitative Reasoning
-
Student has completed any of the following course(s): STAT 120 or STAT 230, or STAT 250 with a grade of C- or better.
-
STAT 230 Applied Regression Analysis 6 credits
A second course in statistics covering simple linear regression, multiple regression and ANOVA, and logistic regression. Exploratory graphical methods, model building and model checking techniques will be emphasized with extensive use of statistical software R to analyze real-life data.
Sophomore Priority section is available
- Fall 2025, Winter 2026, Spring 2026
- FSR, Formal or Statistical Reasoning QRE, Quantitative Reasoning
-
Student has completed any of the following course(s): STAT 120 or STAT 250 or PSYC 200 or SOAN 239 with a grade of C- or better or received a score of 4 or better on the Statistics AP exam.
-
STAT 250 Introduction to Statistical Inference 6 credits
Introduction to modern mathematical statistics. The mathematics underlying fundamental statistical concepts will be covered as well as applications of these ideas to real-life data. Topics include: resampling methods (permutation tests, bootstrap intervals), classical methods (parametric hypothesis tests and confidence intervals), parameter estimation, goodness-of-fit tests, regression, and Bayesian methods. The statistical package R will be used to analyze data sets.
- Winter 2026, Spring 2026
- FSR, Formal or Statistical Reasoning QRE, Quantitative Reasoning
-
Student has completed any of the following course(s): MATH 240 with a grade of C- or better.
-
STAT 260 Introduction to Sampling Techniques 6 credits
Covers sampling design issues beyond the basic simple random sample: stratification, clustering, domains, and complex designs like two-phase and multistage designs. Inference and estimation techniques for most of these designs will be covered and the idea of sampling weights for a survey will be introduced. We may also cover topics like graphing complex survey data and exploring relationships in complex survey data using regression and chi-square tests.
- Winter 2026
- FSR, Formal or Statistical Reasoning QRE, Quantitative Reasoning
-
Student has completed any of the following course(s): STAT 120 or STAT 230, or STAT 250 with a grade of C- or better.
-
STAT 285 Statistical Consulting 2 credits
Students will apply their statistical knowledge by analyzing data problems solicited from the Northfield community. Students will also learn basic consulting skills, including communication and ethics.
All interested students are encouraged to add to the waitlist and the instructor will reach out after registration. This course is repeatable, but if the instructor cannot admit every student on the waitlist, priority will be given first to Statistics majors who have not previously taken the course and then to other students who have not taken the course.
- Fall 2025, Winter 2026, Spring 2026
- FSR, Formal or Statistical Reasoning QRE, Quantitative Reasoning
-
Student has completed the following course(s): STAT 230 with a grade of C- or better.
-
STAT 330 Advanced Statistical Modeling 6 credits
Topics include linear mixed effects models for repeated measures, longitudinal or hierarchical data and generalized linear models (of which logistic and Poisson regression are special cases) including zero-inflated Poisson models. Depending on time, additional topics could include survival analysis or generalized additive models.
- Spring 2026
- FSR, Formal or Statistical Reasoning QRE, Quantitative Reasoning
-
Student has completed any of the following course(s): STAT 230 AND STAT 250 with a grade of C- or better AND has completed or is in the process of completing MATH 134 or MATH 232 with a grade of C- or better or received a Carleton Math 232 Requisite Equivalency.
-
STAT 340 Bayesian Statistics 6 credits
The Bayesian approach to statistics provides a powerful framework for incorporating prior knowledge into statistical analyses, updating this knowledge with data, and quantifying uncertainty in results. This course serves as a comprehensive introduction to Bayesian statistical inference and modeling, an alternative to the frequentist approach to statistics covered in previous classes. Topics include: Bayes’ Theorem; prior and posterior distributions; Bayesian regression; hierarchical models; and model adequacy and posterior predictive checks. Computational techniques will also be covered, including Markov Chain Monte Carlo methods, and modern Bayesian modeling packages in R.
- Fall 2025
- FSR, Formal or Statistical Reasoning QRE, Quantitative Reasoning
-
Student has completed any of the following course(s): STAT 230 and STAT 250 with a grade of C- or better.