COMPUTER SCIENCE

600.101

COMPUTER FLUENCY (4) Houlahan Limit 15 per section    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.
Sec. 04 canceled 9/12/07

Lec.
Sec. 01
02
03
04

MTW 11
W 4
Th 9
Th 3
F 10

600.102 (E)

CS FOUNDATIONS (4) Froehlich
Limit 15 per section  Prereq: 600.101 or equiv. knowledge     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. Course canceled 9/04/07

Lec.
Sec. 01 02

MTW 1
Th 10
F 9

600.105

M & Ms: FRESHMEN EXPERIENCE (1) Houlahan  Limit 20 Satisfactory/ Unsatisfactory only     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.

Sec. 01

Th 4

600.107 (E)

INTRODUCTION TO PROGRAMMING IN JAVA (3) Houlahan  Limit 120  Prereq: familiarity with computers   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.

Sec. 01

MTW 3

600.108 (E)

INTRODUCTORY PROGRAMMING LAB (1) Houlahan  Limit 15 per section Satisfactory/Unsatisfactory   Co-req: 600.107.  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.
Sec. 03 added 9/13/07

Sec. 01

02

03

W 6-9pm

Th 4-7pm

F 2:30-5:30pm

600.120 (E)

INTERMEDIATE PROGRAMMING (4) Amir   Limit 25 per section  Prereq: 600.107 or AP CS   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.

Lec.

Sec. 01

02

MTW 2

Th 12

F 1

600.226 (E,Q)

DATA STRUCTURES (3) Froehlich  Limit 40  Prereq: 600.107 or 600.109 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.

Sec. 01

ThF 2:30-3:45

600.271 (E,Q)

AUTOMATA & COMPUTATION THEORY (3) Kosaraju  Limit 60 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.

Sec. 01

MTW 1

600.315 (E)

DATABASE SYSTEMS (3) Yarowsky  Limit 40  Prereq: 600.226    Students receive credit for 600.315 or 600.415, but not both   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.

Sec. 01

ThF 2:30-3:45

600.319 (E)

STORAGE SYSTEMS (3) Burns  Limit 20   Prereq: 600.226 and 600.333/433 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 will 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]

Sec. 01

MTW 11

600.321 (E)

OBJECT ORIENTED SOFTWARE ENGINEERING (3) Smith   Limit 30   Prereq: 600.226 and 600.120      Students receive credit for 600.321 or 600.421, but not both   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.

Sec. 01

ThF 1-2:15

600.328 (E)

COMPILERS (3) Froehlich   Limit 30   Prereq: 600.120 and 600.226  Introduction to compiler design, including lexical analyis, 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. Course added 9/04/07

Sec. 01

MTW 1

600.333 (E)

COMPUTER SYSTEM FUNDAMENTALS (4) Masson  Limit 80 Prereq: 600.107    Students may receive credit for 600.333 or 600.433, but not both. 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.

Sec. 01

MTW 10

600.363 (E,Q)

INTRODUCTION TO ALGORITHMS (3) Awerbuch  Limit 30  Prereq: 600.226 Students may receive credit for 600.363 or 600.463, but not both.   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 sch 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.

Sec. 01

MTW 9

600.392 (E)

SENIOR DESIGN PROJECT (3) Froehlich  Limit 30 Prereq: 600.120, 600.226; 600.321 recommended. 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]

Sec. 01

MTW 4

600.415 (E)

DATABASE SYSTEMS (3) Yarowsky   Limit 30  Prereq: 600.226   Students may receive credit for 600.315 or 600.415, but not both. Graduate level version of 600.315
Cross-listed with Information Security Institute

Sec. 01

ThF 2:30-3:45

600.419 (E)

STORAGE SYSTEMS (3) Burns  Limit 20 Prereq: 600.226 and 600.333/433  Students may receive credit for 600.314 or 600.419, but not both. Graduate level version of 600.319
Cross-listed with Information Security Institute

Sec. 01

MTW 11

600.421 (E)

OBJECT ORIENTED SOFTWARE ENGINEERING (3) Smith   Limit 30   Prereq: 600.226 and 600.120 Students may receive credit for 600.321 or 600.421, but not both. Graduate level version of 600.321.
Cross-listed with Information Security Institute

Sec. 01

ThF 1-2:15

600.424 (E)

NETWORK SECURITY (3) Monrose   Limit 30  Prereq: 600.120, 600.349/449, 600.344/444, and 600.226   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 techniques.
Cross-listed with Information Security Institute

Sec. 01

MW 2-3:15

600.428 (E)

COMPILERS (3) Froehlich  Prereq: 600.120 & 600.226 Graduate version of 600.328. Students may NOT receive credit for 600.328 and 600.428. Course added 9/12/07

Sec. 01

MTW 1

600.433 (E)

COMPUTER SYSTEMS (4) Masson  Limit 50  Students may receive credit for 600.333 or 600.433, but not both.  Graduate version of 600.333.
Cross-listed with Information Security Institute

Sec. 01

MTW 10

600.439 (E)

MICROKERNEL ARCHITECTURE (3) Shapiro  Limit 25 20  Prereq: C and UNIX, 600.333/433, and 600.318/418  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 fro 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]

Sec. 01

T 2-5pm

600.442 (E,Q)

