This course will examine several fundamental ideas from computer science, beginning with the binary representation of data (numbers, characters, images) and manipulation of these data. We will study some of the big ideas that enable the current sophistication of computing, including the von Neumann stored-program architecture, the use of automatic translators for programming languages, and the utility of switching among multiple levels of abstraction. We will study the basics of programming, and the course will include some simple programming assignments. By the end of the course, we will have enough basic understanding to explore some of the technologies that underlie the internet.

Prerequisite: Eligibility for Q courses

This course will introduce the notion of a computational process as well as the idea of a program as a director of such processes. The study of problem-solving techniques and algorithm development will prepare students to apply the syntax and structure of a programming language to a variety of problem statements. The course will include regular programming assignments as well as a programming project.

Prerequisite: Eligibility for Q courses.

This course is a continuation of Computer Science 141. Elementary data structures, such as lists, records, and trees, will be discussed, as will the essentials of sorting algorithms and algorithm analysis. The inclusion of other topics such as error handling and other control features will be subject to instructor whim.

Prerequisite: Computer Science 141 or its equivalent.

Corequisite: Mathematics 111.

This course covers the implementation and use of advanced data structures such as stacks, queues, hash tables, binary search trees, sets, and graphs via an object-oriented programming language.

Prerequisite: Computer Science 142.

This course is an introduction to the structure and operation of a modern computer architecture. Topics will include instruction sets, pipelining, instruction-level parallelism, caches, memory hierarchies, storage systems and multiprocessors. Assembly language programming will be used to demonstrate the concepts.

Prerequisites: Computer Science 201 with Physics 212 strongly recommended.

The course will introduce several computational models that have been developed to formalize the notion of an algorithm. It will also discuss in detail several of the primary topics in the theory of computation including the theory of recursive functions, Turing machines, and several undecidable problems such as the Halting problem.

Prerequisites:Computer Science 301 and Mathematics 231/235.