COMS W1001x and y Introduction to Information Sciences Lect: 3.3pts.

Basic Introduction to concepts and skills in Information Sciences: human-computer interfaces, representing information digitally, organizing and searching information on the World Wide Web, principles of algorithmic problem solving, introduction to database concepts, introduction to programming in Python.

Course Number	Call Number/ Section	Days & Times/ Location	Instructor	Enrollment
Autumn 2008 :: COMS W1001
COMS 1001	97204 001	MW 2:40p - 3:55p 834 Seeley W. Mudd Building	A. Cannon	30 / 70

COMS W1003x or y Introduction To Computer Science and Programming In C Lect: 3. 3 pts. A general introduction to computer science concepts, algorithmic problem-solving capabilities, and programming skills in C. Columbia University students may receive credit for only one of the following three courses: 1003, 1004, and 1005.

Course Number	Call Number/ Section	Days & Times/ Location	Instructor	Enrollment
Autumn 2008 :: COMS W1003
COMS 1003	80536 001	TuTh 1:10p - 2:25p 834 Seeley W. Mudd Building	B. Huang	34

COMS W1004x and y Introduction To Computer Science and Programming In Java Lect: 3. 3 pts. A general introduction to computer science for science and engineering students interested in majoring in computer science or engineering. Covers fundamental concepts of computer science, algorithmic problem-solving capabilities, and introductory Java programming skills. Assumes no prior programming background. Columbia University students may receive credit for only one of the following three courses: 1003, 1004, and 1005.

Course Number	Call Number/ Section	Days & Times/ Location	Instructor	Enrollment
Autumn 2008 :: COMS W1004
COMS 1004	80954 001	MW 4:10p - 5:25p 301 Pupin Laboratories	A. Cannon	183

COMS W1005x or y Introduction to Computer Science and Programming in MATLAB 3 pts. Prerequisites: None Corequisites: None A general introduction to computer science concepts, algorithmic problem-solving capabilities, and programming skills in MATLAB. Assumes no prior programming background. Columbia University students may receive credit for only one of the following three courses: 1003, 1004, and 1005.

Course Number	Call Number/ Section	Days & Times/ Location	Instructor	Enrollment
Autumn 2008 :: COMS W1005
COMS 1005	99693 001	TuTh 1:10p - 2:25p 717 Hamilton Hall	P. Blaer	61
COMS 1005	50906 002	TuTh 1:10p - 2:25p 486 Computer Science Bldg	I. Pe'er	2

COMS W1007x or y Object-oriented programming and design in Java Lect: 3. 3 pts. Prerequisites: COMS W1004 or AP Computer Science with a grade of 4 or 5. The second course for majors in computer science. A rigorous treatment of object-oriented concepts using Java as an example language. Development of sound programming and design skills, problem solving and modeling of real world problems from science, engineering, and economics using the object-oriented paradigm.

Course Number	Call Number/ Section	Days & Times/ Location	Instructor	Enrollment
Autumn 2008 :: COMS W1007
COMS 1007	12783 001	TuTh 1:10p - 2:25p 627 Seeley W. Mudd Building	J. Kender	54

COMS W1009x Honors Introduction To Computer Science Lect: 3. 3 pts.Not offered in 2008-2009. Prerequisites: COMS W1004 or AP Computer Science with a grade of 4 or 5. An honors-level introduction to computer science, intended primarily for students considering a major in computer science. Computer science as a science of abstraction. Creating models for reasoning about and solving problems. The basic elements of computers and computer programs. Implementing abstractions using data structures and algorithms. Taught in Java.

ECBM E3060x Introduction To Genomic Information Science and Technology Lect: 3 pts Introduction to the information system paradigm of molecular biology. Representation, organization, structure, function and manipulation of the biomolecular sequences of nucleic acids and proteins. The role of enzymes and gene regulatory elements in natural biological functions as well as in biotechnology and genetic engineering. Recombination and other macromolecular processes viewed as mathematical operations with simulation and visualization using simple computer programming. This course shares lectures with ECBM E4060, but the work requirements differ somewhat.

Course Number	Call Number/ Section	Days & Times/ Location	Instructor	Enrollment
Autumn 2008 :: ECBM E3060
ECBM 3060	71648 001	M 6:50p - 9:20p 535 Seeley W. Mudd Building	D. Anastassiou	3

