ENROLL

Layla 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. Students may not simultaneously enroll for CS 108 and CS 111 in the same term.

Sophomore Priority.

Waitlist for Juniors and Seniors: CS 111.WL1 (Synonym 45159)

Jed C Yang

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. Students may not simultaneously enroll for CS 108 and CS 111 in the same term.

Sophomore Priority.

Waitlist for Juniors and Seniors: CS 111.WL2 (Synonym 45160)

Josh Davis

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. Students may not simultaneously enroll for CS 108 and CS 111 in the same term.

Sophomore Priority

Waitlist for Juniors and Seniors: CS 111.WL3 (Synonym 46289)

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

Jason Decker

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.