ENROLL Course Search

NOTE: There are some inconsistencies in the course listing data - ITS is looking into the cause.

Alternatives: For requirement lists, please refer to the current catalog. For up-to-the-minute enrollment information, use the "Search for Classes" option in The Hub. If you have any other questions, please email registrar@carleton.edu.

Saved Courses (0)

Your search for courses for 22/FA and with Curricular Exploration: FSR found 45 courses.

Revise Your Search New Search

CS 111.01 Introduction to Computer Science 6 credits

Open: Size: 34, Registered: 31, Waitlist: 0

Olin 310

MTWTHF
1:50pm3:00pm1:50pm3:00pm2:20pm3:20pm
Synonym: 64250

David R Musicant

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. Students who have received credit for Computer Science 201 or above are not eligible to enroll in Computer Science 111.

Waitlist for Juniors and Seniors: CS 111.WL1 (Synonym 64252)

CS 111.02 Introduction to Computer Science 6 credits

Open: Size: 34, Registered: 30, Waitlist: 0

Olin 310

MTWTHF
11:10am12:20pm11:10am12:20pm12:00pm1:00pm
Synonym: 64249

David R Musicant

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. Students who have received credit for Computer Science 201 or above are not eligible to enroll in Computer Science 111.

Sophomore priority

Waitlist for Juniors and Seniors: CS 111.WL2 (Synonym 64253)

CS 111.03 Introduction to Computer Science 6 credits

Open: Size: 34, Registered: 27, Waitlist: 0

Olin 310

MTWTHF
12:30pm1:40pm12:30pm1:40pm1:10pm2:10pm
Synonym: 64251

Anya E Vostinar

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. Students who have received credit for Computer Science 201 or above are not eligible to enroll in Computer Science 111.

CS 201.01 Data Structures 6 credits

Open: Size: 34, Registered: 23, Waitlist: 0

Anderson Hall 329

MTWTHF
1:50pm3:00pm1:50pm3:00pm2:20pm3:20pm
Synonym: 64254

Richard Wells

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.

Prerequisite: Computer Science 111 or instructor permission

CS 201.02 Data Structures 6 credits

Open: Size: 34, Registered: 21, Waitlist: 0

Leighton 305

MTWTHF
11:10am12:20pm11:10am12:20pm12:00pm1:00pm
Synonym: 64255

Richard Wells

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.

Prerequisite: Computer Science 111 or instructor permission

Sophomore Priority

Waitlist for Juniors and Seniors: CS 201.WL2 (Synonym 64256)

CS 202.00 Mathematics of Computer Science 6 credits

Closed: Size: 34, Registered: 29, Waitlist: 0

Anderson Hall 036

MTWTHF
1:50pm3:00pm1:50pm3:00pm2:20pm3:20pm
Synonym: 64257

Eric C Alexander

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.

Prerequisite: Computer Science 111 and Mathematics 111 or instructor permission

CS 251.00 Programming Languages: Design and Implementation 6 credits

Open: Size: 34, Registered: 30, Waitlist: 0

Anderson Hall 036

MTWTHF
8:30am9:40am8:30am9:40am8:30am9:30am
Synonym: 64258

Anna N Rafferty

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.

Prerequisite: Computer Science 201 or instructor permission

CS 252.00 Algorithms 6 credits

Open: Size: 34, Registered: 28, Waitlist: 0

Leighton 304

MTWTHF
11:10am12:20pm11:10am12:20pm12:00pm1:00pm
Synonym: 64259

Jeffrey R Ondich

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.

Prerequisite: Computer Science 201 and Computer Science 202 (Mathematics 236 will be accepted in lieu of Computer Science 202)

CS 254.00 Computability and Complexity 6 credits

Closed: Size: 34, Registered: 29, Waitlist: 0

Leighton 305

MTWTHF
9:50am11:00am9:50am11:00am9:40am10:40am
Synonym: 64271

Josh R Davis

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.

Prerequisite: Computer Science 201 and Computer Science 202 (Mathematics 236 will be accepted in lieu of Computer Science 202)

CS 257.00 Software Design 6 credits

Closed: Size: 34, Registered: 36, Waitlist: 0

Olin 310

MTWTHF
8:30am9:40am8:30am9:40am8:30am9:30am
Synonym: 64260

Jeffrey R Ondich

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.

Prerequisite: Computer Science 201 or instructor permission

CS 311.00 Computer Graphics 6 credits

Closed: Size: 34, Registered: 29, Waitlist: 0

CMC 301

MTWTHF
1:50pm3:00pm1:50pm3:00pm2:20pm3:20pm
Synonym: 64272