COMS W3101x and y Programming Languages Lect: 1. 1pts. Prerequisites: Fluency in at least one programming language. Introduction to a programming language. Each section is devoted to a specific language. Intended only for those who are already fluent in at least one programming language. Sections may meet for one hour per week for the whole term, for three hours per week for the first third of the term, or for two hours per week for the first six weeks. May be repeated for credit if different languages are involved.

COMS W3133x or y Data Structures In C Lect: 3. 3 pts. Prerequisites: COMS W1003 or knowledge of C. Not intended for computer science majors. Data types and structures: arrays, stacks, singly and doubly linked lists, queues, trees, sets, and graphs. Programming techniques for processing such structures: sorting and searching, hashing, garbage collection. Storage management. Rudiments of the analysis of algorithms. Taught in C. Note: Due to significant overlap, students may receive credit for only one of the following four courses: COMS W3133, W3134, W3137, and W3139.

COMS W3134x or y Data Structures In Java Lect: 3. 3 pts. Prerequisites: COMS W1004 or knowldege of Java. Not intended for computer science majors. Data types and structures: arrays, stacks, singly and doubly linked lists, queues, trees, sets, and graphs. Programming techniques for processing such structures: sorting and searching, hashing, garbage collection. Storage management. Rudiments of the analysis of algorithms. Taught in Java. Note: Due to significant overlap, students may receive credit for only one of the following four courses: COMS W3133, W3134, W3137, and W3139.

Course Number	Call Number/ Section	Days & Times/ Location	Instructor	Enrollment
Autumn 2008 :: COMS W3134
COMS 3134	11051 001	TuTh 5:40p - 6:55p 833 Seeley W. Mudd Building	D. Elson	72

COMS W3137x and y Data Structures and Algorithms Lect: 3. 4 pts. Prerequisites: COMS W1007. Corequisites: COMS W3203. Data types and structures: arrays, stacks singly and doubly linked lists, queues, trees, sets, and graphs. Programming techniques for processing such structures: sorting and searching, hashing, garbage collection. Storage management. Design and analysis of algorithms. Taught in Java. Note: Due to significant overlap, students may receive credit for only one of the following four courses: COMS W3133, W3134, W3137, and W3139.

Course Number	Call Number/ Section	Days & Times/ Location	Instructor	Enrollment
Autumn 2008 :: COMS W3137
COMS 3137	11752 001	MW 2:40p - 3:55p 825 Seeley W. Mudd Building	P. Allen	34 / 65

COMS W3139y Honors Data Structures and Algorithms Lect: 4. 4 pts.Not offered in 2008-2009. Prerequisites: COMS W3157 Corequisites: COMS W3203. An honors introduction to data types and structures: arrays, stacks, singly and doubly linked lists, queues, trees, sets, and graphs. Programming techniques for processing such structures: sorting and searching, hashing, garbage collection. Storage management. Design and analysis of algorithms. Taught in C/C++. Note: Due to significant overlap, students may receive credit for only one of the following four courses: COMS W3133, W3134, W3137, and W3139.

COMS W3157x or y Advanced Programming Lect:4. 4 pts. Prerequisites: COMS W1007 or COMS W1009 Practical, hands-on introduction to programming techniques and tools for professional software construction, including learning how to write code to given specifications as well as document the results. Provides introductory overview of C and C++ in a UNIX environment, for students with Java background. Also introduces scripting languages (perl) and basic web programming. UNIX programming utilities are also covered. Lab Required.

Course Number	Call Number/ Section	Days & Times/ Location	Instructor	Enrollment
Autumn 2008 :: COMS W3157
COMS 3157	13052 001	MW 4:10p - 5:25p 415 Schapiro Cepser	J. Lee	45 / 150

COMS W3203x or y Discrete Mathematics: Introduction To Combinatorics and Graph Theory Lect: 3. 3 pts. Prerequisites: Any introductory course in computer programming. Logic and formal proofs, sequences and summation, mathematical induction, binomial coefficients, elements of finite probability, recurrence relations, equivalence relations and partial orderings, and topics in graph theory (including isomorphism, traversability, planarity, and colorings).

Course Number	Call Number/ Section	Days & Times/ Location	Instructor	Enrollment
Autumn 2008 :: COMS W3203
COMS 3203	13700 001	MW 1:10p - 2:25p 833 Seeley W. Mudd Building	J. Gross	66

COMS W3210y Scientific Computation Lect: 3. 3 pts. Prerequisites: Two terms of calculus. Introduction to computation on digital computers. Design and analysis of numerical algorithms. Numerical solution of equations, integration, recurrences, chaos, differential equations. Introduction to Monte Carlo methods. Properties of floating point arithmetic. Applications to weather prediction, computational finance, computational science, and computational engineering.

