Fall 2007 Courses

600.101 (E)

COMPUTER FLUENCY (4) Houlahan

Students will become fluent with information technology through coverage of basic underlying concepts and use of common applications. Concepts will include the building blocks of computer systems and software, as well as historical perspectives and social implications. Students will learn basic and selected advanced skills with MS Office (word processing, spreadsheets, presentations, databases), as well as webpage design in HTML, with programming in JavaScript, and unix operating system basics. The goal is to empower students so that they remain skilled computer users and will have confidence and success learning and applying new technologies on their own in the future. Limit 15 per section.

MTW 11
limit 15/section
Sec 1: W 4
Sec 2: Th 9
Sec 3: Th 3
Sec 4: Cancelled (was Fr 10)

600.102 (E)

CS FOUNDATIONS (4) Froehlich

This course is an introduction to computer science for majors and non-majors. Students are exposed to the discipline through vignettes of logic and algebra, computer systems and networks, algorithms, programming languages, computation theory, and selected applications. CS majors can only take this course in their first year of CS coursework. Limit 15 per section.

Prereq: 600.101 or equiv. knowledge.

CANCELLED
(was MTW 1)
limit 15/section
Sec 1: Th 10
Sec 2: Fr 9

600.105

M&Ms: FRESHMAN EXPERIENCE (1) Houlahan

This course is required for all freshmen Computer Science majors. Transfers into the major and minors may enroll by permission only. Students will attend three 4-week blocks of meetings with different computer science professors, focused on a central theme. Active participation is required. Satisfactory/Unsatisfactory only.

Th 4
CS majors only!

600.107 (E)

INTRO TO PROGRAMMING IN JAVA (3) Houlahan

This course introduces the fundamental programming concepts and techniques in Java and is intended for all who plan to use computer programming in their studies and careers. Topics covered include control structures, arrays, functions, recursion, dynamic memory allocation, simple data structures, files, and structured program design. Elements of object-oriented design and programming are also introduced. Students without experience are strongly advised to also take 600.108.

Prereq: familiarity with computers.

MTW 3
limit 120

600.108 (E)

INTRO PROGRAMMING LAB (1) Houlahan

Satisfactory/Unsatisfactory only. Must be taken in conjunction with 600.107. The purpose of this course is to give novice programmers extra hands-on practice with guided supervision. Students will work in pairs each week to develop working programs, with checkpoints for each development phase.

Co-req: 600.107.

Sec 1: We 6-9p
Sec 2: Th 4-7p
Sec 3: Fr 2:30-5:30p
limit 14/section

600.120 (E)

INTERMEDIATE PROGRAMMING (4) Amir

This course covers intermediate to advanced programming in both C and C++. The focus of the course is on programming techniques, class design, and the use of class libraries. Topics to be covered include: polymorphism, overloading, inheritance, pointers, dynamic memory allocation, templates, collections, exceptions, and others as time permits. Students are expected to learn syntax and low-level language features independently. Coursework involves significant programming projects in both languages.

Prereq: 600.107 or AP CS.

MTW 2
limit 25/section
Sec 1: Th 12
Sec 2: F 1

600.226 (E,Q)

DATA STRUCTURES (3) Froehlich

This course covers the design and implementation of data structures including collections, sequences, trees, and graphs. Other topics include sorting, searching, and hashing. Course work involves both written homework and Java programming assignments.

Prereq: 600.107 or 600.109.

ThF 2:30-3:45

600.271 (E,Q)

AUTOMATA and COMPUTATION THEORY (3) Kosaraju

This course is an introduction to the theory of computing. Topics include design of finite state automata, pushdown automata, linear bounded automata, Turing machines and phrase structure grammars; correspondence between automata and grammars; computable functions, decidable and undecidable problems, P and NP problems, NP-completeness, and randomization. Students may not receive credit for 600.271 and 600.471.

MTW 1

600.315 (E)

DATABASE SYSTEMS (3) Yarowsky

Introduction to database management systems and database design, focusing on the relational and object-oriented data models, query languages and query optimization, transaction processing, parallel and distributed databases, recovery and security issues, commercial systems and case studies, heterogeneous and multimedia databases, and data mining.

