Advanced work in choreographic design and related production design. Study of the creative process and how it is manifested in choreography. Prerequisite: two semesters of choreography.

Audition required. Prerequisite: 317. L and P.

These one-credit topics are designed to give students a weekly study of a specific dance technique to augment their on-going training. Students registered for a topic in this course must have completed or be concurrently registered for a related two-credit technique class and are required to be at the high intermediate or advanced level in that technique. Dance faculty should be consulted concerning questions about level placement.

An introduction to selected scientific aspects of dance, including anatomical identification and terminology, physiological principles, and conditioning/strengthening methodology. These concepts are discussed and explored experientially in relationship to the movement vocabularies of various dance styles. Enrollment limited to 20.

Offered in the Five College Department of Dance

Seminar: Explores the challenge of computer vision through readings of original papers and implementation of classic algorithms. This seminar considers techniques for extracting useful information from digital images, including both the motivation and the mathematical underpinnings. Topics range from low-level techniques for image enhancement and feature detection to higher-level issues such as stereo vision, image retrieval and segmentation of tracking of objects. Prerequisites: CSC 212, MTH 153

This class introduces the operation of logic and sequential circuits. Students explore basic logic gates (AND, OR, NAND, NOR), counters, flip-flops, decoders, microprocessor systems. Students have the opportunity to design and implement digital circuits during a weekly lab. Prerequisite: 231. Enrollment limited to 12.

Covers algorithm design techniques ("divide-and-conquer," dynamic programming, "greedy" algorithms, etc.), analysis techniques (including big-O notation, recurrence relations), useful data structures (including heaps, search trees, adjacency lists), efficient algorithms for a variety of problems, and NP-completeness. Prerequisites: 212, MTH 111, MTH 153. 

Automata and finite state machines, regular sets and regular languages; push-down automata and context-free languages; linear-bounded automata; computability and Turing machines; nondeterminism and undecidability. Perl is used to illustrate regular language concepts. Prerequisites: 111 and MTH 153.

This introductory course provides students with a broad understanding of computer hardware, software and operating systems. Topics include the history of computers; logic circuits; major hardware components and their design, including processors, memory, disks, and video monitors; programming languages and their role in developing applications; and operating system functions, including file system support and multitasking, multiprogramming and timesharing. Weekly labs give hands-on experience. Enrollment limited to 35. Offered first or second half of the semester.

We shall examine how the iconic status of woman as moral redeemer and social pathbreaker is shadowed by a darker view of female self and sexuality in some representative works by male authors of the Russian 19th century. The primary texts are Pushkin's Eugene Onegin, Turgenev's On The Eve, Chernyshevsky's What Is To Be Done?, Dostoevsky's A Gentle Spirit and Tolstoy's Anna Karenina and the Kreutzer Sonata. These novelistic narratives are supplemented with theoretical essays by Belinsky, J.S.