ENROLL Course Search

Saved Courses (0)

Your search for courses for 22/SP and with Curricular Exploration: FSR found 39 courses.

Revise Your Search New Search

CS 111.01 Introduction to Computer Science 6 credits

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

Olin 310

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

James O Ryan

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 111.02 Introduction to Computer Science 6 credits

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

Olin 310

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

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 60515)

CS 111.03 Introduction to Computer Science 6 credits

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

Olin 310

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

Anna N Rafferty

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.WL3 (Synonym 60514)

CS 201.01 Data Structures 6 credits

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

Anderson Hall 329

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

Eric C Alexander

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.WL1 (Synonym 60518)

CS 201.02 Data Structures 6 credits

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

Leighton 305

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

Anna N Rafferty

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 202.00 Mathematics of Computer Science 6 credits

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

Anderson Hall 121

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

Layla K Oesper

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 208.00 Introduction to Computer Systems 6 credits

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

Leighton 402

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

Aaron W Bauer

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.

Prerequisite: Computer Science 201 or instructor permission

CS 251.00 Programming Languages: Design and Implementation 6 credits

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

Anderson Hall 329

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

David R Musicant

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: 31, Waitlist: 0

CMC 301

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

David Liben-Nowell

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: 35, Waitlist: 0

Anderson Hall 329

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

James O Ryan

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: 32, Waitlist: 0

Olin 310

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

Anya E Vostinar

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 338.00 Computer Security 6 credits

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

Olin 310

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

Jeffrey R Ondich

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.

Prerequisite: Computer Science 201

CS 344.00 Human-Computer Interaction 6 credits

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

Weitz Center 235

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

Eric C Alexander

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.

Prerequisite: Computer Science 201 or instructor permission

CS 352.00 Advanced Algorithms 6 credits

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

Leighton 304

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

David Liben-Nowell

A second course on designing and analyzing efficient algorithms to solve computational problems. We will survey some algorithmic design techniques that apply broadly throughout computer science, including discussion of wide-ranging applications. A sampling of potential topics: approximation algorithms (can we efficiently compute near-optimal solutions even when finding exact solutions is computationally intractable?); randomized algorithms (does flipping coins help in designing faster/simpler algorithms?); online algorithms (how do we analyze an algorithm that needs to make decisions before the entire input arrives?); advanced data structures; complexity theory. As time and interest permit, we will mix recently published algorithmic papers with classical results.

Prerequisite: Computer Science 252 or instructor permission

LING 110.00 Introduction to Linguistics 6 credits

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

Hulings 316

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

Catherine R Fortin

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

Waitlist for Juniors and Seniors: LING 110.WL0 (Synonym 62166)

LING 115.00 Introduction to the Theory of Syntax 6 credits

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

Weitz Center 235

MTWTHF
3:10pm4:55pm3:10pm4:55pm
Synonym: 62167

Catherine R Fortin

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

Waitlist for Juniors and Seniors: LING 115.WL0 (Synonym 62168)

LING 316.00 Topics in Morphology 6 credits

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

Laird 007

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

Morgan Rood

This course explores how languages form words and how contemporary theories account for this complicated process. We concentrate primarily on the interaction between morphology and syntax, but we may also explore the relationship between morphology and phonology. While we will investigate a wide variety of languages, no familiarity with any language other than English is required.

Prerequisite: Linguistics 216

MATH 120.00 Calculus 2 6 credits

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

CMC 206

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

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 210.01 Calculus 3 6 credits

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

CMC 206

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

Alex J Barrios

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.

Prerequisite: Mathematics 120. This course cannot be substituted for Mathematics 211

MATH 232.01 Linear Algebra 6 credits

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

CMC 210

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

Rafe F Jones

Vector spaces, linear transformations, determinants, inner products and orthogonality, eigenvectors and eigenvalues.

Prerequisite: Mathematics 120 or Mathematics 211

MATH 232.02 Linear Algebra 6 credits

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

CMC 210

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

Rafe F Jones

Vector spaces, linear transformations, determinants, inner products and orthogonality, eigenvectors and eigenvalues.

Prerequisite: Mathematics 120 or Mathematics 211

MATH 236.01 Mathematical Structures 6 credits

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

CMC 209

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

Claudio Gómez-Gonzáles

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