Prereq: 600.226. Students may receive credit for 600.315 or 600.415, but not both.

ThF 2:30-3:45

600.319 (E)

STORAGE SYSTEMS (3) Burns

Storage systems is one of the fastest growing and most interesting research areas in computer science. Storage systems often dominate the performance of computer systems as a whole. Also, they are responsible for the safe-keeping of an organization's most valuable assets -- information! The course will cover the design and implementation of storage systems and the architecture and characteristics of the components on which storage systems are built. Topics wil range from the device level up to distributed systems concepts. This will include disk drive hardware and firmware, file system and database structures, mirroring and RAID, disk array controllers, local storage interconnects, storage area networks, capacity planning and configuration, distributed file systems and network-attached storage, backup/restore and disaster recovery, and security for storage. [Systems]

Prereq: 600.226 and 600.333/433. Students may receive credit for 600.319 or 600.419, but not both.

MTW 11
limit 20

600.321 (E)

OBJECT ORIENTED SOFTWARE ENGINEERING (3) Smith

This course covers object-oriented software construction methodologies and their application. The main component of the course is a large team project on a topic of your choosing. Course topics covered include object-oriented analysis and design, UML, design patterns, refactoring, program testing, code repositories, team programming, and code reviews.

Prereq: 600.226 and 600.120. Students may receive credit for 600.321 or 600.421, but not both.

ThF 1-2:15

600.328 (E)

ADDED!

COMPILERS (3) Froehlich

Introduction to compiler design, including lexical analysis, parsing, syntax-directed translation, symbol tables, run-time environments, and code generation and optimization. Students are required to write a compiler as a course project. [Systems]

Prereq: 600.120 & 600.226

MTW 1

600.333 (E)

COMPUTER SYSTEM FUNDAMENTALS (4) Masson

CSF addresses the design and performance of the principal operational components of a reduced-instruction-set computing system (RISC) which supports the efficient execution of widely used instruction sets. Arithmetic and logic units, memory hierarchy designs, state-machine controllers, and other related hardware and firmware components are studied, and the qualities of their combined processing capabilities are assessed by means of execution times associated with a range of benchmark programs. Assembly language programming projects, homework problems, and exams are employed to assess a student's fundamental understanding of the tradeoffs resulting from an assortment of variations in digital system design decisions that ultimately characterize the performance of the computing system architecture that is developed.

Prereq: 600.107/600.109. Students may receive credit for 600.333 or 600.433, but not both.

MTW 10
limit 80

600.363 (E,Q)

INTRODUCTION TO ALGORITHMS (3) Awerbuch

This course concentrates on the design of algorithms and the rigorous analysis of their efficiency. Topics include the basic definitions of algorithmic complexity (worst case, average case); basic tools such as dynamic programming, sorting, searching, and selection; advanced data structures and their applications (such as union-find); graph algorithms and searching techniques such as minimum spanning trees, depth-first search, shortest paths, design of online algorithms and competitive analysis.

Prereq: 600.226 or Perm. Req'd. Students may receive credit for 600.363 or 600.463, but not both.

MTW 9

600.392 (E)

SENIOR DESIGN PROJECT (3) Froehlich

This course will give senior CS majors an intensive capstone design project experience. Students will work in groups with real world customers to develop a working system. Project design, management and communication skills will be emphasized. Software development methodologies may also be presented. [General]

Prereq: 600.120, 600.226; 600.321 recommended.

MTW 4
limit CS senior majors only

600.415 (E)

DATABASE SYSTEMS (3) Yarowsky

Graduate level version of 600.315. Students may receive credit for 600.315 or 600.415, but not both.

Prereq: 600.226.

ThF 2:30-3:45

600.419 (E)

STORAGE SYSTEMS (3) Burns

Graduate level version of 600.319. Students may receive credit for 600.319 or 600.419, but not both. [Systems]

Prereq: 600.226 and 600.333/433.

MTW 11
limit 20

600.421 (E)

OBJECT ORIENTED SOFTWARE ENGINEERING (3) Smith

Graduate level version of 600.321. Students may receive credit for 600.321 or 600.421, but not both.

Prereq: 600.226 and 600.120/121.

ThF 1-2:15