CRYPTOGRAPHY AND NETWORK SECURITY (3) Ateniese   Limit 40   Prereq: 600.226, 600.271, 550.171, and systems course.  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.443 (E)

SECURITY AND PRIVACY (3) Rubin   Limit 50 Prereq: Basic course in operating systems & networks or Perm. Req’d Lecture topics will include computer security, network security, basic cryptography, system design methodology, and privacy. There will be a heavy workload, 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] (was Systems previously)
Cross-listed with Information Security Institute   Course added 9/10/07

Sec. 01

ThF 2:30-3:45

600.445 (E)

COMPUTER - INTEGRATED SURGERY I (4) Taylor   Limit 40     Prereq: 600.120, 600.226 and linear algebra. Recmd: 600.457, 600.461, image processing 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.

Sec. 01

ThF 1-2:15

600.450 (E)

NETWORK EMBEDDED SYSTEMS AND SENSOR NETWORKS (3) Terzis Limit 40   Prereq: 600.226, 600.120, and 600.344/444  (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.

Sec. 01

ThF 2:30-3:45

600.463 (E,Q)

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

Sec. 01

MTW 9

600.465 (E)

NATURAL LANGUAGE PROCESSING (3) Eisner Limit 60   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. There are a number of structured but challenging programming assignments.

Sec. 01

MTW 2

600.471 (E,Q)

THEORY OF COMPUTATION (3) Hohenberger  Limit 40   Prereq: 600.271 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. [Analysis]

Sec. 01

MW 3:30-4:45pm

600.475 (E)

MACHINE LEARNING (3) Sheppard
Limit 20Prereq: 600.335/435 or permission of instructor     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]

Sec. 01

MTW 9

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
01 – Masson
02 – Kosaraju
03 – Awerbuch
04 – Taylor
05 – Smith
06 – Houlahan
07 – Lehmann
08 – Sheppard
09 – Hager
10 – Chirikjian
11 – Khudanpur
12 – Amir
13 – Yarowsky
14 – Cowan
15 – Burns
16 – Eisner
17 – Shapiro
18 – Hohenberger
19 – Stanton
20 – Ateniese
21 – Rubin
22 – Monrose
23 – Terzis
24 – Scheinerman
25 – Winslow
26 – Kazhdan
27 – Jelinek
28 – Froehlich
29 – Szalay
30 – Kazanzides

600.501

INDEPENDENT STUDY (FRESHMEN, SOPHOMORES)   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 600.491 for faculty section numbers

600.507

INDEPENDENT RESEARCH
Individual 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 600.491 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. 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 - See 600.491 for faculty section numbers 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 publicly 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.

600.546 (E)

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

600.601

COMPUTER SCIENCE SEMINAR Eisner/Thornton Limit 150  Required for all full-time CS Graduate students 

Sec. 01

ThF 10:30-12

600.643

ADVANCED TOPICS IN COMPUTER SECURITY Rubin  Limit 20  Prereq: Any 400-level course in Security 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] Cross-listed with Information Security Institute Course canceled 9/10/07

Sec. 01

ThF 2:30-3:45

600.657

ADVANCED TOPICS FOR COMPUTER GRAPHICS Kazhdan  Limit 20   Prereq: 600.457 and linear algebra or Perm. Req’d Advanced methodologies and their applications to computer graphics. Topics vary by semester. Fall 2007: The Poisson Equation in Image and Shape Processing. Course added 9/06/07

Sec. 01

MW 2-3:15

600.658

SHAPE ANALYSIS AND RETRIEVAL Kazhdan  Limit 20   Prereq: 600.357/457 and linear algebra or Perm. Req’dThis 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] Course canceled 9/06/07

Sec. 01

MW 2-3:15

600.726

SEMINAR IN PROGRAMMINGLANGUAGES 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. Students will present papers orally.

Sec. 01

W 11

600.735

SEMINAR IN MACHINE LEARNING Sheppard Limt 30  

Sec. 01

Th 9

600.745

SEMINAR IN COMPUTER INTEGRATED SURGERY   Kazanzides Fichtinger Limit 20   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.

Sec. 01

W 12-1:30

600.757

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

Sec. 01

TBA

600.765

SEMINAR IN NATURAL LANGUAGE PROCESSING Eisner   Limit 20  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

Th 4

600.766

SEMINAR IN MACHINE TRANSLATION CallisonBurch/Hall  Limit 20  Perm Req'd. Weekly machine translation reading group will review current research in statistical machine translation, as well as relevant historical papers. Course added 9/04/07

Sec. 01

F 2:30

600.801

DISSERTATION RESEARCH
See 600.809 for faculty section numbers

600.803

GRADUATE RESEARCH 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 (graduate students)   Permission required
01 - Masson
02 - Kosaraju
03 - Awerbuch
04 - Taylor
05 - Smith
06 - Houlahan
07 - Lehmann
08 - Sheppard
09 - Hager
10 - Chirikjian
11 - Khudanpur
12 - Amir
13 - Yarowsky
14 - Cowan
15 - Burns
16 - Eisner
17 - Shapiro
18 - Hohenberger
19 - Stanton
20 - Ateniese
21 - Rubin
22 - Monrose
23 - Terzis
24 - Scheinerman
25 - Winslow
26 - Kazhdan
27 - Jelinek
28 - Froehlich
29 – Szalay
30 - Kazanzides