Computer Science Department

Professor: Nancy Ide; Associate Professor: Thomas Ellman; Assistant Professors: Luke Hunsbergera, Marc Smith, Jennifer Walter; Visiting Associate Professor: Louis Voerman.

Requirements for Concentration: Computer Science 101, 102, 203, 224, 240, 241, 245, 331, 334, plus any two other graded 300-level Computer Science courses, and Mathematics 221 and 263. No course numbered 200 or higher may be elected NRO and counted toward the requirements for concentration.

Recommendations: Prospective majors are strongly advised to complete Computer Science 101 and 102 by the end of the freshman year. Students who intend to pursue graduate studies in computer science are strongly urged to take Computer Science 342.

Advanced Placement: Students eligible for Advanced Placement may be able to bypass Computer Science 101. Please consult with the department.

Independent Research: The computer science department strongly encourages students to engage in independent research with faculty, and offers ungraded courses Computer Science 298 and 399 for this purpose. The department also offers Computer Science 300-301, a graded research experience for senior majors. Computer Science 300-301 may not be substituted for 300-level elective courses satisfying the requirements for the major. Satisfactory completion of Computer Science 300-301 is required for departmental honors.

Non-Majors: Students majoring in the sciences are advised to complete Computer Science 101 and 102, or to complete a correlate sequence in Computer Science.

Correlate Sequence in Computer Science: Students majoring in other programs may complement their study by electing a correlate sequence in Computer Science. Selection of the appropriate option should be made in consultation with the Computer Science faculty to ensure exposure to the areas of Computer Science most useful to the field of concentration.

Requirements for the Correlate: Computer Science 101, 102 and 203; any two of 224, 240, 241 and 245 (at least one of which must be either 240 or 241), plus any 300-level Computer Science course. No course numbered 200 or higher may be elected NRO and counted toward the requirements for the correlate. Suggested correlate sequences include the following, in addition to Computer Science 101, 102 and 203:

I. Introductory

101a or b. Computer Science I: Problem-Solving and Abstraction (1)

Introduces the design and implementation of algorithms to solve computational problems, using an object-oriented programming language. Topics include procedural abstraction, expression evaluation, flow of control constructs and recursion; data abstraction, classes, inheritance and interfaces; elementary data structures (e.g., arrays, strings, vectors, lists, stacks, queues); input/output and event-driven programming. The course emphasizes principles of program design and data organization. A weekly laboratory period provides guided hands-on experience. The department.

Open to all classes.

102a or b. Computer Science II: Data Structures and Algorithms (1)

Development of data structures and algorithms in an object-oriented programming language. Topics include hierarchic program refinement, preconditions, postconditions and invariants; data encapsulation and fundamental data structures (e.g., priority-queues, sets, maps, heaps, search trees, hash tables and graphs); fundamental algorithms (e.g., searching and sorting) and analysis of algorithm complexity. A weekly laboratory period provides guided hands-on experience. The department.

Open to all classes.

Prerequisite: Computer Science 101.

125a. Topics in Computer Science (1)

Material from Computer Science 101/102 presented in one semester for students with previous experience in the field. Topics in 102 are fully developed and topics in 101 are reviewed. The department.

Open to all classes.

II. Intermediate

203a or b. Computer Science III: Software Design and Implementation (1)

Develops techniques for design and implementation of complex software systems. Topics include object-oriented modeling, design patterns, component libraries, multiple inheritance, parametric polymorphism, generic algorithms, containers, iterators, function objects and storage management. Development of a software system of significant complexity is required. A weekly laboratory period provides guided hands-on experience.

Prerequisite: Computer Science 102 or 125.

224a or b. Computer Organization (1)

Examines the hierarchical structure of computing systems, from digital logic and microprogramming through machine and assembly languages. Topics include the structure and workings of the central processor, instruction execution, memory and register organization, addressing schemes, input and output channels, and control sequencing. The course includes a weekly hardware/software laboratory where digital logic is explored and assembly language programming projects are implemented. Mr. Voerman.

Prerequisite: Computer Science 102 or 125.

240a. Language Theory and Computation (1)

Study of regular sets, context free grammars and languages, finite and push-down automata, as well as more powerful models of computation, such as Turing machines. Provides theoretical foundations for Computer Science 331, Compiler Design. Ms. Ide.

Prerequisites: Computer Science 203, and Mathematics 263.

241b. Algorithmics (1)

Introduces the systematic study of algorithms and their analysis with regard to time and space complexity. Topics include divide-and-conquer, dynamic programming, greediness, randomization, upper and lowerbound analysis, and introduction to NP completeness. Emphasis is placed on general design and analysis techniques that underlie algorithmic paradigms. Builds a foundation for advanced work in computer science. Ms. Walter.

Prerequisites: Computer Science 203, and Mathematics 263.

245b. Declarative Programming Models (1)

Declarative programming languages are important alternatives to the imperative languages used in most software systems. This course covers two kinds of declarative programming: functional programming and logic programming. Topics include the operational and denotational semantics of declarative languages, techniques for programming in declarative languages, and the use of mathematical logic as a tool for reasoning about programs.

Prerequisites: Computer Science 102 or 125 and Mathematics 263.

290a or b. Field Work ( 1/2 or 1)

295a or b. Special Topics ( 1/2 or 1)

Intermediate-level treatment of specialized topics in computer science,

Prerequisite: permission of instructor.

298a or b. Independent Work ( 1/2 or 1)

Prerequisite: permission of instructor.

III. Advanced

300a-301b. Senior Research and Thesis ( 1/2, 1/2)

