ENROLL Course Search

Saved Courses (0)

Your search for courses for 21/WI and with Curricular Exploration: FSR found 49 courses.

Revise Your Search New Search

BIOL 244.00 Biostatistics 3 credits

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

Location To Be Announced

MTWTHF
1:45pm3:30pm
Synonym: 58484

Mark McKone

An introduction to statistical techniques commonly used in Biology. The course will use examples from primary literature to examine the different ways that biological data are organized and analyzed. Emphasis will be placed on how to choose the appropriate statistical techniques in different circumstances and how to use statistical software to carry out tests. Topics covered include variable types (categorical, parametric, and non-parametric), analysis of variance, generalized linear models, and meta-analysis. There will be an opportunity for students to analyze data from their own research experiences.

Prerequisite: Biology 125 and 126 and one Biology 200 or 300 level course

CS 111.01 Introduction to Computer Science 6 credits

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

Location To Be Announced

MTWTHF
10:00am11:10am10:00am11:10am9:50am10:50am
Synonym: 58540

Layla K Oesper

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

CS 111.02 Introduction to Computer Science 6 credits

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

Location To Be Announced

MTWTHF
11:30am12:40pm11:30am12:40pm11:10am12:10pm
Synonym: 58541

Sneha Narayan

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

CS 111.03 Introduction to Computer Science 6 credits

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

Location To Be Announced

MTWTHF
7:00pm8:10pm7:00pm8:10pm7:00pm8:00pm
Synonym: 58542

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.

CS 111.04 Introduction to Computer Science 6 credits

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

Location To Be Announced

MTWTHF
2:30pm3:40pm2:30pm3:40pm3:10pm4:10pm
Synonym: 59563

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 201.01 Data Structures 6 credits

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

Location To Be Announced

MTWTHF
2:30pm3:40pm2:30pm3:40pm3:10pm4:10pm
Synonym: 58545

Anya E Vostinar

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

CS 201.02 Data Structures 6 credits

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

Location To Be Announced

MTWTHF
1:00pm2:10pm1:00pm2:10pm1:50pm2:50pm
Synonym: 58546

Aaron W Bauer

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

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

Location To Be Announced

MTWTHF
10:00am11:10am10:00am11:10am9:50am10:50am
Synonym: 58563

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

Location To Be Announced

MTWTHF
11:30am12:40pm11:30am12:40pm11:10am12:10pm
Synonym: 58564

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

Location To Be Announced

MTWTHF
1:00pm2:10pm1:00pm2:10pm1:50pm2:50pm
Synonym: 58548

Layla K Oesper

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

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

Location To Be Announced

MTWTHF
11:30am12:40pm11:30am12:40pm11:10am12:10pm
Synonym: 58549

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

Location To Be Announced

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

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

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

Location To Be Announced

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

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 314.00 Data Visualization 6 credits

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

Location To Be Announced

MTWTHF
2:30pm3:40pm2:30pm3:40pm3:10pm4:10pm
Synonym: 58565

Eric C Alexander

Understanding the wealth of data that surrounds us can be challenging. Luckily, we have evolved incredible tools for finding patterns in large amounts of information: our eyes! Data visualization is concerned with taking information and turning it into pictures to better communicate patterns or discover new insights. It combines aspects of computer graphics, human-computer interaction, design, and perceptual psychology. In this course, we will learn the different ways in which data can be expressed visually and which methods work best for which tasks. Using this knowledge, we will critique existing visualizations as well as design and build new ones.

Prerequisite: Computer Science 201

CS 348.00 Parallel and Distributed Computing 6 credits

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

Location To Be Announced

MTWTHF
10:00am11:10am10:00am11:10am9:50am10:50am
Synonym: 58566

David R Musicant

As multi-core machines become more prevalent, different programming paradigms have emerged for harnessing extra processors for better performance. This course explores parallel computation (programs that run on more than one core) as well as the related problem of distributed computation (programs that run on more than one machine). In particular, we will explore the two major paradigms for parallel programming, shared-memory multi-threading and message-passing, and the advantages and disadvantages of each. Other possible topics include synchronization mechanisms, debugging concurrent programs, fork/join parallelism, the theory of parallelism and concurrency, parallel algorithms, cloud computing, and Map/Reduce.

Prerequisite: Computer Science 201

CS 348.01 Parallel and Distributed Computing 0 credits

Closed: Size: 1, Registered: 1, Waitlist: 0

Location To Be Announced

MTWTHF
10:00am11:10am10:00am11:10am9:50am10:50am
Synonym: 59860

David R Musicant

As multi-core machines become more prevalent, different programming paradigms have emerged for harnessing extra processors for better performance. This course explores parallel computation (programs that run on more than one core) as well as the related problem of distributed computation (programs that run on more than one machine). In particular, we will explore the two major paradigms for parallel programming, shared-memory multi-threading and message-passing, and the advantages and disadvantages of each. Other possible topics include synchronization mechanisms, debugging concurrent programs, fork/join parallelism, the theory of parallelism and concurrency, parallel algorithms, cloud computing, and Map/Reduce.