Sophomore Priority

Waitlist for Juniors and Seniors: MATH 236.WL1 (Synonym 61642)

MATH 236.02 Mathematical Structures 6 credits

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

CMC 209

MTWTHF
1:15pm3:00pm1:15pm3:00pm
Synonym: 63942

Owen D Biesel

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 241.00 Ordinary Differential Equations 6 credits

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

CMC 210

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

Rob C Thompson

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 244.00 Geometries 6 credits

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

CMC 206

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

MurphyKate Montee

Euclidean geometry from an advanced perspective; projective, hyperbolic, inversive, and/or other geometries. Recommended for prospective secondary school teachers.

Prerequisite: Mathematics 236

MATH 295.00 Mathematics of Climate 6 credits

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

CMC 206

MTWTHF
1:15pm3:00pm1:15pm3:00pm

Other Tags:

Synonym: 61271

Kate J Meyer

An introduction to mathematical methods for studying planetary climate. The focus will be on low-dimensional models, whose simplicity allows insight into fundamental mechanisms of climate change. We will use tools from algebra, geometry, and calculus to study topics including energy balance, greenhouse gas forcing, and ice-albedo feedback. This course will count towards the Applied Math area of the math major.

Prerequisite: Mathematics 120 or 211

Sophomore Priority

Waitlist for Juniors and Seniors: MATH 295.WL0 (Synonym 61657)

MATH 321.00 Real Analysis I 6 credits

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

CMC 209

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

Alex J Barrios

A systematic study of concepts basic to calculus, such as topology of the real numbers, limits, differentiation, integration, convergence of sequences, and series of functions.

Prerequisite: Mathematics 236 or instructor permission

MATH 341.00 Partial Differential Equations 6 credits

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

CMC 210

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

Rob C Thompson

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.

Prerequisite: Mathematics 241

MATH 352.00 Topics in Abstract Algebra 6 credits

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

CMC 319

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

Mark Krusemeyer

An intensive study of one or more of the types of algebraic systems studied in Mathematics 342.

Prerequisite: Mathematics 342

This course can be repeated

MATH 361.00 Complex Analysis 6 credits

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

CMC 206

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

Owen D Biesel

The theoretical foundations for the calculus of functions of a complex variable.

Prerequisite: Mathematics 321 or instructor permission. Students who have already received credit for Mathematics 261 may only take this course with instructor permission

STAT 120.01 Introduction to Statistics 6 credits

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

CMC 102

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

Katie R St. Clair

(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).

Sophomore priority

Waitlist for Juniors and Seniors: STAT 120.WL1 (Synonym 61578)

STAT 120.02 Introduction to Statistics 6 credits

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

CMC 301

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

Laura M Chihara

(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).

Sophomore priority

Waitlist for Juniors and Seniors: STAT 120.WL2 (Synonym 61579)

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: 61542

Steve T Scheirer

(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.04 Introduction to Statistics 6 credits

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

CMC 102

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

Deepak Bastola

(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: 25, Waitlist: 0

CMC 102

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

Katie R St. Clair

(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

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

CMC 102

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

Deepak Bastola

(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.

Sophomore priority

Waitlist for Juniors and Seniors: STAT 230.WL0 (Synonym 61580)

STAT 250.00 Introduction to Statistical Inference 6 credits

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

CMC 206

MTWTHF
12:30pm1:40pm12:30pm1:40pm1:10pm2:20pm
Synonym: 61553

Laura M Chihara

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

Prerequisite: Mathematics 240 Probability (formerly Mathematics 265)

Formerly Mathematics 275

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

Closed: Size: 0, Registered: 11, Waitlist: 0

CMC 201

MTWTHF
10:10am11:55am
Synonym: 61451

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 320.00 Time Series Analysis 6 credits

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

CMC 319

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

Andy N Poppick

(Formerly MATH 315) Models and methods for characterizing dependence in data that are ordered in time. Emphasis on univariate, quantitative data observed over evenly spaced intervals. Topics include perspectives from both the time domain (e.g., autoregressive and moving average models, and their extensions) and the frequency domain (e.g., periodogram smoothing and parametric models for the spectral density).

Prerequisite: Statistics 230 and 250 (formerly Mathematics 245 and 275). Exposure to matrix algebra may be helpful but is not required

Formerly 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