Fall 2008 Courses

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 3-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.

MW 3-4:15
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: Wed 6-9p
Sec 2: Thu 4:30-7:30p
Sec 3: Fri 3-6p
limit 12/section

600.120 (E)

INTERMEDIATE PROGRAMMING (4) Froehlich

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: AP CS, 600.107 or 600.226.

MWF 3
limit 20/section
Sec 1: Tu 3
Sec 2: Th 3

600.226 (E,Q)

DATA STRUCTURES (3) Houlahan

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: AP CS, 600.107, 600.109 or 600.120.

WF 12-1:15

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.

TuTh 1:30-2:45

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.

TuTh 3-4:15

600.320 (E)

PARALLEL PROGRAMMING (3) Burns

This course prepares the programmer to tackle the massive data sets and huge problem size of modern scientific and enterprise computing. Google and IBM have commented that undergraduate CS majors are unable to "break the single server mindset'' (http://www.google.com/intl/en/ press/pressrel/20071008_ibm_univ.html). Students taking this course will abandon the comfort of serial algorithmic thinking and learn to harness the power of cutting-edge software and hardware technologies. The issue of parallelism spans many architectural levels. Even ``single server'' systems must parallelize computation in order to exploit the inherent parallelism of recent multi-core processors. The course will examine different forms of parallelism in four sections. These are: (1) massive data-parallel computations with Hadoop!; (2) programming compute clusters with MPI; (3) thread-level parallelism in Java; and, (4) GPGPU parallel programming with NVIDIA's Cuda. Each section will be approximately 3 weeks and each section will involve a programming project. The course is also suitable for second-year undergraduate CS majors and undergraduate and graduate students from other science and engineering disciplines that have prior programming experience. [Systems]

Prereq: 600.120 or equiv. Students may receive credit for 600.320 or 600.420, but not both.

TuTh 12-1:15
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.

WF 1:30-2:45

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.

MWF 10
limit 80

600.361 (E,Q)

COMPUTER VISION (3) Hager

This course gives an overview of fundamental methods in computer vision from a computational perspective. Methods include computation of 3-D geometric constraints from binocular stereo, motion, texture, shape-from-shading, and photometric stereo. Edge detection and color perception are studied as well. Elements of machine vision and biological vision are also included. [Applications]

Prereq: 600.226

TuTh 3-4:15

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.

MW 12-1:15

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.

MWF 11
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.

TuTh 3-4:15

600.420 (E)

PARALLEL PROGRAMMING (3) Burns

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

Prereq: 600.120 or equiv.

TuTh 12-1:15
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.

WF 1:30-2:45

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.

MWF 10
limit 50

600.443 (E)

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.

MW 1:30-2: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.

TuTh 1:30-2:45

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.

TuTh 1:30-2:45
limit 40

600.451 (E)

PERFORMANCE OF COMPUTER-COMMUNICATION NETWORKS & PROTOCOLS (3) Mishra

This is an advanced course in networks and protocols that examines the performance evaluation, design, and management of networks, including wireless networks. This course may have additional newer topics such as network calculas and randomized algorithms as well other algorithms for networking. The course uses analytical and simulation methods to evaluate, design and manage networks and protocols. Topics include introduction to and application of queuing theory, queueing networks, introduction to and application of graph theory, optimization techniques for routing and flow control; intoduction to and application of simulation methods; performance of multiple access, TCP/IP, Wireless Cellular, Ad hoc and Sensor Networks; design of backbone and access networks. [Analysis]

Prerequisites: 600.344/444 & 550.310.

MW 1:30-2:45
limit 40

600.461 (E,Q)

COMPUTER VISION (3) Hager

Graduate version of 600.361. Students may receive credit for 600.361 or 600.461, but not both. [Applications]

Prereq: 600.226

TuTh 3-4:15

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.

MW 12-1:15

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.

MWF 3
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. [Analysis]

Prereq: 550.171 or equiv.

TuTh 1:30-2: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.

MWF 10

600.490 (E)

MODERN SOFTWARE DEVELOPMENT FOR SCIENTISTS & ENGINEERS (4) Froehlich

This course provides a broad survey of modern software development tools and methods for scientists and engineers working outside of computer science and computer engineering. Topics will include: programming style and documentation practices, software development processes, configuration management, object-oriented analysis and design, essential algorithms and data structures, software testing and quality assurance, performance analysis and tuning, automation of development activities, and a number of widely used libraries for scientific computation and visualization. Restrictions: graduate students only; not for CS or CE students.

Prereq: intro programming; recommended: data structures & familiarity with Unix.

Sec 1: MTWF 12-12:50
Sec 2: MWHF 12-12:50

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.

TuTh 10:30-12

600.625

COMPUTER AND NETWORK FORENSICS (3) Monrose

The course exposes students to a myriad of fundamental concepts and techniques for recovering and inferring information in computer systems and networks. topics include (but are not limited too) file system forensics, kernel-level rootkits and associated challenges, reconstructing malware evolution and dynamics, analysis of anonymization and privacy preserving techniques, advanced network traceback, traffic classification, biometrics and digital evidence, data integrity and audit trails, secure remote logging, and system call introspection.

A semester-long course project is required. Students will also be responsible for presenting and discussing selected research papers on topics pertinent to the course. Some familiarity with low-level system programming is assumed. [Applications]

Prerequisite: Exposure to operating systems concepts and low-level system programming is assumed, or instructor permission.

CANCELLED (was MW 1:30-2:45)
limit 10 ugrad, 15 grad

600.660

FFT IN GRAPHICS AND VISION Kazhdan

In this course, we will study the Fourier Transform from the perspective of representation theory. We will begin by considering the standard transform defined by the commutative group of rotations in 2D and translations in two- and three-dimensions, and will proceed to the Fourier Transform of the non-commutative group of 3D rotations. Subjects covered will include correlation of images, shape matching, computation of invariances, and symmetry detection. [Applications or Analysis]

Prereq: linear algebra and comfort with mathematical derivations.

MW 1:30-2:45

600.667

ADVANCED DISTRIBUTED SYSTEMS AND NETWORKS (3) Amir

This course is focused on the state of the art in distributed systems research, networks, and the Internet. The course is managed as a discussion group where the professor and students present recent research topics, as well as design and implement useful semester-long projects.

Prereq: 600.337/437 or permission of instructor.

MW 3-4:15
limit 20

600.681

ADVANCED TOPICS IN COMPUTER VISION (3) Vidal

TuTh 10:30-11:45

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 Kazanzides

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.

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 12

600.766

SEMINAR IN MACHINE TRANSLATION Callison-Burch

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 11

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.