Prerequisite: Computer Science 201

CS 361.00 Evolutionary Computing and Artificial Life 6 credits

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

Location To Be Announced

MTWTHF
1:00pm2:10pm1:00pm2:10pm1:50pm2:50pm

Other Tags:

Synonym: 58567

Anya E Vostinar

An introduction to evolutionary computation and artificial life, with a special emphasis on the two way flow of ideas between evolutionary biology and computer science. Topics will include the basic principles of biological evolution, experimental evolution techniques, and the application of evolutionary computation principles to solve real problems. All students will be expected to complete and present a term project exploring an open question in evolutionary computation.

Prerequisite: Computer Science 201

LING 115.00 Introduction to the Theory of Syntax 6 credits

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

Location To Be Announced

MTWTHF
1:00pm2:10pm1:00pm2:10pm1:50pm2:50pm
Synonym: 59081

Mike J Flynn

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 216.00 Generative Approaches to Syntax 6 credits

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

Location To Be Announced

MTWTHF
2:30pm3:40pm2:30pm3:40pm3:10pm4:10pm
Synonym: 59082

Catherine R Fortin

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.

Prerequisite: Linguistics 115

LING 317.00 Topics in Phonology 6 credits

Closed: Size: 15, Registered: 16, Waitlist: 0

Location To Be Announced

MTWTHF
10:20am12:05pm10:20am12:05pm
Synonym: 59088

Jenna T Conklin

More on phonology. This course examines a small number of topics in depth. Particular topics vary from year to year.

Prerequisite: Linguistics 217

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

Closed: Size: 1, Registered: 1, Waitlist: 0

Location To Be Announced

MTWTHF
1:45pm2:45pm
Synonym: 59819

MATH 111.01 Introduction to Calculus 6 credits

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

Location To Be Announced

MTWTHF
2:30pm3:40pm2:30pm3:40pm3:10pm4:10pm
Synonym: 58652

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

Location To Be Announced

MTWTHF
10:00am11:10am10:00am11:10am9:50am10:50am
Synonym: 58653

Rafe F Jones

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, score of 5, 6, or 7 on Math IB 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 ex

MATH 120.02 Calculus 2 6 credits

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

Location To Be Announced

MTWTHF
11:30am12:40pm11:30am12:40pm11:10am12:10pm
Synonym: 58654

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, score of 5, 6, or 7 on Math IB 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 ex

MATH 120.03 Calculus 2 6 credits

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

Location To Be Announced

MTWTHF
1:00pm2:10pm1:00pm2:10pm1:50pm2:50pm
Synonym: 58655

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, score of 5, 6, or 7 on Math IB 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 ex

MATH 210.01 Calculus 3 6 credits

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

Location To Be Announced

MTWTHF
11:30am12:40pm11:30am12:40pm11:10am12:10pm
Synonym: 58658

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 211.00 Introduction to Multivariable Calculus 6 credits

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

Location To Be Announced

MTWTHF
1:00pm2:10pm1:00pm2:10pm1:50pm2:50pm
Synonym: 58660

Owen D Biesel

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

Prerequisite: Mathematics 121, 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

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

Location To Be Announced

MTWTHF
10:00am11:10am10:00am11:10am9:50am10:50am
Synonym: 58661

Caroline L Turnage-Butterbaugh

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

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

Location To Be Announced

MTWTHF
2:30pm3:40pm2:30pm3:40pm3:10pm4:10pm
Synonym: 58662

Caroline L Turnage-Butterbaugh

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

Prerequisite: Mathematics 120 or Mathematics 211

MATH 236.00 Mathematical Structures 6 credits

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

Location To Be Announced

MTWTHF
10:00am11:10am10:00am11:10am9:50am10:50am
Synonym: 58663

MurphyKate Montee

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.WL0 (Synonym 58680)

MATH 240.00 Probability 6 credits

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

Location To Be Announced

MTWTHF
11:30am12:40pm11:30am12:40pm11:10am12:10pm
Synonym: 58681

Josh R Davis

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

Location To Be Announced

MTWTHF
11:30am12:40pm11:30am12:40pm11:10am12:10pm
Synonym: 59751

Alexander Garver