600.424 (E)

NETWORK SECURITY (3)Monrose

This course focuses on communication security in computer systems and networks. The course is intended to provide students with an introduction to the field of network security. The course covers network security services such as authentication and access control, integrity and confidentiality of data, firewalls and related technologies, web security, anonymity, and privacy. Course work involves implementing various security techniques.

Prereq: 600.344/444 and 600.226. 600.120 (or equivalent) and 600.349/449 recommended.

MW 2-3:15

600.428 (E)

ADDED!

COMPILERS (3) Froehlich

Graduate version of 600.328. Students may not receive credit for both 600.328 and 600.438. [Systems]

Prereq: 600.120 & 600.226

MTW 1

600.433 (E)

COMPUTER SYSTEMS (4) Masson

Graduate version of 600.433. Students may receive credit for 600.333 or 600.433, but not both.

MTW 10
limit 50

600.439 (E)

MICROKERNEL ARCHITECTURE AND DESIGN (3) Shapiro

This course examines operating system internals by using an existing, high-performance microkernel as a guide. We start from the moment the machine is powered on and look at each action that the microkernel takes as it starts up. We follow this path until we have worked our way through the first interprocess communication, and then look at how drivers and system structure is initialized. As we work our way through the microkernel's initialization and startup, we examine what is happening at each step, what options exist for the design at that point, and why the particular choice of the actual implementation was made. We will also look at architectural tradeoffs in the design of the operating system.

The end result is a very different look at operating systems than the one presented in OS textbooks. Operating system textbooks are more often driven by considerations of pedagogy than by well-motivated requirements or design principles. A microkernel gives us a unique opportunity to walk through the entire system structure as a manageable entity. [Systems]

Prereq: Thorough knowledge of C and UNIX, 600.333/433 & 600.318/418.

T 2-5

limit 25

600.442 (E,Q)

CRYPTOGRAPHY AND NETWORK SECURITY (3) Ateniese

This course focuses on algorithms and protocols for secure network communication. Topics include cryptographic algorithms (DES, Diffie-Hellman, RSA), authentication, key management, secure networking, certification, trust management, and secure electronic commerce.

Prerequisite: 600.226 and a 300-level or above systems course; 600.271 and 550.171 or equiv.

ThF 1-2:15
limit 40

600.443 (E)

ADDED!

SECURITY AND PRIVACY IN COMPUTING (3) Rubin

Lecture topics will include computer security, network security, basic cryptography, system design methodology, and privacy. There will be a heavy work load, including written homework, programming assignments, exams and a comprehensive final. The class will also include a semester-long project that will be done in teams and will include a presentation by each group to the class. [Applications]

Prerequisite: A basic course in operating systems and networking, or permission of instructor.

ThF 2:30-3:45
limit 50

600.445 (E)

COMPUTER INTEGRATED SURGERY I (4) Taylor

This course focuses on computer-based techniques, systems, and applications exploiting quantitative information from medical images and sensors to assist clinicians in all phases of treatment from diagnosis to preoperative planning, execution, and follow-up. It emphasizes the relationship between problem definition, computer-based technology, and clinical application and includes a number of guest lectures given by surgeons and other experts on requirements and opportunities in particular clinical areas.

Prereq: 600.120, 600.226 and linear algebra. Recmd: 600.457, 600.461, image processing.

ThF 1-2:15

600.450 (E)

NETWORK EMBEDDED SYSTEMS AND SENSOR NETWORKS (3) Terzis

(This course replaces 600.349/449.) This course is an introduction to fundamental concepts of networked embedded systems and wireless sensor networks. It is intended for juniors, seniors and first year graduate students in Computer Science and other engineering majors with the prerequisite background. Covered topics include: embedded systems programming concepts, low power and power aware design, radio technologies, communication protocols for ubiquitous computing systems, and some of the mathematical foundation of sensor behavior. Laboratory work consists of a set of programming assignments that consider a set of the issues described in class.

Prerequisites: 600.226, 600.120 and 600.344/600.444.

ThF 2:30-3:45
limit 40

600.463 (E,Q)

ALGORITHMS I (3) Awerbuch

