Spring 2026 Course Search

Computing and Data in Practice — CS4392.01

Instructor: Michael Corey
Days & Time: Tu 8:30AM-10:20AM
Credits: 2

For students doing work-study or internships, we will focus on three core areas of professionalization. First, each week will journal our work weeks, discussing and sharing our work experiences in a round-table. Second, we will build our professionalization skills, especially networking (in person and on LinkedIn), resume writing, and doing practice interviews. Finally, we will work on writing 5-year plans, to help us figure out where we’d like to be a few years after graduation. More specifically

Analyzing Blockchain/Web3 as an open distributed database — CS4391.01

Instructor: Michael Corey
Days & Time: TH 3:40pm-5:30pm
Credits: 2

Following up on the fall course on web3, this course helps students learn to track transactions and actions across blockchains, which are large distributed censorship resistant databases. The course starts by exploring the fundamental nature of the blockchain: how data is stored, accessed, and traversed. It then introduces common patterns and software used for blockchain analytics.

Artificial Intelligence — CS4105.01

Instructor: Darcy Otto
Days & Time: TU,FR 2:10pm-4:00pm
Credits: 4

How can we create machines that think, learn, and solve problems? This course explores the fascinating field of artificial intelligence (AI), introducing the fundamental concepts, techniques, and ethical considerations that drive this rapidly evolving discipline.

Building upon your programming knowledge, you will explore key AI paradigms including search algorithms, evolutionary algorithms, swarm intelligence, and machine learning.  You will implement AI solutions to real-world problems, and gain an understanding of how to think about contemporary AI development.

Metric Spaces and Geometry — MAT4162.01

Instructor: Andrew McIntyre
Days & Time: TU,FR 8:30am-10:20am
Credits: 4

Everything is geometry! This class is about two things: first, about how mathematicians have extended the concept of "geometry" beyond triangles and circles, into higher-dimensional spaces, curved spaces, spaces of functions, discrete spaces, and more. Second, about how this extension of "geometry" can allow us to apply our powerful geometric intuition to a wide range of problems that might not initially seem geometric, both within mathematics, and in physics, computer science, and elsewhere.

Discrete Mathematics — MAT4107.01

Instructor: Katie Montovan
Days & Time: MO,TH 10:00am-11:50am
Credits: 4

Discrete mathematics studies problems that can be broken up into distinct pieces. Some examples of these sorts of systems are letters or numbers in a password, pixels on a computer screen, the connections between friends on Facebook, and driving directions (along established roads) between two cities. In this course we will develop the tools needed to solve relevant, real-world problems. Topics will include: combinatorics (clever ways of counting things), number theory and graph theory. Possible applications include probability, social networks, optimization, and cryptography.

Physics II: Electricity and Magnetism (with Lab) — PHY4327.01

Instructor: Tim Schroeder
Days & Time: M/Th 10:00AM-11:50AM, W 8:30AM-12:10PM (Lab)
Credits: 5

How does influence travel from one thing to another? In Newton’s mechanics of particles and forces, influences travel instantaneously across arbitrarily far distances. Newton himself felt this to be incorrect, but he did not suggest a solution to this problem of “action at a distance.” To solve this problem, we need a richer ontology: The world is made not only of particles, but also of fields. As examples of the field concept, we study the theory and applications of the electric field and the magnetic field.

Introduction to Computer Science 2: Algorithms and Application — CS4384.01

Instructor: Darcy Otto
Days & Time: TU,FR 10:30am-12:20pm
Credits: 4

Introduction to Computer Science 2 continues the design-recipe approach started in Introduction to Computer Science 1. We extend our toolkit from structural recursion into generative recursion, abstraction, and algorithmic problem-solving. Students move beyond simple data definitions to work with more sophisticated structures (trees, graphs, sets, maps) while beginning to reason about program efficiency and resource use.

Advanced Observing Projects — PHY4326.01

Instructor: Hugh Crowl
Days & Time: MO 3:40pm-5:30pm
Credits: 2

Students will observe using the telescopes at Stickney Observatory for a series of astronomical observing projects. After a range of initial assigned projects designed to acquaint students with the capabilities of the observing equipment and astrophysically interesting observations, students will propose and carry out their own observing projects looking at astrophysical phenomena of interest to them. As this is a projects class, it is expected that students will be able to devote significant time (mostly at night) observing on their own or in small teams.