This course provides an introductory survey of topics in computer science that are related to the Internet. Students will become familiar with the history and underlying structure of the Internet and with technologies such as email, web browsers, search engines, and web page design tools. We will learn about the science behind the technology: topics to be addressed include network design and network protocols, modern encryption methods, and applications of algorithmics and artificial intelligence to the design of search engines. Some time will also be spent considering social issues such as privacy, worms and viruses, spam, cookies, and encryption policy. Three class meetings per week, with occasional in-class lab sessions. This course does not provide prerequisite credit for any computer science course, nor does it count towards the computer science major. No previous experience with computers is required.
Limited to 40 students. Omitted 2010-11.2016-17: Not offered
This course introduces ideas and techniques that are fundamental to computer science. The course emphasizes procedural abstraction, algorithmic methods, and structured design techniques. Students will gain a working knowledge of a block-structured programming language and will use the language to solve a variety of problems illustrating ideas in computer science. A selection of other elementary topics will be presented, for example: the historical development of computers, comparison and evaluation of programming languages, and artificial intelligence. A laboratory section will meet once a week to give students practice with programming constructs. Two class hours and one one-hour laboratory per week.
Fall and spring semesters. Professor C. McGeoch.2016-17: Offered in Fall 2016 and Spring 2017
A continuation of Computer Science 11. This course will emphasize more complicated problems and their algorithmic solutions. The object-oriented programming paradigm will be discussed in detail, including data abstraction, inheritance and polymorphism. Other topics will include linked lists and trees and the use of finite-state machines in algorithm design. A laboratory section will meet once a week to give students practice with programming constructs. Two class hours and one one-hour laboratory per week.
Requisite: Computer Science 11 or consent of the instructor. This course is the appropriate starting point for most students with some prior programming experience. Fall and spring semesters. Professor L. McGeoch.2016-17: Offered in Fall 2016 and Spring 2017
This course will provide an introduction to computer systems, stressing how computers work. Beginning with Boolean logic and the design of combinational and sequential circuits, the course will discuss the design of computer hardware components, microprocessing and the interpretation of machine instructions, assembly languages, and basic machine architecture. The course will also introduce operating systems topics, basic memory management, and topics in network communication. Projects will include the design of digital circuits and the simulation of operating system and network processes.
This course has no requisite and no programming experience is required. Fall semester. Professor Kaplan.2016-17: Offered in Fall 2016
This course is the first part of a two-semester sequence examining data structures (ways of organizing data so that it can be used effectively) and algorithms (the methods that can be used to manipulate data). The use of appropriate data structures and algorithms can often dramatically reduce the computational work needed to solve a problem. Topics examined in this course will include proof techniques, run-time analysis, heaps, hash tables, sorting, searching, and divide-and-conquer algorithms. The course will provide advanced programming experience and will emphasize the use of abstraction in program design.
Requisite: Computer Science 11. Spring semester. Professor C. McGeoch.2016-17: Not offered
The main purpose of a programming language is to provide a natural way to express algorithms and computational structures. The meaning of “natural” here is controversial and has produced several distinct language paradigms; furthermore the languages themselves have shaped our understanding of the nature of computation and of human thought processes. We will explore some of these paradigms and discuss the major ideas underlying language design. Several languages will be introduced to illustrate ideas developed in the course. Topics will include functional programming, declarative programming, and programming for concurrency and distributed computing. Offered in alternate years.
Requisite: Computer Science 12. Spring semester. Professor Rager.2016-17: Not offered
An introduction to the ideas and techniques that allow computers to perform intelligently. The course will discuss methods of representing knowledge and methods of solving general problems using heuristic search. It will also discuss the design of algorithms that learn and generalize from experience. Other topics will be chosen to reflect the interests of the class and may include: communicating in English, game playing, probabilistic reasoning, planning, vision and speech recognition, computers modeled on neurons, and the possibility and implications of the existence of non-human intelligence. Three class meetings per week. Offered in alternate years.Requisite: Computer Science 12. Omitted 2010-11.
2016-17: Not offered
This course will examine the principles and design choices involved in creating the software and hardware systems on which ordinary computer programs rely. It will develop advanced topics in computer processor architecture, cover the design of operating systems and runtime systems, and provide an introduction to programming language compilers. Architectural topics will include pipelines, out-of-order execution, symmetric multithreading, and multi-core cache management. Topics in operating and runtime systems will include virtual memory, file systems, linkers and loaders, virtual machines, memory allocators, and garbage collectors. Projects will involve the implementation of key concepts and structures.
Requisite: Computer Science 11 and 16. Spring semester. Professor Rager.2016-17: Not offered
Computing networks have fundamentally changed the ways in which we use computers. The ubiquity of networks and their broad range of uses have created substantial challenges in the area of computer communication. Not only must data be delivered quickly and reliably from one computer to another, but in many cases that data must also be secure from eavesdroppers. Moreover, the recipient of the information often needs to be sure of the identity of the sender. Encryption can be used to achieve both security and authentication of information. This course will begin with the problem of communicating between two computers, followed by the problem of building generalized networks for an arbitrary number of computers. Networking topics will include layered network structure, signaling methods, error detection and correction, flow control, routing, and protocol design and verification. We will then examine in detail a variety of encryption schemes, how they can be used, and how secure they are. Cryptographic topics will include classical cryptosystems, the data encryption standard, public-key cryptography, key escrow systems, and public policy on encryption. Offered in alternate years.
Requisite: Computer Science 12 or 20. Fall semester. Professor Kaplan.2016-17: Offered in Fall 2016
This course continues the exploration of data structures and algorithms that is begun in Computer Science 20. Topics include balanced search trees, amortized algorithms, graph data structures and algorithms, greedy algorithms, dynamic programming algorithms, NP completeness, and case studies in algorithm design.
Requisite: Computer Science 12 and 20. Fall semester. Professor C. McGeoch.2016-17: Offered in Fall 2016
This course will explore the algorithms used to create “realistic” three-dimensional computer images. Major topics will include object representations (polygons, curved surfaces, functional models), rendering algorithms (perspective transformations, hidden-surface removal, reflectance and illumination, shadows, texturing), and implementation techniques (scan conversion, ray tracing, radiosity). Students will create images using OpenGl and Pixar's Renderman.
Requisite: Computer Science 12 or 20 or consent of the instructor. Omitted 2010-11.2016-17: Not offered
We will look at recent advances in the design and analysis of data structures and algorithms, with an emphasis on real-world applications. Topics to be covered include approximation algorithms and heuristics for NP-hard problems; combinatorial optimization; new analysis techniques; and methods of algorithm engineering and experimental analysis of algorithms. The specific problem domains to be studied will vary from year to year, to reflect the state of the art in algorithm research. Students will read and present research papers and carry out small research projects to evaluate algorithm performance in realistic scenarios.
Requisite: Computer Science 30. Omitted 2010-11.2016-17: Not offered
An introduction to the principles of the design of compilers, which are translators that convert programs from a source language to a target language. Some compilers take programs written in a general-purpose programming language, such as C, and produce equivalent assembly language programs. Other compilers handle specialized languages. For instance, text processors translate input text into low-level printing commands. This course examines techniques and principles that can be applied to the design of any compiler. Formal language theory (concerning regular sets and context-free grammars) is applied to solve the practical problem of analyzing source programs.
Topics include: lexical analysis, syntactic analysis (parsing), semantic analysis, translation, symbol tables, run-time environments, code generation, optimization, and error handling. Each student will design and implement a compiler for a small language. Offered in alternate years.
Requisite: Computer Science 12 and 16. Omitted 2010-11.2016-17: Not offered
This course covers basic mathematical concepts that are essential in computer science, and then uses them to teach the theory of formal languages and machine models of languages. The notion of computability will be introduced in order to discuss undecidable problems. The topics covered include: regular, context-free and context-sensitive languages, finite state automata, Turing machines, decidability, and computational complexity. Offered in alternate years.
Requisite: None, although analytical aptitude is essential. Fall semester. Professor L. McGeoch.2016-17: Offered in Spring 2017
Computer operating systems are responsible for allowing multiple users and their programs to share the hardware resources of a single machine. The policies implemented in an operating system determine its ability to provide good performance, fair sharing, isolation between programs, and predictable behavior. There are many policy choices that determine these properties, and measuring their effect requires empirical experimentation and analysis.
This course will examine both basic and advanced policies that can be used to control process scheduling, memory management, disk scheduling, network bandwidth allocation, and power consumption. We will design and perform experiments to evaluate these policies, comparing them and analyzing their behavior. Experiments will involve both simulation and in-kernel implementation. Offered in alternate years.
Requisite: Computer Science 26 and either Computer Science 12 or 20. Omitted 2010-11.2016-17: Offered in Fall 2016
The topic for spring 2011 will be "Computing with Massive Data Sets." Modern computers have permitted enormous data sets to be built that contain, for example, mapping data, scientific observations, or records of commercial transactions. Although current disk technology makes it straightforward to store such a data set, it must be organized in a way that will permit it to be manipulated efficiently. Data structures that are appropriate for small amounts of data do not usually extend to massive data sets. Careful organization can also make it possible to display large data sets (or parts of them) in a way that is useful to users without being overwhelming.One of the problems that we will explore is efficient route-finding in large maps. We will discuss some of the approaches that have been proposed, along with ways of organizing map data to permit fast computations and techniques for streaming results to users.
Requisite: Computer Science 12 and 20. Spring semester. Professor L. McGeoch.2016-17: Not offered
Open to seniors with consent of the Department.
Fall semester. The Department.2016-17: Offered in Fall 2016
Fall semester.2016-17: Offered in Fall 2016 and Spring 2017