COMS W3251x Computational Linear Algebra Lect: 3. 3 pts. Prerequisites: two terms of calculus. Computational linear algebra, solution of linear systems, sparse linear systems, least squares, eigenvalue problems, and numerical solution of other multivariate problems as time permits.

Course Number	Call Number/ Section	Days & Times/ Location	Instructor	Enrollment
Autumn 2008 :: COMS W3251
COMS 3251	16403 001	MW 11:00a - 12:15p 415 Schapiro Cepser	A. Papageorgiou	26

COMS W3261x or y Computer Science Theory Lect 3. 3 pts. Prerequisites: COMS W3139 and W3203. Regular languages: deterministic and non-deterministic finite automata, regular expressions. Context-free languages: context-free grammars, push-down automata. Turing machines, the Chomsky hierarchy, and the Church-Turing thesis. Introduction to Complexity Theory and NP-Completeness.

Course Number	Call Number/ Section	Days & Times/ Location	Instructor	Enrollment
Autumn 2008 :: COMS W3261
COMS 3261	17601 001	MW 1:10p - 2:25p 825 Seeley W. Mudd Building	A. Aho	27

CSEE W3827x and y Fundamentals of Computer Systems Lect: 3. 3 pts Prerequisites: An introductory programming course. Fundamentals of computer organization and digital logic. Boolean algebra, Karnaugh maps, basic gates and components, flipflops and latches, counters and state machines, basics of combinational and sequential digital design. Assembly language, instruction sets, ALU's, single-cycle and multi-cycle processor design, introduction to pipelined processors, caches, and virtual memory.

Course Number	Call Number/ Section	Days & Times/ Location	Instructor	Enrollment
Autumn 2008 :: CSEE W3827
CSEE 3827	22152 001	MW 2:40p - 3:55p 627 Seeley W. Mudd Building	D. Rubenstein	24

COMS W3902x or y Undergraduate Thesis 1-6 pts. Prerequisites: Agreement by a faculty member to serve as thesis adviser. An independent theoretical or experimental investigation by an undergraduate major of an appropriate problem in computer science carried out under the supervision of a faculty member. A formal written report is mandatory and an oral presentation may also be required. May be taken over more than one term, in which case the grade is deferred until all 6 points have been completed. Consult the department for section assignment.

Course Number	Call Number/ Section	Days & Times/ Location	Instructor	Enrollment
Autumn 2008 :: COMS W3902
COMS 3902	75533 001	TBA	Instructor To Be Announced	0 / 0

COMS W3995x or y Special Topics In Computer Science Lect: 3. 3 pts. Prerequisites: the instructor's permission. Consult the department for section assignment. Special topics arranged as the need and availability arise. Topics are usually offered on a one-time basis. Since the content of this course changes each time it is offered, it may be repeated for credit.

COMS W3998x or y Undergraduate Projects In Computer Science 1-3 pts. Prerequisites: approval by a faculty member who agrees to supervise the work. Independent project involving laboratory work, computer programming, analytical investigation, or engineering design. May be repeated for credit, but not for a total of more than 3 points of degree credit. Consult the department for section assignment.

Course Number	Call Number/ Section	Days & Times/ Location	Instructor	Enrollment
Autumn 2008 :: COMS W3998
COMS 3998	13447 001	TBA	Instructor To Be Announced	0 / 0

ECBM E4060x Introduction To Genomic Information Lecture: 3. 3 pts. Introduction to the information system paradigm of molecular biology. Representation, organization, structure, function, and manipulation of the biomolecular sequences of nucleic acids and proteins. The role of enzymes and gene regulatory elements in natural biological functions as well as in biotechnology and genetic engineering. Recombination and other macromolecular processes viewed as mathematical operations with simulation and visualization using simple computer programming. This course shares lectures with ECBM E3060, but the work requirements differ somewhat.

Course Number	Call Number/ Section	Days & Times/ Location	Instructor	Enrollment
Autumn 2008 :: ECBM E4060
ECBM 4060	91096 001	M 6:50p - 9:20p 535 Seeley W. Mudd Building	D. Anastassiou	12

COMS W4101x or y Topics in Computer Science Technology 1.5 pts.Not offered in 2008-2009. Prerequisites: Fluency in at least one programming language and familiarity with computer systems. Introduction to current topics in computer science technology. Each section will be devoted to a specific technology. Sections may meet for 1.5 hours per week for the whole term or 3 hours per week for a half term. May be repeated for credit if different technologies are involved.