Josh R Davis

Scientific simulations, movies, and video games often incorporate computer-generated images of fictitious worlds. How are these worlds represented inside a computer? How are they “photographed” to produce the images that we see? What performance constraints and design trade-offs come into play? In this course we learn the basic theory and methodology of three-dimensional computer graphics, including both triangle rasterization and ray tracing. Familiarity with vectors, matrices, and the C programming language is recommended but not required.

Prerequisite: Computer Science 201

CS 361.00 Artificial Life and Digital Evolution 6 credits

Open: Size: 34, Registered: 28, Waitlist: 0

Olin 310

MTWTHF
9:50am11:00am9:50am11:00am9:40am10:40am

Other Tags:

Synonym: 64273

Anya E Vostinar

The field of artificial life seeks to understand the dynamics of life by separating them from the substrate of DNA. In this course, we will explore how we can implement the dynamics of life in software to test and generate biological hypotheses, with a particular focus on evolution. Topics will include the basic principles of biological evolution, transferring experimental evolution techniques to computational systems, cellular automata, computational modeling, and digital evolution. All students will be expected to complete and present a term research project recreating and extending recent work in the field of artificial life.

Prerequisite: Computer Science 201

ENTS 232.00 Research Methods in Environmental Studies 3 credits

Open: Size: 25, Registered: 21, Waitlist: 0

Willis 204

MTWTHF
1:15pm3:00pm
Synonym: 64743

Mark T Kanazawa

This course covers various methodologies that are used to prosecute interdisciplinary academic research relating to the environment. Among the topics covered are: identification of a research question, methods of analysis, hypothesis testing, and effective rhetorical methods, both oral and written.

LING 115.00 Introduction to the Theory of Syntax 6 credits

Closed: Size: 20, Registered: 19, Waitlist: 0

Willis 204

MTWTHF
11:10am12:20pm11:10am12:20pm12:00pm1:00pm
Synonym: 64570

Morgan Rood

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.

LING 217.00 Phonetics and Phonology 6 credits

Open: Size: 25, Registered: 13, Waitlist: 0

CMC 210

MTWTHF
10:10am11:55am10:10am11:55am
Synonym: 64571

Jenna T Conklin

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.

Prerequisite: 100-level Linguistics course

LING 315.00 Topics in Syntax 6 credits

Open: Size: 25, Registered: 6, Waitlist: 0

Willis 203

MTWTHF
9:50am11:00am9:50am11:00am9:40am10:40am
Synonym: 64572

Morgan Rood

More on syntax. Particular topics vary by year and student interest.

Prerequisite: Linguistics 216

LING 399.00 Senior Thesis 3 credits, S/CR/NC only

Open: Size: 25, Registered: 8, Waitlist: 0

Synonym: 64573

MATH 101.00 Calculus with Problem Solving 6 credits

Open: Size: 30, Registered: 20, Waitlist: 0

CMC 209

MTWTHF
9:50am11:00am9:50am11:00am9:40am10:40am
Synonym: 64880

Deanna B Haunsperger

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.

Prerequisite: Not open to students who have received credit for Mathematics 111.

Extra Time Required, Tuesday and Thursday TA group meetings required

MATH 111.01 Introduction to Calculus 6 credits

Closed: Size: 30, Registered: 31, Waitlist: 0

CMC 306

MTWTHF
11:10am12:20pm11:10am12:20pm12:00pm1:00pm
Synonym: 64881

McCleary A Philbin

An introduction to the differential and integral calculus. Derivatives, antiderivatives, the definite integral, applications, and the fundamental theorem of calculus.

Prerequisite: Requires placement via the Calculus Placement Exam 1, see Mathematics web page. Not open to students who have received credit for Mathematics 101.

MATH 111.02 Introduction to Calculus 6 credits

Open: Size: 30, Registered: 29, Waitlist: 0

CMC 306

MTWTHF
12:30pm1:40pm12:30pm1:40pm1:10pm2:10pm
Synonym: 64882

McCleary A Philbin

An introduction to the differential and integral calculus. Derivatives, antiderivatives, the definite integral, applications, and the fundamental theorem of calculus.

Prerequisite: Requires placement via the Calculus Placement Exam 1, see Mathematics web page. Not open to students who have received credit for Mathematics 101.

MATH 111.03 Introduction to Calculus 6 credits

Closed: Size: 30, Registered: 27, Waitlist: 0

CMC 206

MTWTHF
1:50pm3:00pm1:50pm3:00pm2:20pm3:20pm
Synonym: 64883

Kate J Meyer

