600.101 (E)

COMPUTER LITERACY (4) Beach

Limit 14 per section

Lec.

Sec. 01

02

03

04

05

ThF 9-10:15

W 8

W 9

W 10

W 11

Th 11

600.103 (E)

INTRODUCTION TO COMPUTER SCIENCE (1) Houlahan  Satisfactory/ Unsatisfactory only Required course for all C.S. majors/ minors Course cancelled 8/19/04

Sec. 01

Th 4

600.106 (E)

ALGORITHMIC THINKING (Pre-Programming) (1) Vasconcelos-Santillan  Limit 20   This course is intended for novice programmers, to be taken before or in conjunction with 600.107 or 600.109. The purpose is to provide students with the abstraction and logical thinking tools necessary for writing computer programs. It will introduce students to fundamental concepts and algorithms common to many programming languages. Short course meets 4 weeks only 9/9-9/30

Sec. 01

ThF 1-2:15
Th 1-2:15

600.107 (E)

INTRODUCTION TO PROGRAMMING IN JAVA (3) Houlahan      Limit 150 Students without experience are strongly advised to also take 600.108 or 600.106. Prereq: familiarity with computers.

Sec. 01

MTW 3

600.108 (E)

INTRODUCTORY PROGRAMMING LAB (1) Houlahan   Satisfactory/ Unsatisfactory   Limit 16 per section Coreq: 600.107/109  Satisfactory/Unsatisfactory only. 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. Sec. 02 canceled 9/21/04

Sec. 01

02

03

W 5-8pm

Th 1-4

F 9-12

600.113 (E)

INTERNET (4) Beach

Prereq: 600.101 or equivalent   

Limit 10 per section

Sec. 01 canceled 9/2/04. Sec. 05 canceled 9/21/04.

Lec.

Sec. 01

02

03

04

05

ThF 10:30-12

T 8

T 9

T10

T11

Th 9

600.120 (E)

INTERMEDIATE PROGRAMMING (4) Wilson    Limit 80      Prereq: 600.107 or 600.109. Students who have taken 600.118 or 600.121 may not take this course      This course has replaced 600.118 and 600.121. It covers intermediate to advanced object-oriented programming in both C++ and Java. 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.

Sec. 01

ThF 12:10-1:50
ThF 12:35-2:15

600.211 (E)

UNIX SYSTEM PROGRAMMING (3) Wilson   Limit 40    Prereq: 600.107/109 Recommended: 600.111 or equivalent    

Sec. 01

ThF 2:30-3:45

600.226 (E,Q)

DATA STRUCTURES (3) Cohen Intermediate Programming (600.120) highly recommended   Prereq: 600.107 or 600.109 Overview of Java will be provided.

Sec. 01

MW 2-3:15
MW 4-5:15

600.271 (E,Q)

AUTOMATA & COMPUTATION THEORY (3) Kosaraju   Limit 150

Sec. 01

MTW 1

600.315 (E)

DATABASE SYSTEMS (3) Yarowsky   Prereq: 600.226    Students receive credit for 600.315 or 600.415 but not both

Sec. 01

ThF 2:30-3:45

600.319 (E)

STORAGE SYSTEMS (3) Burns  Limit 20 Prereq: 600.226 and 600.333/433. Students may receive credit for 600.319 or 600.419, but not both.    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.

Sec. 01

MTW 11

600.321 (E)

OBJECT ORIENTED SYSTEMS (3) Smith    Prereq: 600.226 and 600.120/121    Students receive credit for 600.321 or 600.421, but not both

Sec. 01

ThF 1-2:15

600.324 (E)

NETWORK SECURITY (3) Monrose Prereq: 600.344/444 and 600.226. 600.121 (or equivalent) and 600.349/449 recommended. Students may receive credit for 600.324 or 600.424, not both.  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.

Sec. 01

MW 2-3:15

600.333 (E)

COMPUTER SYSTEM FUNDAMENTALS (3) Masson   Prereq: 600.107 or 600.109    Students may receive credit for 600.333 or 600.433, but not both

Sec. 01

MTW 10

600.337 (E)

DISTRIBUTED SYSTEMS (3) Amir Prereq: 600.226 & 600.120/121 Recommended: 600.111 Students receive credit for 600.337 or 600.437 but not both

Sec. 01

M 3

W 3-5

600.348 (E,Q)

THEORY OF NETWORK COMMUNICATION (3) Scheidler   Prereq: 600.344/444 or Perm. Req=d   Some knowledge of probability theory is helpful. Students receive credit for 600.348 or 600.448 but not both. The course covers current topics in the area of communication in distributed systems. This includes an introduction to parallel computational models and important routing parameters and networks, as well as the presentation and analysis of strategies for broadcasting, unicasting, and multicasting in static and dynamic networks, load balancing, and distributed data management.

Sec. 01

MTW 1

600.349 (E)