Graduate version of 600.363. Students may receive credit for 600.363 or 600.463, but not both.

Prereq: 600.226 or Perm. req'd.

MTW 9

600.465 (E)

NATURAL LANGUAGE PROCESSING (3) Eisner

This course is an in-depth overview of techniques for processing human language. How should linguistic structure and meaning be represented? What algorithms can recover them from text? And crucially, how can we build statistical models to choose among the many legal answers? The course covers methods for trees (parsing and semantic interpretation), sequences (finite-state transduction such as morphology), and words (sense and phrase induction), with applications to practical engineering tasks such as information retrieval and extraction, text classification, part-of-speech tagging, speech recognition and machine translation. There are a number of structured but challenging programming assignments.

Prerequisite: 600.226. Previous exposure to probability or linguistics may be helpful.

MTW 2
limit 60

600.471 (E,Q)

THEORY OF COMPUTATION (3) Hohenberger

This is a graduate-level course studying the theoretical foundations of computer science. Topics covered will be models of computation from automata to Turing machines, computability, complexity theory, randomized algorithms, inapproximability, interactive proof systems and probabilistically checkable proofs. Students may not receive credit for 600.271 and 600.471 (with the exception of this semester). [Analysis]

Prereq: 550.171

MW 3:30-4:45
limit 40

600.475 (E)

MACHINE LEARNING (3)Sheppard

This course covers current topics in machine learning research. After a brief historical review, the class focuses on a series of different learning models, including memory-based learning, genetic algorithms, and neural net learning algorithms. The class considers the design and methodology of experiments used to test and compare different machine learning systems. Although the main focus is on experimental work, the course also examines theoretical work on distribution-free learning models. Students in the course design their own machine learning system as a final project. [Applications]

Prereq: 600.335/435 or permission of instructor.

MTW 9

600.491 (E)

COMPUTER SCIENCE WORKSHOP I

An applications-oriented, computer science project done under the supervision and with the sponsorship of a faculty member in the Department of Computer Science.

Perm. of faculty supervisor req'd.

See below for faculty section numbers

600.501

INDEPENDENT STUDY (Freshman, Sophomore)

Individual, guided study under the direction of a faculty member in the department. The program of study, including the credit to be assigned, must be worked out in advance between the student and the faculty member involved. Permission required.

See below for faculty section numbers

600.503

INDEPENDENT STUDY (Junior, Senior)

Individual, guided study under the direction of a faculty member in the department. The program of study, including the credit to be assigned, must be worked out in advance between the student and the faculty member involved. Permission required.

See below for faculty section numbers

600.507

INDEPENDENT RESEARCH

Independent research under the direction of a faculty member in the department. The program of research, including the credit to be assigned, must be worked out in advance between the student and the faculty member involved. Permission required.

See below for faculty section numbers

600.509

COMPUTER SCIENCE INTERNSHIP

Individual work in the field with a learning component, supervised by a faculty member in the department. The program of study and credit assigned must be worked out in advance between the student and the faculty member involved. Students may not receive credit for work that they are paid to do. As a rule of thumb, 40 hours of work is equivalent to one credit. Permission required.

See below for faculty section numbers

600.519

SENIOR HONORS THESIS (3)

For computer science majors only. The student will undertake a substantial independent research project under the supervision of a faculty member, potentially leading to the notation "Departmental Honors with Thesis" on the final transcript. Students are expected to enroll in both semesters of this course during their senior year. Project proposals must be submitted and accepted in the preceding spring semester (junior year) before registration. Students will present their work publically before April 1st of senior year. They will also submit a first draft of their project report (thesis document) at that time. Faculty will meet to decide if the thesis will be accepted for honors.

Prereq: 3.5 GPA in Computer Science after spring of junior year and permission of faculty supervisor.

See below for faculty section numbers

600.546 (E)

SENIOR THESIS IN COMPUTER INTEGRATED SURGERY (3)

Prereq: 600.445 or perm req'd.

Section 1: Taylor

600.601

COMPUTER SCIENCE SEMINAR

Required for all full-time graduate students.

ThF 10:30-12

600.643

REPLACED BY 600.443

ADVANCED TOPICS IN COMPUTER SECURITY Rubin