COMS W4111x and y Introduction to Databases Lect: 3. 3 pts. Prerequisites: COMS W3137 or W3134, fluency in Java; or permission of the instructor. The fundamentals of database design and application development using databases: entity-relationship modeling, logical design of relational databases, relational data definition and manipulation languages, SQL, XML, query processing, physical database tuning, transaction processing, security. Programming projects are required.

Course Number	Call Number/ Section	Days & Times/ Location	Instructor	Enrollment
Autumn 2008 :: COMS W4111
COMS 4111	23299 001	TuTh 1:10p - 2:25p 535 Seeley W. Mudd Building	L. Gravano	71

COMS W4112y Database System Implementation 3 pts. Prerequisites: COMS W4111; fluency in Java or C++. COMS W3827 is recommended. The principles and practice of building large-scale database management systems. Storage methods and indexing, query processing and optimization, materialized views, transaction processing and recovery, object-relational databases, parallel and distributed databases, performance considerations. Programming projects are required.

COMS W4115x and y Programming Languages and Translators Lect: 3. 3 pts. Prerequisites: COMS W3137 or equivalent, W3261, and CSEE W3827, or the instructor's permission. Modern programming languages and compiler design. Imperative, object-oriented, declarative, functional, and scripting languages. Language syntax, control structures, data types, procedures and parameters, binding, scope, run-time organization, and exception handling. Implementation of language translation tools including compilers and interpreters. Lexical, syntactic and semantic analysis; code generation; introduction to code optimization. Teams implement a language and its compiler.

Course Number	Call Number/ Section	Days & Times/ Location	Instructor	Enrollment
Autumn 2008 :: COMS W4115
COMS 4115	26049 001	MW 1:10p - 2:25p 535 Seeley W. Mudd Building	S. Edwards	69

COMS W4117x or y Compilers and Interpreters Lect: 3. 3 pts. Prerequisites: COMS W4115 or the instructor's permission. Continuation of COMS W4115, with broader and deeper investigation into the design and implementation of contemporary language translators, be they compilers or interpreters. Topics include: parsing, semantic analysis, code generation and optimization, run-time environments, and compiler-compilers. A programming project is required.

COMS W4118x and y Operating Systems, I Lect: 3. 3 pts. Prerequisites: CSEE W3827 and knowledge of C and programming tools as covered in W3157 or W3101, or the instructor's permission. Design and implementation of operating systems. Topics include process management, process synchronization and interprocess communication, memory management, virtual memory, interrupt handling, processor scheduling, device management, I/O, and file systems. Case study of the UNIX operating system. A programming project is required.

Course Number	Call Number/ Section	Days & Times/ Location	Instructor	Enrollment
Autumn 2008 :: COMS W4118
COMS 4118	27103 001	MW 2:40p - 3:55p 535 Seeley W. Mudd Building	J. Nieh	67 / 85

CSEE W4119x and y Computer Networks 3 pts. Lect. 3 Corequisites: SIEO W3658 or E3600 or equivalent Introduction to computer networks and the technical foundations of the Internet, including applications, protocols, local area networks, algorithms for routing and congestion control, security, elementary performance evaluation. Several written and programming assignments required.

Course Number	Call Number/ Section	Days & Times/ Location	Instructor	Enrollment
Autumn 2008 :: CSEE W4119
CSEE 4119	92449 001	MW 11:00a - 12:15p TBA	G. Zussman	34