INTERNET PROTOCOLS (3) Terzis Limit 20    Prereq: 600.120 & 600.344/444 Recommended: 600.211 or 600.111  Students may receive credit for 600.349 or 600.449, but not both.  This course covers the most important Internet protocols in detail. The goal is to get a solid technical understanding of the Internet's foundations and a concrete example of complete network protocol family. The course material will be taken from the textbook but the students will also be required to read the actual protocol specifications (RFCs). A major part of this course is the two group projects where students are going to implement realistic network protocols.

Sec. 01

MW 2-3:15

600.363 (E,Q)

INTRODUCTION TO ALGORITHMS (3) Awerbuch   Prereq: 600.226 or Perm. Req=d.    Students may receive credit for 600.363 or 600.463, but not both

Sec. 01

MTW 9

600.403 (E,Q)

COMPUTATIONAL GENOMICS: SEQUENCE MODELING (1) Smith/Tromble    Limit 20     Prereq: knowledge of algorithms, probability and programming. [Analysis] This short course will cover probabilistic methods for modeling biological sequences (e.g., DNA and protein sequences). Topics include inferring relationships between and among sequences and evolutionary trees over sequences. Short course meets 4 weeks only 10/4-11/1.

Sec. 01

MTW 1

600.415 (E)

DATABASE SYSTEMS (3) Yarowsky     Prereq: 600.226    Limit 10   Students may receive credit for 600.315 or 600.415, but not both  Cross listed with Information Security Institute

Sec. 01

ThF 2:30-3:45

600.419 (E)

STORAGE SYSTEMS (3) Burns  Prereq: 600.226 and 600.333/433. Students may receive credit for 600.319 or 600.419, but not both. 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 safekeeping 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. Cross listed with Information Security Institute

Sec. 01

MTW 11

600.421 (E,Q)

OBJECT ORIENTED SYSTEMS (3) Smith    Prereq: 600.226 and 600.120/121    Students may receive credit for 600.321 or 600.421, but not both   Cross listed with Information Security Institute

Sec. 01

ThF 1-2:15

600.424 (E)

NETWORK SECURITY (3) Monrose Prereq: 600.344/444 and 600.226. 600.121 (or equivalent) and 600.349/449 recommended. Students may receive credit for 600.324 or 600.424, not both.  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. Cross listed with Information Security Institute

Sec. 01

MW 2-3:15

600.433 (E)

COMPUTER SYSTEM FUNDAMENTALS (3) Masson  Prereq: 600.107 or 600.109   Students may receive credit for 600.333 or 600.433, but not both    Cross listed with Information Security Institute

Sec. 01

MTW 10

600.437 (E)

DISTRIBUTED SYSTEMS (3) Amir   Prereq: 600.120/121 Recommended: 600.111  Students receive credit for 600.337 or 600.437 but not both  Cross listed with Information Security Institute

Sec. 01

M 3

W 3-5

600.438 (E)

ADVANCED TOPICS IN OPERATING SYSTEMS (3) Shapiro   Limit 20 Prereq: 600.318/418     CS graduate students only, undergrads with permission.  Topics vary; emphasis is on understanding not just concepts but their implication for the whole of the resulting system design. Significant project may be included.  Cross listed with Information Security Institute

Sec. 01

M 4

T 3-5

600.442 (E,Q)

CRYPTOGRAPHY AND NETWORK SECURITY (3) Ateniese   Limit 20   Prereq: 600.226 and 300-level or above systems course; 600.271 and 550.171 or equivalent.   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.  Cross listed with Information Security Institute

Sec. 01

ThF 1-2:15

600.445 (E)

COMPUTER - INTEGRATED SURGERY I (4) Taylor   Prereq: 600.226

Sec. 01

ThF 1-2:15

600.448 (E,Q)

THEORY OF NETWORK COMMUNICATION (3) Scheidler  Prereq: 600.344/444 or Perm. Req=d   The course covers current topics in the area of communication in distributed systems. This includes an introduction to parallel computational models and important routing parameters and networks, as well as the presentation and analysis of strategies for broadcasting, unicasting, and multicasting in static and dynamic networks, load balancing, and distributed data management. Some knowledge of probability theory is helpful. Students receive credit for 600.348 or 600.448 but not both   Cross listed with Information Security Institute

Sec. 01

MTW 1

600.449 (E)

INTERNET PROTOCOLS (3) Terzis Prereq: 600.120 and 600.344/444 or Perm. Req’d  Recommended 600.211 or 600.111  CS graduate students only, undergrads with permission.  This course covers the most important Internet protocols in detail. The goal is to get a solid technical understanding of the Internet's foundations and a concrete example of complete network protocol family. The course material will be taken from the textbook but the students will also be required to read the actual protocol specifications (RFCs). Students receive credit for 600.349 or 600.449 but not both Cross listed with Information Security Institute

Sec. 01