An introduction to the differential and integral calculus. Derivatives, antiderivatives, the definite integral, applications, and the fundamental theorem of calculus.

Prerequisite: Requires placement via the Calculus Placement Exam 1, see Mathematics web page. Not open to students who have received credit for Mathematics 101.

MATH 120.01 Calculus 2 6 credits

Open: Size: 30, Registered: 28, Waitlist: 0

CMC 206

MTWTHF
8:30am9:40am8:30am9:40am8:30am9:30am
Synonym: 64884

MurphyKate Montee

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.

Prerequisite: Mathematics 101, 111, score of 4 or 5 on Calculus AB Exam or placement via a Carleton placement exam. Not open to students who have received credit for Mathematics 211 or have a score of 4 or 5 on the AP Calculus BC exam

MATH 120.02 Calculus 2 6 credits

Open: Size: 30, Registered: 17, Waitlist: 0

CMC 301

MTWTHF
11:10am12:20pm11:10am12:20pm12:00pm1:00pm
Synonym: 64885

Sunrose T Shrestha

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.

Prerequisite: Mathematics 101, 111, score of 4 or 5 on Calculus AB Exam or placement via a Carleton placement exam. Not open to students who have received credit for Mathematics 211 or have a score of 4 or 5 on the AP Calculus BC exam

MATH 120.03 Calculus 2 6 credits

Open: Size: 30, Registered: 12, Waitlist: 0

CMC 301

MTWTHF
12:30pm1:40pm12:30pm1:40pm1:10pm2:10pm
Synonym: 64886

Sunrose T Shrestha

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.

Prerequisite: Mathematics 101, 111, score of 4 or 5 on Calculus AB Exam or placement via a Carleton placement exam. Not open to students who have received credit for Mathematics 211 or have a score of 4 or 5 on the AP Calculus BC exam

MATH 120.04 Calculus 2 6 credits

Open: Size: 30, Registered: 29, Waitlist: 0

CMC 210

MTWTHF
1:50pm3:00pm1:50pm3:00pm2:20pm3:20pm
Synonym: 64887

Steve T Scheirer

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.

Prerequisite: Mathematics 101, 111, score of 4 or 5 on Calculus AB Exam or placement via a Carleton placement exam. Not open to students who have received credit for Mathematics 211 or have a score of 4 or 5 on the AP Calculus BC exam

MATH 211.01 Introduction to Multivariable Calculus 6 credits

Open: Size: 30, Registered: 16, Waitlist: 0

CMC 210

MTWTHF
11:10am12:20pm11:10am12:20pm12:00pm1:00pm
Synonym: 64888

Joseph D Johnson

Vectors, curves, partial derivatives, gradient, multiple and iterated integrals, line integrals, Green's theorem.

Prerequisite: Score of 4 or 5 on the AP Calculus BC exam, or placement via Calculus Placement Exam #3

MATH 211.02 Introduction to Multivariable Calculus 6 credits

Open: Size: 30, Registered: 8, Waitlist: 0

CMC 210

MTWTHF
12:30pm1:40pm12:30pm1:40pm1:10pm2:10pm
Synonym: 64889

Joseph D Johnson

Vectors, curves, partial derivatives, gradient, multiple and iterated integrals, line integrals, Green's theorem.

Prerequisite: Score of 4 or 5 on the AP Calculus BC exam, or placement via Calculus Placement Exam #3

MATH 211.03 Introduction to Multivariable Calculus 6 credits

Open: Size: 30, Registered: 20, Waitlist: 0

CMC 206

MTWTHF
3:10pm4:20pm3:10pm4:20pm3:30pm4:30pm
Synonym: 64890

Rob C Thompson

Vectors, curves, partial derivatives, gradient, multiple and iterated integrals, line integrals, Green's theorem.

Prerequisite: Score of 4 or 5 on the AP Calculus BC exam, or placement via Calculus Placement Exam #3

MATH 232.01 Linear Algebra 6 credits

Open: Size: 30, Registered: 26, Waitlist: 0

CMC 210

MTWTHF
9:50am11:00am9:50am11:00am9:40am10:40am
Synonym: 64891

Caroline L Turnage-Butterbaugh

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. 

Prerequisite: Mathematics 120 or Mathematics 211

MATH 232.02 Linear Algebra 6 credits

Open: Size: 30, Registered: 23, Waitlist: 0

CMC 206

MTWTHF
11:10am12:20pm11:10am12:20pm12:00pm1:00pm
Synonym: 64892

Steve T Scheirer

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. 

Prerequisite: Mathematics 120 or Mathematics 211

