This course provides an introduction to the fundamental concepts of Ballet. Emphasis is placed on improving anatomical awareness and alignment, increasing strength and flexibility and developing artistic sensitivity. This class will cover basic ballet positions, steps, leading to classical and contemporary variations. By the end of the class, students will be able to demonstrate the movement skills necessary to understand and execute beginning level ballet footwork and movement sequences with accuracy.

Not available at this time

Not available at this time

Not available at this time

In this course, we will engage in the studio practice of intermediate ballet technique. Grounded in anatomically sound alignment, the class borrows from a number of styles in order to explore various technical challenges. It is designed for dancers of all movement forms who have developed their ballet practice to an intermediate level. Through our practice we will increase the strength, flexibility and range of each student's ballet dancing.

A continuation of DANCE 120. Also taught at Mount Holyoke and Smith.

Not available at this time

Lecture, discussion. Basic concepts of discrete mathematics useful to computer science: set theory, strings and formal languages, propositional and predicate calculus, relations and functions, basic number theory. Induction and recursion: interplay of inductive definition, inductive proof, and recursive algorithms. Graphs, trees, and search. Finite-state machines, regular languages, nondeterministic finite automata, Kleene's Theorem. Problem sets, 2 midterm exams, timed final.

This course introduces and develops methods for designing and implementing abstract data types using the Java programming language. The main focus is on how to build and encapsulate data objects and their associated operations. Specific topics include linked structures, recursive structures and algorithms, binary trees, balanced trees, and hash tables. These topics are fundamental to programming and are essential to other courses in computer science.

This course introduces and develops methods for designing and implementing abstract data types using the Java programming language. The main focus is on how to build and encapsulate data objects and their associated operations. Specific topics include linked structures, recursive structures and algorithms, binary trees, balanced trees, and hash tables. These topics are fundamental to programming and are essential to other courses in computer science.