(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

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

Location To Be Announced

MTWTHF
1:00pm2:10pm1:00pm2:10pm1:50pm2:50pm
Synonym: 58664

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

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

Location To Be Announced

MTWTHF
7:00pm8:10pm7:00pm8:10pm7:00pm8:00pm

Other Tags:

Synonym: 58665

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 295.00 Combinatorial Games 6 credits

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

Hulings 310

MTWTHF
10:20am12:05pm10:20am12:05pm
Synonym: 58683

Eric S Egge

An introduction to the theory and practice of combinatorial games, which are two-player games in which players take turns, both players have complete information about the state of the game at all times, and there is no chance involved. Topics may include impartial games, a complete solution to nim, nim's relationship with other impartial games, the correspondence between games and numbers, sums of games, birthdays of games, hot games, and thermographs of games. Specific games will be studied as examples of the general theory, possibly including hackenbush, domineering, amazons, chomp, the octal games, and variations of these games. 

Prerequisite: Mathematics 236 or instructor permission

MATH 312.00 Elementary Theory of Numbers 6 credits

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

Location To Be Announced

MTWTHF
1:00pm2:10pm1:00pm2:10pm1:50pm2:50pm
Synonym: 59372

Alex J Barrios

Properties of the integers. Topics include the Euclidean algorithm, classical unsolved problems in number theory, prime factorization, Diophantine equations, congruences, divisibility, Euler's phi function and other multiplicative functions, primitive roots, and quadratic reciprocity. Other topics may include integers as sums of squares, continued fractions, distribution of primes, integers in extension fields, p-adic numbers.

Prerequisite: Mathematics 236 or instructor permission

MATH 321.00 Real Analysis I 6 credits

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

Location To Be Announced

MTWTHF
10:00am11:10am10:00am11:10am9:50am10:50am
Synonym: 58684

Kate J Meyer

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 352.00 Topics in Abstract Algebra 6 credits

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

Location To Be Announced

MTWTHF
2:30pm3:40pm2:30pm3:40pm3:10pm4:10pm
Synonym: 58685

Mark Krusemeyer

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

Prerequisite: Mathematics 342

PHIL 210.00 Logic 6 credits

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

Location To Be Announced

MTWTHF
11:30am12:40pm11:30am12:40pm11:10am12:10pm
Synonym: 59056

Douglas B Marshall

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.

PSYC 200.00 Measurement and Data Analysis in Psychology 6 credits

Closed: Size: 24, Registered: 24, Waitlist: 0

Location To Be Announced

MTWTHF
10:00am11:10am10:00am11:10am9:50am10:50am

Other Tags:

Synonym: 58334

Julie J Neiworth

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.

Prerequisite: Psychology 110 or instructor consent; Concurrent registration in Psychology 201

PSYC 201 required.

STAT 120.01 Introduction to Statistics 6 credits

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

Location To Be Announced

MTWTHF
11:30am12:40pm11:30am12:40pm11:10am12:10pm
Synonym: 57873

Samuel D Ihlenfeldt

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

Location To Be Announced

MTWTHF
1:00pm2:10pm1:00pm2:10pm1:50pm2:50pm
Synonym: 57874

Samuel D Ihlenfeldt

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

STAT 120.03 Introduction to Statistics 6 credits

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

Location To Be Announced

MTWTHF
10:00am11:10am10:00am11:10am9:50am10:50am
Synonym: 57875

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

Sophomore Priority

Waitlist for Juniors and Seniors: STAT 120.WL3 (Synonym 57878)

STAT 220.00 Introduction to Data Science 6 credits

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

Location To Be Announced

MTWTHF
10:00am11:10am10:00am11:10am9:50am10:50am
Synonym: 58603

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, clean up and manipulation, data visualization using packages such as ggplots, understanding and visualizing spatial and network data, and supervised and unsupervised classification methods. We will use the statistics software R in this course.

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

Formerly Mathematics 285

STAT 230.00 Applied Regression Analysis 6 credits

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

Location To Be Announced

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

Laura M Chihara

(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) or Statistics 250 (formerly Mathematics 275), Psychology 200, or AP Statistics Exam score of 4 or 5.

Formerly Mathematics 245

STAT 250.00 Introduction to Statistical Inference 6 credits

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

Location To Be Announced

MTWTHF
2:30pm3:40pm2:30pm3:40pm3:10pm4:10pm
Synonym: 58606

Andy N Poppick

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

Location To Be Announced

MTWTHF
10:20am12:10pm
Synonym: 59415

Katie R St. Clair

(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 285.02 Statistical Consulting 2 credits, S/CR/NC only

Closed: Size: 0, Registered: 7, Waitlist: 0

Location To Be Announced

MTWTHF
10:20am12:05pm
Synonym: 60000

Katie R St. Clair

(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 330.00 Advanced Statistical Modeling 6 credits

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

Location To Be Announced

MTWTHF
11:30am12:40pm11:30am12:40pm11:10am12:10pm
Synonym: 58611

Laura M Chihara

(Formerly MATH 345) 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, generalized additive models or models for spatial data.

Prerequisite: Statistics 230 and 250 (formerly Mathematics 245 and 275) or permission of the instructor

Formerly Mathematics 345

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