Investigation and critical analysis of a topic in experimental or theoretical computer science. Experimental research may include building or experimentation with a nontrivial hardware or software system. A student electing this course must first gain, by submission of a written research proposal, the support of at least one member of the computer science faculty with whom to work out details of a research strategy. The formal research proposal, a written thesis, and oral presentation of results are required for the course. A second faculty member participates in both the planning of the research and final evaluation. The department.

Prerequisites: Minimum 3.5 GPA in 200 and 300-level Computer Science coursework at the end of the junior year, and permission of the department.

[324b. Computer Architecture] (1)

An exploration of current research areas in computer organization including an examination of data-flow, microcode, cache memory, distributed, parallel, and other nonstandard architectures, and related topics. Mr. Voerman.

Prerequisite: Computer Science 224.

Alternate years: not offered in 2007/08.

325b. Microcomputers and Digital Electronics (1)

Advanced seminar in the architecture and implementation of microprocessors. Topics include digital logic, memory and processor interfaces, interrupt handling, and serial I/O methods. Differences among logic implementations such as TTL, CMOS, and ECL are considered. Students participate in the design and imple-mentation of a microcomputer. Mr. Voerman.

Prerequisite: Computer Science 224.

Alternate years: offered in 2007/08.

331b. Compilers (1)

Studies the theory of automata for language recognition as well as the implementation of actual compilers for programming languages. During the semester students develop modules comprising the front-end of a compiler for a high-level computer. Ms. Ide.

Prerequisite: Computer Science 224, 240, 245, or permission of instructor.

334a. Operating Systems (1)

Deals with the theory and implementation of the software that governs the management of system resources. Topics that are covered include file organization, process scheduling, system services, memory management, security methods, resource contention, and design principles. Operating systems for parallel and distributed processing, real-time processing, virtual machines, and networking are also considered. Mr. Voerman.

Prerequisites: Computer Science 203, 224.

342b. Topics in Theoretical Computer Science (1)

Investigation of a selected topic in theoretical computer science. The topic is chosen each year according to the interests of students and faculty. Potential topics include algorithms, complexity, computability, programming language semantics, and formal methods, among others. The department.

Prerequisite: Computer Science 240, 241, 245.

Alternate years: offered in 2007/08.

353b. Bioinformatics (1)

(Same as Biology 353b)

[365a. Artificial Intelligence] (1)

An introduction to Artificial Intelligence as a discipline of Computer Science, covering the traditional foundations of the field and a selection of recent advances. Traditional topics include: search, two- player adversarial games, constraint satisfaction, knowledge representation and reasoning, and planning. Additional topics will vary from year to year and will be selected from the following: reasoning about time, probabilistic reasoning, neural networks, philosophical foundations, multi- agent systems, robotics, recent advances in planning. Significant programming assignments and a course project complement the material presented in class.

Prerequisites: Computer Science 203, Computer Science 245.

Not offered in 2007/08.

375a. Networks (1)

Provides a detailed introduction to network protocols and software, as well as a discussion of network architectures and technology. Topics covered include properties of various transmission media, methods for reliable transfer of data, Ethernet and local-area networks, TCP/IP and the Internet, routing, and security. Programming assignments and a project emphasize the key concepts. Mr. Smith.

Prerequisites: Computer Science 203 or permission of instructor.

[377a. Parallel Programming] (1)

An introduction to parallel computing, with coverage of parallel architectures, programming models, and techniques. Topics include SIMD and MIMD models, shared-memory and message-passing styles of computation, synchronization, deadlock, and parallel language design. Students are exposed to common techniques for solving problems in sorting, searching, numerical methods, and graph theory, and gain practical experience through programming assignments run on a parallel processing system. Mr. Smith.

Prerequisite: Computer Science 203, 224.

Not offered in 2007/08.

[378a. Graphics] (1)

A survey of computational and mathematical techniques for modeling and rendering realistic images of three-dimensional scenes. Topics include: event-driven user interfaces; geometric transformations and projections; scene graphs; implicit and parametric surfaces; models of color and light; surface shading and texturing; local and global rendering algorithms; and an introduction to computer animation.

Prerequisites: Computer Science 203 and’ Mathematics 221.

Not offered in 2007/08.

379b. Computer Animation: Art, Science and Criticism (1)

(Same as Art 379b and Media Studies 379b) An interdisciplinary course in Computer Animation aimed at students with previous experience in Computer Science, Studio Art, or Media Studies. The course introduces students to mathematical and computational principles and techniques for describing the shape, motion and shading of three-dimensional figures in Computer Animation. It introduces students to artistic principles and techniques used in drawing, painting and sculpture, as they are translated into the context of Computer Animation. It also encourages students to critically examine Computer Animation as a medium of communication. Finally, the course exposes students to issues that arise when people from different scholarly cultures attempt to collaborate on a project of mutual interest. The course is structured as a series of animation projects interleaved with screenings and classroom discussions. A weekly laboratory period provides guided hands-on experience. Mr. Ellman, Mr. Roseman.

Prerequisite: Permission of the instructors.

395a. Special Topics (1)

In-depth treatment of specialized topics in Computer Science.

Topic for 2007/08: Computational Linguistics. This course addresses the fundamental question at the intersection of human languages and computer science: how can computers acquire, comprehend and produce natural languages such as English? Introduces computational methods for modeling human language, including morphology, syntax, semantics, and discourse; corpus-based and stochastic methods for language analysis; and natural language applications such as information retrieval, machine translation, and computational lexicography. Programming experience is recommended but not required. Ms. Ide.

Prerequisite: Computer Science 101, 203 or permission of the instructor.

399a or b. Senior Independent Work ( 1/2 or 1)