CSEE W4140x or y Networking Laboratory 4 pts. Lect 3 Prerequisites: CSEE 4119 or equivalent In this course, students will learn how to put "principles into practice," in a hands-on-networking lab course. The course will cover the technologies and proctocols of the internet using equipment currently available to large internet service providers such as CISCO routers and end-systems. A set of laboratory experiments will provide hands-on experience with engineering wide-area networks and will familiarize students with the Internet Protocol (IP), Address Resolution Protocal (ARP), Internet Control Message Protocol (ICMP), User Datagram Protocol (UDP) and Transmission Control Protocol (TCP), the Domain Name System (DNS), routing protocols (RIP, OSPF, BGP), network management protocols (SNMP, and application-level protocols (FTP, TELNET, SMTP).

COMS W4156x or y Advanced Software Engineering Lect: 3. 3 pts. Prerequisites: Any one or more of COMS W4111, COMS W4115, COMS W4118, or COMS W4444.

Assumes substantial prior software development experience in one or more of C++, Java or C#, as well as basic familiarity with using SQL. Focuses primarily on component model frameworks (EJB, .NET/COM+, Web Services) and quality assurance (code inspection, unit and integration testing, stress testing). Introduction to UML. Surveys other software lifecycle topics as time permits. Centers on an intense semester-long multi-iteration team project building an N-tier application.

Course Number	Call Number/ Section	Days & Times/ Location	Instructor	Enrollment
Autumn 2008 :: COMS W4156
COMS 4156	22205 001	TuTh 11:00a - 12:15p 327 Seeley W. Mudd Building	G. Kaiser	47

COMS W4160y Computer Graphics Lect: 3. 3 pts. Prerequisites: COMS 3137 or 3139, 4156 is recommended. Strong programming background and some mathematical familiarity including linear algebra is required. Introduction to computer graphics. Topics include 3D viewing and projections, geometric modeling using spline curves, graphics systems such as OpenGL, lighting and shading, and global illumination. Significant implementation is required: the final project involves writing an interactive 3D video game in OpenGL.

Course Number	Call Number/ Section	Days & Times/ Location	Instructor	Enrollment
Autumn 2008 :: COMS W4160
COMS 4160	59035 001	M 1:10p - 3:40p 633 Seeley W. Mudd Building	R. Ramamoorthi	20

COMS W4162x or y Advanced Computer Graphics Lect: 3. 3pts Prerequisites: COMS 4160 or equivalent, or instructor's permission. A second course in computer graphics covering more advanced topics including image and signal processing, geometric modeling with meshes, advanced image synthesis including ray tracing and global illumination, and other topics as time permits. Emphasis will be placed both on implementation of systems and important mathematical and geometric concepts such as Fourier analysis, mesh algorithms and subdivision, and Monte Carlo sampling for rendering. Note: Course will be taught every two years.

COMS W4165x Computational Techniques In Pixel Processing Lect: 3. 3 pts.Not offered in 2008-2009. Prerequisites: COMS W3137, W3251 (recommended), and a good working knowledge of UNIX and C. Intended for graduates and advanced undergraduates. An intensive introduction to image processing--digital filtering theory, image enhancement, image reconstruction, antialiasing, warping, and the state-of-the-art in special effects. Topics form the basis of high-quality rendering in computer graphics and of low-level processing for computer vision, remote sensing, and medical imaging. Emphasizes computational techniques for implementing useful image-processing functions.

COMS W4167x or y Computer Animation Lect: 3.3pts. Prerequisites: COMS W3137 or W3139, and W4156 is recommended. Previous familiarity with C is recommended. Intensive introduction to computer animation, including: fundamental theory and algorithms for computer animation, keyframing, kinematic rigging, simulation, dynamics, free-form animation, behavioral/procedural animation, particle systems, post-production; small groups implement a significant animation project; advanced topics as time permits.

COMS W4170x User Interface Design Lect: 3. 3 pts. Prerequisites: COMS W3137. Introduction to the theory and practice of computer user interface design, emphasizing the software design of graphical user interfaces. Topics include basic interaction devices and techniques, human factors, interaction styles, dialogue design, and software infrastructure. Design and programming projects are required.

Course Number	Call Number/ Section	Days & Times/ Location	Instructor	Enrollment
Autumn 2008 :: COMS W4170
COMS 4170	43457 001	TuTh 1:10p - 2:25p 633 Seeley W. Mudd Building	S. Feiner	40

COMS W4172x or y 3D User Interfaces Lect: 3. 3 pts. Prerequisites: COMS W4160 or COMS W4170 or the instructor's permission. Design, development, and evaluation of 3D user interfaces. Interaction techniques and metaphors, from desktop to immersive. Selection and manipulation. Travel and navigation. Symbolic, menu, gestural, and multimodal interaction. Dialogue design. 3D software support. 3D interaction devices and displays. Virtual and augmented reality. Tangible user interfaces. Review of relevant 3D math.

COMS W4180x or y Network Security Lect: 3. 3 pts. Prerequisites: COMS W3137 or W3139, and W4119, or the instructor's permission. Introduction to network security concepts and mechanisms. Foundations of network security and an in-depth review of commonly-used security mechanisms and techniques, security threats and network-based attacks, applications of cryptography, authentication, access control, intrusion detection and response, security protocols (IPsec, SSL, Kerberos), denial of service, viruses and worms, software vulnerabilities, web security, wireless security, and privacy.

COMS W4187x or y Security Architecture and Engineering 3 pts. Prerequisites: COMS W4118; W4180 and/or W4119 recommended. Secure programming. Cryptograhic engineering and key handling. Access controls. Tradeoffs in security design. Design for security.

Course Number	Call Number/ Section	Days & Times/ Location	Instructor	Enrollment
Autumn 2008 :: COMS W4187
COMS 4187	46600 001	TuTh 2:40p - 3:55p 545 Seeley W. Mudd Building	S. Bellovin	15

COMS W4203y Graph Theory Lect: 3. 3 pts.Not offered in 2008-2009. Prerequisites: COMS W3203 General introduction to graph theory. Isomorphism testing, algebraic specification, symmetries, spanning trees, traversability, planarity, drawings on higher-order surfaces, colorings, extremal graphs, random graphs, graphical measurement, directed graphs, Burnside-Polya counting, voltage graph theory.

Course Number	Call Number/ Section	Days & Times/ Location	Instructor	Enrollment
Autumn 2008 :: COMS W4203
COMS 4203	47255 001	MW 4:10p - 5:25p 337 Seeley W. Mudd Building	J. Gross	23

COMS W4205x Combinatorial Theory Lect: 3. 3 pts. Prerequisites: COMS W3203 and a course in calculus. Sequences and recursions, calculus of finite differences and sums, elementary number theory, permutation group structures, binomial coefficients, Stilling numbers, harmonic numbers, generating functions.

COMS W4231x Analysis of Algorithms, I Lect: 3.3pts. Prerequisites: COMS W3137 or W3139, and W3203. Introduction to the design and analysis of efficient algorithms. Topics include models of computation, efficient sorting and searching, algorithms for algebraic problems, graph algorithms, dynamic programming, probabilistic methods, approximation algorithms, and NP-completeness. Note: This course is same as CSOR W4231 (CS and IEOR Department).

Course Number	Call Number/ Section	Days & Times/ Location	Instructor	Enrollment
Autumn 2008 :: COMS W4231
COMS 4231	50805 001	TuTh 4:10p - 5:25p 633 Seeley W. Mudd Building	M. Yannakakis	100

COMS W4236y Introduction To Computational Complexity Lect: 3. 3 pts. Prerequisites: COMS W3261. Develops a quantitative theory of the computational difficulty of problems in terms of the resources (eg. time, space) needed to solve them. Classification of problems into complexity classes, reductions and completeness. Power and limitations of different modes of computation such as nondeterminism, randomization, interaction and parallelism.

COMS W4241y Numerical Algorithms and Complexity Lect: 3. 3 pts. Prerequisites: Knowledge of a programming language. Some knowledge of scientific computation is desirable. Modern theory and practice of computation on digital computers. Introduction to concepts of computational complexity. Design and analysis of numerical algorithms. Applications to computational finance, computational science, and computational engineering.

COMS W4252x or y Introduction To Computational Learning Theory lect: 3. 3pts Prerequisites: COMS W4231 or COMS W4236 or (COMS W3203 and permission of instructor) or (COMS W3261 and permission of instructor). Possibilities and limitations of performing learning by computational agents. Topics include computational models of learning, polynomial time learnability, learning from examples and learning from queries to oracles. Computational and statistical limitations of learning. Applications to Boolean functions, geometric functions, automata.

Course Number	Call Number/ Section	Days & Times/ Location	Instructor	Enrollment
Autumn 2008 :: COMS W4252
COMS 4252	53400 001	TuTh 11:00a - 12:15p 1127 Seeley W. Mudd Building	R. Servedio	35

COMS W4261x or y Introduction To Cryptography Lect: 2.5. 3 pts. Prerequisites: Comfort with basic discrete math and probability. Recommended: COMS W3261 or COMS W4231. An introduction to modern cryptography, focusing on the complexity-theoretic foundations of secure computation and communication in adversarial environments; a rigorous approach, based on precise definitions and provably secure protocols. Topics include private and public key encryption schemes, digital signatures, authentication, pseudorandom generators and functions, one-way functions, trapdoor functions, number theory and computational hardness, identification and zero knowledge protocols.

COMS W4281x or y Introduction to Quantum Computing Lect: 3. 3 pts Prerequisites: Knowledge of linear algebra. Prior knowledge of quantum mechanics is not required although helpful. Introduction to quantum computing. Shor's factoring algorithm, Grover's database search algorithm, the quantum summation algorithm. Relationship between classical and quantum computing. Potential power of quantum computers.

CSEE W4340x Computer Hardware Design Lect: 2. 3 ptsNot offered in 2008-2009. Prerequisites: ELEN E3331 plus ELEN E3910 or CSEE W3827. Practical aspects of computer hardware design through the implementation, simulation, and prototyping of a PDP-8 processor. High-level and assembly languages, I/O, interrupts, datapath and control design, piplelining, busses, memory architecture. Programmable logic and hardware prototyping with FPGAs. Fundamentals of VHDL for register-transfer level design. Testing and validation of hardware. Hands-on use of industry CAD tools for simulation and synthesis. Lab required.

COMS W4444x Programming and Problem Solving Lect: 3. 3 pts. Prerequisites: COMS W3139 and W3824. Hands-on introduction to solving open-ended computational problems. Emphasis on creativity, cooperation, and collaboration. Projects spanning a variety of areas within computer science, typically requiring the development of computer programs. Generalization of solutions to broader problems, and specialization of complex problems to make them manageable. Team-oriented projects, student presentations, and in-class participation required.

Course Number	Call Number/ Section	Days & Times/ Location	Instructor	Enrollment
Autumn 2008 :: COMS W4444
COMS 4444	57502 001	MW 1:10p - 2:25p 415 Schapiro Cepser	K. Ross	8

COMS W4560x Introduction to Computer Applications in Health Care and Biomedicine 3 pts. Prerequisites: Experience with computers and a passing familiarity with medicine and biology. Undergraduates in their senior or junior years may take this course only if they have adequate backgroud in mathematics and receive permission from the instructor An overview of the field of biomedical informatics, combining perspectives from medicine, computer science and social science. Use of computers and information in health care and the biomedical sciences, covering specific applications and general methods, current issues, capabilities and limitations of biomedical informatics. Biomedical Informatics studies the organization of medical information, the effective management of information using computer technology, and the impact of such technology on medical research, education, and patient care. The field explores techniques for assessing current information practices, determining the information needs of health care providers and patients, developing interventions using computer technology, and evaluating the impact of those interventions.

Course Number	Call Number/ Section	Days & Times/ Location	Instructor	Enrollment
Autumn 2008 :: COMS W4560
COMS 4560	53051 001	MW 4:10p - 5:25p 327 Seeley W. Mudd Building	M. Chiang	4

COMS W4701x or y Artificial Intelligence Lect: 3. 3 pts. Prerequisites: COMS W3139. Provides a broad understanding of the basic techniques for building intelligent computer systems. Topics include state-space problem representations, problem reduction and and-or graphs, game playing and heuristic search, predicate calculus, and resolution theorem proving, AI systems and languages for knowledge representation, machine learning and concept formation and other topics such as natural language processing may be included as time permits.

Course Number	Call Number/ Section	Days & Times/ Location	Instructor	Enrollment
Autumn 2008 :: COMS W4701
COMS 4701	58354 001	MW 6:10p - 7:25p 702 Hamilton Hall	A. Pasik	64 / 88

COMS W4705x Natural Language Processing Lect: 3. 3 pts. Prerequisites: COMS W3133, or W3134, or W3137, or W3139, or the instructor's permission. Computational approaches to natural language generation and understanding. Recommended preparation: some previous or concurrent exposure to AI or Machine Learning. Topics include information extraction, summarization, machine translation, dialogue systems, and emotional speech. Particular attention is given to robust techniques that can handle understanding and generation for the large amounts of text on the Web or in other large corpora. Programming exercises in several of these areas.

Course Number	Call Number/ Section	Days & Times/ Location	Instructor	Enrollment
Autumn 2008 :: COMS W4705
COMS 4705	61552 001	TuTh 2:40p - 3:55p 1024 Seeley W. Mudd Building	K. McKeown	25

COMS W4706y Spoken Language Processing Lect: 3. 3 pts.Not offered in 2008-2009. Prerequisites: Prerequisites: COMS W3133, or W3134, or W3137, or W3139, or the instructor's permission. Computational approaches to speech generation and understanding. Topics include speech recognition and understanding, speech analysis for computational linguistics research, and speech synthesis. Speech applications including dialogue systems, data mining, summarization, and translation. Exercises involve data analysis and building a small text-to-speech system.

COMS W4725x or y Knowledge Representation and Reasoning Lect: 3. 3 pts. Prerequisites: COMS W4701. General aspects of knowledge representation (KR). The two fundamental paradigms (semantic networks and frames) and illustrative systems. Topics include hybrid systems, time, action/plans, defaults, abduction, and case-based reasoning. Throughout the course particular attention will be paid to design tradeoffs between language expressiveness and reasoning complexity, and issues relating to the use of KR systems in larger applications.

COMS W4731x or y Computer Vision Lect: 3. 3 pts. Prerequisites: The fundamentals of calculus, linear algebra, and C programming. Students without any of these prerequisites are advised to contact the instructor prior to taking the course. Introductory course in computer vision. Topics include image formation and optics, image sensing, binary images, image processing and filtering, edge extraction and boundary detection, region growing and segmentation, pattern classification methods, brightness and reflectance, shape from shading and photometric stereo, texture, binocular stereo, optical flow and motion, 2-D and 3-D object representation, object recognition, vision systems and applications.

Course Number	Call Number/ Section	Days & Times/ Location	Instructor	Enrollment
Autumn 2008 :: COMS W4731
COMS 4731	63353 001	TuTh 4:10p - 5:25p 420 Pupin Laboratories	S. Nayar	39 / 50

COMS W4733x or y Computational Aspects of Robotics Lect: 3. 3pts. Prerequisites: COMS W3137 or W3139. Introduction to robotics from a computer science perspective. Topics include coordinate frames and kinematics, computer architectures for robotics, integration and use of sensors, world modeling systems, design and use of robotic programming languages, and applications of artificial intelligence for planning, assembly, and manipulation.

COMS W4735x or y Visual Interfaces To Computers Lect: 3. 3 pts. Prerequisites: COMS W3137 or W3139. Visual input as data and for control of computer systems. Survey and analysis of architecture, algorithms, and underlying assumptions of commercial and research systems that recognize and interpret human gestures, analyze imagery such as fingerprint or iris patterns, generate natural language descriptions of medical or map imagery. Explores foundations in human psychophysics, cognitive science, and artificial intelligence.

COMS W4737x or y Biometrics 3 pts. Prerequisites: A background at the sophomore level in computer science, engineering, or like discipline. Corequisites: None In this course we will explore the latest advances in biometrics as well as the machine learning techniques behind them. Students will learn how these technologies work and how they are sometimes defeated. Grading will be based on homework assignments and a final project. There will be no midterm or final exam. This course shares lectures with COMS E6737. Students taking COMS E6737 are required to complete additional homework problems and undertake a more rigorous final project. Students will only be allowed to earn credit for COMS W4737 or COMS E6737 and not both.

Course Number	Call Number/ Section	Days & Times/ Location	Instructor	Enrollment
Autumn 2008 :: COMS W4737
COMS 4737	66557 001	TuTh 1:10p - 2:25p 327 Seeley W. Mudd Building	P. Belhumeur	11

CBMF W4761x or y Computational Genomics Lect: 3. 3 pts. Prerequisites: Introductory probability and statistics and basic programming skills. Provides comprehensive introduction to computational techniques for analyzing genomic data including DNA, RNA and protein structures; microarrays; transcription and regulation; regulatory, metabolic and protein interaction networks. The course covers sequence analysis algorithms, dynamic programming, hidden Markov models, phylogenetic analysis, Bayesian network techniques, neural networks, clustering algorithms, support vector machines, Boolean models of regulatory networks, flux based analysis of metabolic networks and scale-free network models. The course provides self-contained introduction to relevant biological mechanisms and methods.

COMS W4771y Machine Learning Lect: 3. 3 pts. Prerequisites: Any introductory course in linear algebra and any introductory course in statistics are both required. Highly recommended: COMS W4701 or knowledge of Artificial Intelligence. Topics from generative and discriminative machine learning including least squares methods, support vector machines, kernel methods, neural networks, Gaussian distributions, linear classification, linear regression, maximum likelihood, exponential family distributions, Bayesian networks, Bayesian inference, mixture models, the EM algorithm, graphical models and hidden Markov models. Algorithms implemented in Matlab.

COMS W4772x Advanced Machine Learning 3 pts. Prerequisites: COMS W4771 or permission of instructor; knowledge of linear algebra & introductory probability or statistics is required. An exploration of advanced machine learning tools for perception and behavior learning. How can machines perceive, learn from, and classify human activity computationally? Topics include Appearance-Based Models, Principal and Independent Components Analysis, Dimensionality Reduction, Kernel Methods, Manifold Learning, Latent Models, Regression, Classification, Bayesian Methods, Maximum Entropy Methods, Real-Time Tracking, Extended Kalman Filters, Time Series Prediction, Hidden Markov Models, Factorial HMMS, Input-Output HMMs, Markov Random Fields, Variational Methods, Dynamic Bayesian Networks, and Gaussian/Dirichlet Processes. Links to cognitive science.