MATH 236.00 Mathematical Structures 6 credits

Closed: Size: 25, Registered: 25, Waitlist: 0

CMC 206

MTWTHF
12:30pm1:40pm12:30pm1:40pm1:10pm2:10pm
Synonym: 64893

Deanna B Haunsperger

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.

Prerequisite: Mathematics 232 and either Mathematics 210 or Mathematics 211

MATH 240.01 Probability 6 credits

Open: Size: 30, Registered: 20, Waitlist: 0

CMC 301

MTWTHF
8:30am9:40am8:30am9:40am8:30am9:30am
Synonym: 64894

Katie R St. Clair

(Formerly Mathematics 265) 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.

Prerequisite: Mathematics 120 or Mathematics 211

Formerly Mathematics 265

MATH 240.02 Probability 6 credits

Open: Size: 30, Registered: 29, Waitlist: 0

CMC 301

MTWTHF
9:50am11:00am9:50am11:00am9:40am10:40am
Synonym: 64895

Katie R St. Clair

(Formerly Mathematics 265) 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.

Prerequisite: Mathematics 120 or Mathematics 211

Formerly Mathematics 265

MATH 241.00 Ordinary Differential Equations 6 credits

Open: Size: 30, Registered: 20, Waitlist: 0

CMC 209

MTWTHF
11:10am12:20pm11:10am12:20pm12:00pm1:00pm
Synonym: 64905

Kate J Meyer

An introduction to ordinary differential equations, including techniques for finding solutions, conditions under which solutions exist, and some qualitative analysis.

Prerequisite: Mathematics 232 or instructor permission

MATH 282.00 Elementary Theory of Numbers 6 credits

Open: Size: 25, Registered: 21, Waitlist: 0

CMC 209

MTWTHF
1:50pm3:00pm1:50pm3:00pm2:20pm3:20pm
Synonym: 63033

Caroline L Turnage-Butterbaugh

A first course in number 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.

Prerequisite: Mathematics 236 or instructor permission

Formerly Math 312

MATH 342.00 Abstract Algebra I 6 credits

Open: Size: 23, Registered: 20, Waitlist: 0

CMC 319

MTWTHF
9:50am11:00am9:50am11:00am9:40am10:40am
Synonym: 64906

Claudio Gómez-Gonzáles

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.

Prerequisite: Mathematics 236 or instructor permission

MATH 344.00 Differential Geometry 6 credits

Open: Size: 25, Registered: 9, Waitlist: 0

CMC 209

MTWTHF
12:30pm1:40pm12:30pm1:40pm1:10pm2:10pm
Synonym: 64907

Rob C Thompson

Local and global theory of curves, Frenet formulas. Local theory of surfaces, normal curvature, geodesics, Gaussian and mean curvatures, Theorema Egregium.

Prerequisite: Mathematics 236 or permission of the instructor.

MATH 395.00 Geometric Group Theory 6 credits

Open: Size: 15, Registered: 7, Waitlist: 0

CMC 319

MTWTHF
11:10am12:20pm11:10am12:20pm12:00pm1:00pm

Other Tags:

Synonym: 63896

MurphyKate Montee

Geometric group theory is the study of (infinite) groups using geometric tools. The underlying principle of geometric group theory is that if a group G acts "nicely" on a space, then information about that space tells us information about the group. This class will introduce tools from topology, graph theory, and geometry and use them to study groups. Topics will include groups acting on trees and (more generally) hyperbolic groups. This course counts toward the Algebra area of the math major.

Prerequisite: Mathematics 342 or instructor consent

STAT 120.01 Introduction to Statistics 6 credits

Closed: Size: 32, Registered: 31, Waitlist: 0

CMC 206

MTWTHF
9:50am11:00am9:50am11:00am9:40am10:40am
Synonym: 65243

Andy N Poppick

(Formerly MATH 215) Introduction to statistics and data analysis. Practical aspects of statistics, including extensive use of statistical software, interpretation and communication of results, will be emphasized. Topics include: exploratory data analysis, correlation and linear regression, design of experiments, basic probability, the normal distribution, randomization approach to inference, sampling distributions, estimation, hypothesis testing, and two-way tables. Students who have taken Mathematics 211 are encouraged to consider the more advanced Mathematics 240/Statistics 250 (formerly Mathematics 265 and 275) Probability/Statistical Inference sequence.

Prerequisite: Not open to students who have already received credit for Psychology 200/201, Sociology/Anthropology 239 or Statistics 250 (formerly Mathematics 275).

Formerly Mathematics 215

STAT 120.02 Introduction to Statistics 6 credits