Topics will vary from year to year, but will focus mainly on network perimeter protection, host-level protection, authentication technologies, intellectual property protection, formal analysis techniques, intrusion detection and similarly advanced subjects. Emphasis in this course is on understanding how security issues impact real systems, while maintaining an appreciation for grounding the work in fundamental science. Students will study and present various advanced research papers to the class. There will be homework assignments and a course project. [Systems or Applications]

Prereq: any 600.4xx course in computer security or cryptography including 600.442, 600.443 or 600.424; or permission of instructor.

Cancelled
limit 20

600.657

NEW COURSE

ADVANCED TOPICS FOR COMPUTER GRAPHICS Kazhdan

The Poisson Equation in Image & Shape Processing: This seminar will survey a variety of applications of the Poisson in the domain of computer graphics. The course will begin by reviewing the Poisson equation and several numerical methods for solving the associated linear system. Next, we will consider applications of the Poisson equation to challenges in image editing, including HDR compression, inpainting, and texture synthesis. Finally, we will consider generalizations of the system to 3D shapes, including applications such as mesh deformation and surface reconstruction. Students will be expected to present several papers throughout the semester and to participate in group discussions of the assigned readings. [Applications]

Prereq: any 600.4xx course in computer graphics & linear algebra; or permission of instructor.

MW 2-3:15

600.658

REPLACED BY 600.657

SHAPE ANALYSIS AND RETRIEVAL Kazhdan

This course is motivated by the recent proliferation of 3D models on the World Wide Web and will focus on methods for designing systems that allow users to retrieve desired models from large repositories of 3D shapes. The course will review a number of existing shape representations designed to assist in the task of whole-object and partial-object retrieval. Some of the subjects discussed in this course will include, signal processing, alignment, compression, skeletonization, and shape descriptors. Students will be expected to present one or two papers throughout the course of the semester and will also need to complete a final project in the area. [Applications]

Prereq: any 600.4xx course in computer graphics & linear algebra; or permission of instructor.

Cancelled

600.726

SEMINAR IN PROGRAMMING LANGUAGES Smith

This seminar course covers recent developments in the foundations of programming language design and implementation. Topics covered vary from year to year. Students will present papers orally.

Prereq: permission of instructor

W 11-12

600.735

SEMINAR IN MACHINE LEARNING (1) Sheppard

This seminar course will look at research in machine learning. Topics will be selected from those of mutual interest between students and the instructor. Sample topics include reinforcement learning, kernel methods, experimental methods in machine learning, computational learning theory, lazy learning, evolutionary computation, and neural networks. Students are expected to select papers and lead discussion.

Th 9-10

600.745

SEMINAR IN COMPUTER INTEGRATED SURGERY Fichtinger

This weekly seminar will focus on research issues in computer integrated surgery, including subjects such as medical image analysis, statistical modeling, visualization, vision/sensing, surgical planning, medical robotics, and clinical applications. The purpose of the course is to widen the knowledge and awareness of the participants in current research in these areas, as well as to promote greater awareness and interaction between multiple research groups within the University and beyond. The format of the course is informal presentation by a pre-eminent invited speaker, followed by free discussion.

W 12-1:30

600.757

SEMINAR IN COMPUTER GRAPHICS Kazhdan

In this course we will review current research in computer graphics. We will meet for an hour once a week and one of the participants will lead the discussion for the week.

Permission required.

TBA

600.765

SEMINAR IN NATURAL LANGUAGE PROCESSING Eisner

A reading group exploring important current research in the field and potentially relevant material from related fields. Enrolled students are expected to present papers and lead discussion.

Th 4

600.766

NEW COURSE ADDED!

SEMINAR IN MACHINE TRANSLATION Callison-Burch & Hall

The weekly machine translation reading group will review current research in statistical machine translation, and well as relevant historical papers. Enrolled students will present papers and lead discussions.

F 2:30

600.801

DISSERTATION RESEARCH

See below for faculty section numbers.

600.803

GRADUATE RESEARCH

Independent research for masters or pre-dissertation PhD students. Permission required.

See below for faculty section numbers.

600.809

INDEPENDENT STUDY (graduate students)

Permission required.

See below for faculty section numbers.