MW 2-3:15

600.461 (E,Q)

COMPUTER VISION (3) Hager   Prereq: 600.226

Sec. 01

ThF 9-10:15

600.463 (E,Q)

ALGORITHMS I (3) Awerbuch   Prereq: 600.226 or Perm. Req'd.   Students may receive credit for 600.463 or 600.363, but not both   Cross listed with Information Security Institute

Sec. 01

MTW 9

600.465 (E,Q)

NATURAL LANGUAGE PROCESSING (3) Eisner Limit 30   Prereq: 600.226 Previous exposure to probability or linguistics may be helpful. 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.

Sec. 01

MTW 2

600.491 (E)

COMPUTER PROGRAMMING WORKSHOP I (3) Consent of faculty supervisor required

Sec. 01  Masson

Sec. 02  Kosarju

Sec. 03  Awerbuch

Sec. 04  Taylor

Sec. 05  Smith

Sec. 06  Goodrich

Sec. 07  Brill

Sec. 08  Salzberg

Sec. 09  Hager

Sec. 10 Wolff

Sec. 11  Kumar

Sec. 12  Amir

Sec. 13  Yarowsky

Sec. 14  Cohen

Sec. 15  Burns

Sec. 16  Eisner

Sec. 17  Shapiro

Sec. 18  Scheideler

Sec. 19  Stanton

Sec. 20  Ateniese

Sec. 21  Rubin

Sec. 22  Monrose

Sec. 23  Terzis

Sec. 24  Scheinerman

Sec. 25 Winslow

TBA

600.501

INDEPENDENT STUDY (FRESHMEN, SOPHOMORES)   See 600.491 for faculty section numbers

600.503

INDEPENDENT STUDY (JUNIORS, SENIORS)    See 600.491 for faculty section numbers

600.507

INDEPENDENT RESEARCH   See 600.491 for faculty section numbers

600.509

COMPUTER SCIENCE INTERNSHIP Staff   Perm. Req’d   See 600.491 for faculty section numbers

600.519

SENIOR HONOR THESIS (3) Prereq: 3.5 GPA in C.S. courses at end of junior year and permission of faculty sponsor - C.S. majors only Substantial independent research project, potentially leading to the notation ADepartmental Honors with Thesis@.  Students are expected to enroll in both semesters of senior year. Project proposals must be accepted before registration.

600.546

SENIOR THESIS IN COMPUTER INTEGRATED SURGERY   Taylor Prereq: 600.445 or Perm. Req=d. 

Sec. 01

600.601

COMPUTER SCIENCE SEMINAR Staff  Required for all full-time CS Graduate students

Sec. 01

ThF 10:30-12

600.643

ADVANCED TOPICS IN COMPUTER SECURITY Rubin    Limit 30  Prereq: any 400 level course in security, including 600.442/ 443/ 424 or Perm. Req=d  Topics vary but focus mainly on network perimeter protection, host-level protection, authentication technologies, intellectual property protection, formal analysis techniques, intrusion detection and similarly advanced topics. [Systems]

Sec. 01

ThF 2:30-3:45

600.726

SEMINAR IN PROGRAMMING LANGUAGES Smith   Perm.Req=d       This seminar course covers recent developments in the foundations of programming language design and implementation. Topics covered vary from year to year.

Sec. 01

W 11

600.757

SEMINAR IN COMPUTER GRAPHICS Cohen   Perm. Req’d     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.

Sec. 01

TBA

600.765

SEMINAR IN NATURAL LANGUAGE PROCESSING Eisner  S/U only Perm.Req=d A reading group exploring important current research in the field and potentially relevant material from related fields.

Sec. 01

Th 4

600.771

SEMINAR IN THEORY Scheideler Perm. Req=d   This seminar course reviews current research in theoretical computer science.

Sec. 01

W 4

600.801

DISSERTATION RESEARCH See 600.809 for faculty section numbers

600.803

GRADUATE RESEARCH Staff   Permission of faculty supervisor req=d.  Independent research for masters or pre-dissertation PhD students.    See 600.809 for faculty section numbers

600.809

INDEPENDENT STUDY
Sec. 01 Masson

Sec. 02  Kosarju

Sec. 03  Awerbuch

Sec. 04  Taylor

Sec. 05  Smith

Sec. 06  Goodrich

Sec. 07  Brill

Sec. 08  Salzberg

Sec. 09  Hager

Sec. 10 Wolff

Sec. 11  Kumar

Sec. 12  Amir

Sec. 13  Yarowsky

Sec. 14  Cohen

Sec. 15  Burns

Sec. 16  Eisner

Sec. 17  Shapiro

Sec. 18  Scheideler

Sec. 19  Stanton

Sec. 20  Anteniese

Sec. 21  Rubin

Sec. 22  Monrose

Sec. 23  Terzis

Sec. 24  Scheinerman

Sec. 25 Winslow