Closed: Size: 32, Registered: 32, Waitlist: 0

CMC 102

MTWTHF
12:30pm1:40pm12:30pm1:40pm1:10pm2:10pm
Synonym: 65244

Claire E Kelling

(Formerly MATH 215) Introduction to statistics and data analysis. Practical aspects of statistics, including extensive use of statistical software, interpretation and communication of results, will be emphasized. Topics include: exploratory data analysis, correlation and linear regression, design of experiments, basic probability, the normal distribution, randomization approach to inference, sampling distributions, estimation, hypothesis testing, and two-way tables. Students who have taken Mathematics 211 are encouraged to consider the more advanced Mathematics 240/Statistics 250 (formerly Mathematics 265 and 275) Probability/Statistical Inference sequence.

Prerequisite: Not open to students who have already received credit for Psychology 200/201, Sociology/Anthropology 239 or Statistics 250 (formerly Mathematics 275).

Formerly Mathematics 215

STAT 120.03 Introduction to Statistics 6 credits

Closed: Size: 32, Registered: 30, Waitlist: 0

CMC 102

MTWTHF
1:50pm3:00pm1:50pm3:00pm2:20pm3:20pm
Synonym: 65245

Claire E Kelling

(Formerly MATH 215) Introduction to statistics and data analysis. Practical aspects of statistics, including extensive use of statistical software, interpretation and communication of results, will be emphasized. Topics include: exploratory data analysis, correlation and linear regression, design of experiments, basic probability, the normal distribution, randomization approach to inference, sampling distributions, estimation, hypothesis testing, and two-way tables. Students who have taken Mathematics 211 are encouraged to consider the more advanced Mathematics 240/Statistics 250 (formerly Mathematics 265 and 275) Probability/Statistical Inference sequence.

Prerequisite: Not open to students who have already received credit for Psychology 200/201, Sociology/Anthropology 239 or Statistics 250 (formerly Mathematics 275).

Formerly Mathematics 215

STAT 220.00 Introduction to Data Science 6 credits

Open: Size: 30, Registered: 16, Waitlist: 0

CMC 102

MTWTHF
11:10am12:20pm11:10am12:20pm12:00pm1:00pm
Synonym: 65246

Deepak Bastola

(Formerly Mathematics 285) 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, supervised and unsupervised classification methods, and understanding and visualizing spatial data. We will use the statistics software R in this course.

Prerequisite: Statistics 120 (formerly Mathematics 215), Statistics 230 (formerly Mathematics 245) or Statistics 250 (formerly Mathematics 275)

Formerly Mathematics 285

STAT 230.00 Applied Regression Analysis 6 credits

Open: Size: 28, Registered: 25, Waitlist: 0

CMC 102

MTWTHF
9:50am11:00am9:50am11:00am9:40am10:40am
Synonym: 65247

Adam Loy

(Formerly Mathematics 245) 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 to analyze real-life data.

Prerequisite: Statistics 120 (formerly Mathematics 215), Statistics 250 (formerly Mathematics 275), Psychology 200, or AP Statistics Exam score of 4 or 5.

Formerly Mathematics 245

STAT 285.00 Statistical Consulting 2 credits, S/CR/NC only

Closed: Size: 0, Registered: 12, Waitlist: 0

CMC 304

MTWTHF
10:10am11:55am
Synonym: 65248

Andy N Poppick

(Formerly MATH 280) 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.

Prerequisite: Statistics 230 (formerly Mathematics 245) and instructor permission

Formerly Mathematics 280

STAT 340.00 Bayesian Statistics 6 credits

Open: Size: 20, Registered: 18, Waitlist: 0

CMC 319

MTWTHF
1:50pm3:00pm1:50pm3:00pm2:20pm3:20pm
Synonym: 65250

Adam Loy

Formerly MATH 315) An introduction to statistical inference and modeling in the Bayesian paradigm. Topics include Bayes’ Theorem, common prior and posterior distributions, hierarchical models, Markov chain Monte Carlo methods (e.g., the Metropolis-Hastings algorithm and Gibbs sampler) and model adequacy and posterior predictive checks. The course uses R extensively for simulations.

Prerequisite: Statistics 250 (formerly Mathematics 275)

Fomerly Mathematics 315

Search for Courses

This data updates hourly. For up-to-the-minute enrollment information, use the Search for Classes option in The Hub

Instructional Mode
Class Period
Courses or labs meeting at non-standard times may not appear when searching by class period.
Requirements
You must take 6 credits of each of these.
Overlays
You must take 6 credits of each of these,
except Quantitative Reasoning, which requires 3 courses.
Special Interests