Spring 2026 Course Search

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.

CDP: Senior Thesis Workshop — DAN4803B.01, section 1

Instructor: Jesse Zaritt
Days & Time: W 10:00AM-2:00PM
Credits: 4

This course is designed to be the culmination of the BFA program for all dance majors. Each student will propose a thesis project, develop goals and objectives for the semester, and present their work. Modes of practicing, situating and expressing thesis project research will be mobilized and extended through ongoing critical dialogue. We will attend to, in practice, the urgent questions facing our lives and the field of dance and performance. 

CDP: Senior Thesis Workshop — DAN4803B.02, section 2

Instructor: Faculty TBA
Days & Time: W, 10:00AM-2:00PM
Credits: 4

This course is designed to be the culmination of the BFA program for all dance majors. Each student will propose a thesis project, develop goals and objectives for the semester, and present their work. Modes of practicing, situating and expressing thesis project research will be mobilized and extended through ongoing critical dialogue. We will attend to, in practice, the urgent questions facing our lives and the field of dance and performance. 

Reading as a Collective Act: Thinking Through Dance and Performance — DAN4819B.01

Instructor: Donna Faye Burchfield
Days & Time: M 1:40PM-3:30PM, W 10:00AM-11:50AM
Credits: 4

This course aims to experiment with generative and alternative forms of reading that can be thought of as not only a methodology, but as a practice that supports us as we engage in research with, alongside and through study in dance and performance. We will ask ourselves what it means to read and “make sense” of texts and events today…together. 
*For BFA students this course satisfies Critical Studies credit.
 

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.