Computer Science

COMS W1001 Introduction to Information Science. 3 points.

Lect: 3.

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

COMS W1002 COMPUTING IN CONTEXT. 4.00 points.

CC/GS: Partial Fulfillment of Science Requirement

Introduction to elementary computing concepts and Python programming with domain-specific applications. Shared CS concepts and Python programming lectures with track-specific sections. Track themes will vary but may include computing for the social sciences, computing for economics and finance, digital humanities, and more. Intended for nonmajors. Students may only receive credit for one of ENGI E1006 or COMS W1002

COMS W1003 INTRO-COMPUT SCI/PROGRAM IN C. 3.00 points.

COMS W1004 Introduction to Computer Science and Programming in Java. 3 points.

Lect: 3.

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 two courses: 1004 or 1005.

COMS W1005 Introduction to Computer Science and Programming in MATLAB. 3 points.

CC/GS: Partial Fulfillment of Science Requirement

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 two courses: W1004 or W1005.

COMS W1011 INTERMED COMPUTER PROGRAMMING. 3.00 points.

COMS W1012 COMPUTING IN CONTEXT REC. 0.00 points.

COMS W1103 HONORS INTRO COMPUTER SCIENCE. 3.00 points.

COMS W1404 EMERGING SCHOLARS PROG SEMINAR. 1.00 point.

Pass/Fail only.

Prerequisites: Instructor's permission
Corequisites: COMS W1004,COMS W1007,COMS W1002
Peer-led weekly seminar intended for first and second year undergraduates considering a major in Computer Science. Pass/fail only. May not be used towards satisfying the major or SEAS credit requirements

COMS W2132 Intermediate Computing in Python. 4.00 points.

Essential data structures and algorithms in Python with practical software development skills, applications in a variety of areas including biology, natural language processing, data science and others

COMS W2702 AI in Context. 3.00 points.

Prerequisites: STAT UN1201 or equivalent is strongly recommended.
An interdisciplinary introduction to the history, development and modern application of artificial intelligence in a variety of contexts. Context subjects and teaching staff will vary by semester

COMS W3011 INTERMED COMPUTER PROGRAMMING. 3.00 points.

COMS W3101 PROGRAMMING LANGUAGES. 1.00 point.

Lect: 1.

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 W3102 DEVELOPMENT TECHNOLOGY. 1.00-2.00 points.

Lect: 2. Lab: 0-2.

Prerequisites: Fluency in at least one programming language.
Introduction to software development tools and environments. Each section devoted to a specific tool or environment. One-point sections meet for two hours each week for half a semester, and two point sections include an additional two-hour lab

COMS W3107 Clean Object-Oriented Design. 3.00 points.

Prerequisites: Intro to Computer Science/Programming in Java (COMS W1004) or instructor’s permission. May not take for credit if already received credit for COMS W1007.

Prerequisites: see notes re: points COMS W1004; COMS W1004 or permission of instructor. May not take for credit if already received credit for COMS W1007
A course in designing, documenting, coding, and testing robust computer software, according to object-oriented design patterns and clean coding practices. Taught in Java.Object-oriented design principles include: use cases; CRC; UML; javadoc; patterns (adapter, builder, command, composite, decorator, facade, factory, iterator, lazy evaluation, observer, singleton, strategy, template, visitor); design by contract; loop invariants; interfaces and inheritance hierarchies; anonymous classes and null objects; graphical widgets; events and listeners; Java's Object class; generic types; reflection; timers, threads, and locks

COMS W3123 ASSEMBLY LANG AND COMPUT LOGIC. 3.00 points.

COMS W3132 Intermediate Computing in Python. 4.00 points.

Prerequisites: ENGI E1006 OR COMS W1002; or equivalent Python programming experience. Intermediate interdisciplinary course in computing intended for non-CS majors.
Essential data structures and algorithms in Python with practical software development skills, applications in a variety of areas including biology, natural language processing, data science and others

COMS W3134 Data Structures in Java. 3 points.

CC/GS: Partial Fulfillment of Science Requirement

Prerequisites: (COMS W1004) or COMS W1004; Knowledge of Java

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 three courses: COMS W3134, COMS W3136, COMS W3137.

COMS W3136 ESSENTIAL DATA STRUCTURES. 4.00 points.

Prerequisites: (COMS W1004) or (COMS W1005) or (COMS W1007) or (ENGI E1006) COMS W1005 OR COMS W1007 OR ENGI E1006 OR COMS W1004
A second programming course intended for nonmajors with at least one semester of introductory programming experience. Basic elements of programming in C and C , arraybased data structures, heaps, linked lists, C programming in UNIX environment, object-oriented programming in C , trees, graphs, generic programming, hash tables. Due to significant overlap, students may only receive credit for either COMS W3134, W3136, or W3137

COMS W3137 HONORS DATA STRUCTURES ＆ ALGOL. 4.00 points.

Prerequisites: (COMS W1004) or (COMS W1007) COMS W1004 OR COMS W1007
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 Java. Note: Due to significant overlap, students may receive credit for only one of the following three courses: COMS W3134, W3136, or W3137

COMS W3157 ADVANCED PROGRAMMING. 4.00 points.

Lect: 4.

Prerequisites: (COMS W3134) or (COMS W3137) COMS W3134 OR COMS W3137
C programming language and Unix systems programming. Also covers Git, Make, TCP/IP networking basics, C fundamentals

COMS W3202 FINITE MATHEMATICS. 3.00 points.

COMS W3203 DISCRETE MATHEMATICS. 4.00 points.

Lect: 3.

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)

COMS W3210 Scientific Computation. 3 points.

CC/GS: Partial Fulfillment of Science Requirement

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 W3251 COMPUTATIONAL LINEAR ALGEBRA. 4.00 points.

COMS W3261 COMPUTER SCIENCE THEORY. 3.00 points.

CC/GS: Partial Fulfillment of Science Requirement

Prerequisites: (COMS W3203) COMS W3203; COMS W3134 AND COMS W3137 AND COMS W3136
Corequisites: COMS W3134,COMS W3136,COMS W3137
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

COMS W3410 COMPUTERS AND SOCIETY. 3.00 points.

Lect: 3.

Broader impact of computers. Social networks and privacy. Employment, intellectual property, and the media. Science and engineering ethics. Suitable for nonmajors

COMS W3770 Mathematics for Machine Learning. 3.00 points.

Mathematical foundations of machine learning: Linear algebra, multivariable calculus, and probability and statistics. Comprehensive review and additional treatment of relevant topics used in the analysis and design of machine learning models. Preliminary exposure to core algorithms such as linear regression, gradient descent, principal component analysis, low-rank approximations, and kernel methods

COMS E3899 Research Training. 0.00 points.

Research training course. Recommended in preparation for laboratory related research

COMS W3902 UNDERGRADUATE THESIS. 0.00-6.00 points.

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

COMS W3995 Special Topics in Computer Science. 3 points.

Lect: 3.

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 W3998 UNDERGRAD PROJECTS IN COMPUTER SCIENCE. 1.00-3.00 points.

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. Consult the department for section assignment

COMS W3999 FIELDWORK. 1.00-2.00 points.

Prerequisites: COMS X9998; Obtained internship and approval from faculty advisor.
May be repeated for credit, but no more than 3 total points may be used toward the 128-credit degree requirement. Only for SEAS computer science undergraduate students who include relevant off campus work experience as part of their approved program of study. Final report and letter of evaluation may be required. May not be used as a technical or nontechnical elective or as a GTE (general technical elective). May not be taken for pass/fail credit or audited

COMS E3999 Fieldwork. 1 point.

May be repeated for credit, but no more than 3 total points may be used toward the 128-credit degree requirement. Only for SEAS computer science undergraduate students who include relevant off-campus work experience as part of their approved program of study. Final report and letter of evaluation required. May not be used as a technical or non-technical elective. May not be taken for pass/fail credit or audited.

COMS W4111 INTRODUCTION TO DATABASES. 3.00 points.

CC/GS: Partial Fulfillment of Science Requirement
Prerequisites: COMS W3134, COMS W3136, or COMS W3137; or the instructor's permission.

Prerequisites: (COMS W3134) or (COMS W3136) or (COMS W3137) or COMS W3134 AND COMS W3136 AND COMS W3137; COMS W3134, COMS W3136, or COMS W3136; or instructor's permission
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

COMS W4112 DATABASE SYSTEM IMPLEMENTATION. 3.00 points.

Lect: 2.5.

Prerequisites: (COMS W4111) and COMS W4111; fluency in Java or C++. CSEE 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 W4113 FUND-LARGE-SCALE DIST SYSTEMS. 3.00 points.

Prerequisites: (COMS W3134 or COMS W3136 or COMS W3137) and (COMS W3157 or COMS W4118 or CSEE W4119) COMS W3134, W3136, or W3137. COMS W3157 or good working knowledge of C and C++. COMS W4118 or CSEE W4119.
Prerequisites: (COMS W3134 or COMS W3136 or COMS W3137) and (COMS W3157 or COMS W4118 or CSEE W4119) Design and implementation of large-scale distributed and cloud systems. Teaches abstractions, design and implementation techniques that enable the building of fast, scalable, fault-tolerant distributed systems. Topics include distributed communication models (e.g. sockets, remote procedure calls, distributed shared memory), distributed synchronization (clock synchronization, logical clocks, distributed mutex), distributed file systems, replication, consistency models, fault tolerance, distributed transactions, agreement and commitment, Paxos-based consensus, MapReduce infrastructures, scalable distributed databases. Combines concepts and algorithms with descriptions of real-world implementations at Google, Facebook, Yahoo, Microsoft, LinkedIn, etc

COMS E4115 PROGRAMMING LANG ＆ TRANSL. 3.00 points.

COMS W4115 PROGRAMMING LANG ＆ TRANSLATORS. 3.00 points.

Lect: 3.

Prerequisites: (COMS W3134 or COMS W3136 or COMS W3137) and (COMS W3261) and (CSEE W3827) or COMS W3134 OR COMS W3136 OR COMS W3137 OR CSEE W3827 AND COMS W3261; 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

COMS W4118 OPERATING SYSTEMS I. 3.00 points.

Lect: 3.

Prerequisites: (CSEE W3827) and CSEE W3827; Knowledge of C and programming tools as covered in COMS COMS W3136, COMS W3157, or COMS 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

COMS W4119 COMPUTER NETWORKS. 3.00 points.

Prerequisites: Comfort with basic probability and programming fluency in Python, C++, Java, or Ruby.
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

COMS W4121 COMPUTER SYSTEMS FOR DATA SCIENCE. 3.00 points.

Prerequisites: CSOR W4246 OR STAT W4203; or equivalent as approved by faculty advisor. background in Computer System Organization and good working knowledge of C/C++
Corequisites: CSOR W4246,STAT GU4203
An introduction to computer architecture and distributed systems with an emphasis on warehouse scale computing systems. Topics will include fundamental tradeoffs in computer systems, hardware and software techniques for exploiting instruction-level parallelism, data-level parallelism and task level parallelism, scheduling, caching, prefetching, network and memory architecture, latency and throughput optimizations, specialization, and an introduction to programming data center computers

COMS W4137 From Algorithmic Thinking to Development. 3.00 points.

Algorithmic problem-solving and coding skills needed to devise solutions to interview questions for software engineering positions. Solutions are implemented in Python, Java, C, and C . Approaches include brute-force, hashing, sorting, transform-and-conquer, greedy, and dynamic programming. Focus on experimentation and team work

COMS W4152 Engineering Software-as-a-Service. 3.00 points.

Prerequisites: COMS W3134 AND COMS W3157 AND CSEE W3827
Modern software engineering concepts and practices including topics such as Software-as-a-Service, Service-oriented Architecture, Agile Development, Behavior-driven Development, Ruby on Rails, and Dev/ops

COMS W4153 Cloud Computing. 3.00 points.

Prerequisites: COMS W4111
Software engineering skills necessary for developing cloud computing and software-as-a-service applications, covering topics such as service-oriented architectures, message-driven applications, and platform integration. Includes theoretical study, practical application, and collaborative project work

COMS W4156 ADVANCED SOFTWARE ENGINEERING. 3.00 points.

Lect: 3.

Prerequisites: (COMS W3157) or
Software lifecycle using frameworks, libraries and services. Major emphasis on software testing. Centers on a team project

COMS W4160 COMPUTER GRAPHICS. 3.00 points.

Lect: 3.

Prerequisites: (COMS W3134) or (COMS W3136) or (COMS W3137) COMS W3134 OR COMS W3136 OR COMS W3137; 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

COMS W4162 Advanced Computer Graphics. 3 points.

Lect: 3.

Prerequisites: (COMS W4160) or COMS W4160

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 W4165 COMPUT TECHNIQUES-PIXEL PROCSS. 3.00 points.

Prerequisites: COMS W3137, COMS W3251 recommended, and a good working knowledge of UNIX and C. Intended for graduate students 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 from 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 W4167 COMPUTER ANIMATION. 3.00 points.

Lect: 3.

Prerequisites: multivariable calculus, linear algebra, C++ programming proficiency. COMS W4156 recommended.

Theory and practice of physics-based animation algorithms, including animated clothing, hair, smoke, water, collisions, impact, and kitchen sinks. Topics covered: Integration of ordinary differential equations, formulation of physical models, treatment of discontinuities including collisions/contact, animation control, constrained Lagrangian Mechanics, friction/dissipation, continuum mechanics, finite elements, rigid bodies, thin shells, discretization of Navier-Stokes equations. General education requirement: quantitative and deductive reasoning (QUA). 

COMS W4170 USER INTERFACE DESIGN. 3.00 points.

CC/GS: Partial Fulfillment of Science Requirement

Prerequisites: (COMS W3134 or COMS W3136 or COMS W3137) COMS W3134 OR COMS W3136 OR 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

COMS W4172 3D UI AND AUGMENTED REALITY. 3.00 points.

CC/GS: Partial Fulfillment of Science Requirement

Prerequisites: (COMS W4160) or (COMS W4170) or COMS W4160 OR COMS W4170; Or 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 W4181 SECURITY I. 3.00 points.

Not offered during 2023-2024 academic year.

Prerequisites: COMS W3157; or equivalent.
Introduction to security. Threat models. Operating system security features. Vulnerabilities and tools. Firewalls, virtual private networks, viruses. Mobile and app security. Usable security. Note: May not earn credit for both W4181 and W4180 or W4187

COMS W4182 SECURITY II. 3.00 points.

Not offered during 2023-2024 academic year.

Prerequisites: COMS W4118 AND COMS W4181 AND CSEE W4119
Advanced security. Centralized, distributed, and cloud system security. Cryptographic protocol design choices. Hardware and software security techniques. Security testing and fuzzing. Blockchain. Human security issues. Note: May not earn credit for both W4182 and W4180 or W4187

COMS W4186 MALWARE ANALYSIS＆REVERSE ENGINEERING. 3.00 points.

Not offered during 2023-2024 academic year.

Prerequisites: COMS W3157 AND CSEE W3827; or equivalent.
Hands-on analysis of malware. How hackers package and hide malware and viruses to evade analysis. Disassemblers, debuggers, and other tools for reverse engineering. Deep study of Windows Internals and x86 assembly

COMS W4203 Graph Theory. 3 points.

Lect: 3.

Prerequisites: (COMS W3203) 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.

COMS W4205 Combinatorial Theory. 3 points.

Lect: 3.Not offered during 2023-2024 academic year.

Prerequisites: (COMS W3203) and 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 W4223 Networks, Crowds, and the Web. 3.00 points.

Prerequisites: Familiarity with elementary concepts of probability and data structures or experience programming with data
Introduces fundamental ideas and algorithms on networks of information collected by online services. It covers properties pervasive in large networks, dynamics of individuals that lead to large collective phenomena, mechanisms underlying the web economy, and results and tools informing societal impact of algorithms on privacy, polarization and discrimination

COMS W4231 ANALYSIS OF ALGORITHMS I. 3.00 points.

COMS W4232 Advanced Algorithms. 3.00 points.

Prerequisite: Analysis of Algorithms (COMS W4231).

Prerequisites: see notes re: points COMS W4231
Introduces classic and modern algorithmic ideas that are central to many areas of Computer Science. The focus is on most powerful paradigms and techniques of how to design algorithms, and how to measure their efficiency. The intent is to be broad, covering a diversity of algorithmic techniques, rather than be deep. The covered topics have all been implemented and are widely used in industry. Topics include: hashing, sketching/streaming, nearest neighbor search, graph algorithms, spectral graph theory, linear programming, models for large-scale computation, and other related topics

COMS W4236 INTRO-COMPUTATIONAL COMPLEXITY. 3.00 points.

Lect: 3.

Prerequisites: (COMS W3261) COMS W3261
Develops a quantitative theory of the computational difficulty of problems in terms of the resources (e.g. 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 W4241 Numerical Algorithms and Complexity. 3 points.

Lect: 3.

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 W4242 NUMRCL ALGORTHMS-COMPLEXITY II. 3.00 points.

COMS W4252 INTRO-COMPUTATIONAL LEARN THRY. 3.00 points.

CC/GS: Partial Fulfillment of Science Requirement

Prerequisites: (CSOR W4231) or (COMS W4236) or CSOR W4231 OR COMS W4236 OR COMS W3203 OR COMS W3261

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.

COMS W4261 INTRO TO CRYPTOGRAPHY. 3.00 points.

Lect: 2.5.

Prerequisites: COMS W3261 OR CSOR W4231; Comfort with basic discrete math and probability. Recommended: COMS W3261 or CSOR 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 W4281 INTRO TO QUANTUM COMPUTING. 3.00 points.

Lect: 3.

Prerequisites: knowledge of linear algebra. Prior knowledge of quantum mechanics is not required, although it is 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.

COMS W4295 Topics in Theoretical Computer Science. 3.00 points.

Selected topics in theoretical computer science. Content and prerequisites vary between sections and semesters. May be repeated for credit. Check "topics courses" webpage on the department website for more information on each section

COMS W4419 INTERNET TECHNOLOGY,ECONOMICS,AND POLICY. 3.00 points.

Not offered during 2023-2024 academic year.

Technology, economic and policy aspects of the Internet. Summarizes how the Internet works technically, including protocols, standards, radio spectrum, global infrastructure and interconnection. Micro-economics with a focus on media and telecommunication economic concerns, including competition and monopolies, platforms, and behavioral economics. US constitution, freedom of speech, administrative procedures act and regulatory process, universal service, role of FCC. Not a substitute for CSEE4119. Suitable for non-majors. May not be used as a track elective for the computer science major.

COMS W4444 PROGRAMMING ＆ PROBLEM SOLVING. 3.00 points.

CC/GS: Partial Fulfillment of Science Requirement

Prerequisites: (COMS W3134 or COMS W3136 or COMS W3137) and (CSEE W3827) COMS W3134 AND COMS W3136 OR COMS W3137 AND CSEE W3827
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

COMS W4460 PRIN-INNOVATN/ENTREPRENEURSHIP. 3.00 points.

CC/GS: Partial Fulfillment of Science Requirement

Prerequisites: (COMS W3134 or COMS W3136 or COMS W3137) or COMS W3134 OR COMS W3136 OR COMS W3137; Or instructor's permission
Team project centered course focused on principles of planning, creating, and growing a technology venture. Topics include: identifying and analyzing opportunities created by technology paradigm shifts, designing innovative products, protecting intellectual property, engineering innovative business models

COMS W4701 ARTIFICIAL INTELLIGENCE. 3.00 points.

CC/GS: Partial Fulfillment of Science Requirement

Prerequisites: (COMS W3134 or COMS W3136 or COMS W3137) and COMS W3134 OR COMS W3136 OR COMS W3137; Any course on probability
Prior knowledge of Python is recommended. 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

COMS W4705 NATURAL LANGUAGE PROCESSING. 3.00 points.

Lect: 3.

Prerequisites: (COMS W3134 or COMS W3136 or COMS W3137) or COMS W3134 OR COMS W3136 OR COMS W3137; Or 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

COMS W4706 Spoken Language Processing. 3 points.

CC/GS: Partial Fulfillment of Science Requirement

Prerequisites: (COMS W3134 or COMS W3136 or COMS W3137) or COMS W3134, W3136, or W3137; 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 W4721 MACHINE LEARNING FOR DATA SCI. 3.00 points.

COMS W4725 Knowledge representation and reasoning. 3 points.

Lect: 3.Not offered during 2023-2024 academic year.

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 is paid to design trade-offs between language expressiveness and reasoning complexity, and issues relating to the use of KR systems in larger applications. 

COMS W4731 Computer Vision I: First Principles. 3.00 points.

Lect: 3.

Prerequisites: 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, 2D and 3D object representation, object recognition, vision systems and applications

COMS W4732 Computer Vision II: Learning. 3.00 points.

Prerequisites: COMS W4731; Fundamentals of calculus, linear algebra, and Python programming. Students without any of these prerequisites are advised to contact the instructor prior to taking the course.
Advanced course in computer vision. Topics include convolutional networks and back-propagation, object and action recognition, self-supervised and few-shot learning, image synthesis and generative models, object tracking, vision and language, vision and audio, 3D representations, interpretability, and bias, ethics, and media deception

COMS W4733 COMPUTATIONAL ASPECTS OF ROBOTICS. 3.00 points.

CC/GS: Partial Fulfillment of Science Requirement

Prerequisites: (COMS W3134 or COMS W3136COMS W3137) COMS W3134 OR COMS W3136 OR COMS W3137 AND COMS W3251 OR MATH UN2010 OR APMA E2101 OR APMA E3101 OR MATH UN2015 AND STAT GU4001 OR IEOR E3658 OR STAT UN1201 OR MATH UN2015 Proficiency in Python or a similar programming language.
Introduction to fundamental problems and algorithms in robotics. Topics include configuration spaces, motion and sensor models, search and sampling-based planning, state estimation, localization and mapping, perception, and learning

COMS W4735 VISUAL INTERFACES TO COMPUTERS. 3.00 points.

Lect: 3.

Prerequisites: (COMS W3134 or COMS W3136 or COMS W3137) COMS W3134 OR COMS W3136 OR COMS W3137
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 W4737 Biometrics. 3 points.

CC/GS: Partial Fulfillment of Science Requirement

Prerequisites: a background at the sophomore level in computer science, engineering, or like discipline.

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.

COMS W4762 Machine Learning for Functional Genomics. 3 points.

Prerequisites: Proficiency in a high-level programming language (Python/R/Julia). An introductory machine learning class (such as COMS 4771 Machine Learning) will be helpful but is not required.

Prerequisites: see notes re: points Proficiency in a high level programming language Python/R/Julia. An introductory machine learning class such as COMS W4771 Machine Learning will be helpful but is not required.

This course will introduce modern probabilistic machine learning methods using applications in data analysis tasks from functional genomics, where massively-parallel sequencing is used to measure the state of cells: e.g. what genes are being expressed, what regions of DNA (“chromatin”) are active (“open”) or bound by specific proteins.

COMS E4762 Machine Learning for Functional Genomics. 3.00 points.

This course will introduce modern probabilistic machine learning methods using applications in data analysis tasks from functional genomics, where massively-parallel sequencing is used to measure the state of cells: e.g. what genes are being expressed, what regions of DNA (“chromatin”) are active (“open”) or bound by specific proteins

COMS W4771 MACHINE LEARNING. 3.00 points.

Lect: 3.

Prerequisites: COMS W4701; 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 W4772 ADVANCED MACHINE LEARNING. 3.00 points.

Lect: 3.

Prerequisites: (COMS W4771) or COMS W4771; Instructor's permission; 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

COMS W4773 Machine Learning Theory. 3 points.

Prerequisites: Machine Learning (COMS W4771). Background in probability and statistics, linear algebra, and multivariate calculus. Ability to program in a high-level language, and familiarity with basic algorithm design and coding principles.

Prerequisites: see notes re: points COMS W4771

Core topics from unsupervised learning such as clustering, dimensionality reduction and density estimation will be studied in detail. Topics in clustering: k-means clustering, hierarchical clustering, spectral clustering, clustering with various forms of feedback, good initialization techniques and convergence analysis of various clustering procedures. Topics in dimensionality reduction: linear techniques such as PCA, ICA, Factor Analysis, Random Projections, non-linear techniques such as LLE, IsoMap, Laplacian Eigenmaps, tSNE, and study of embeddings of general metric spaces, what sorts of theoretical guarantees can one provide about such techniques. Miscellaneous topics: design and analysis of data structures for fast Nearest Neighbor search such as Cover Trees and LSH. Algorithms will be implemented in either Matlab or Python.

COMS E4773 Machine Learning Theory. 3.00 points.

Theoretical study of algorithms for machine learning and high-dimensional data analysis. Topics include high-dimensional probability, theory of generalization and statistical learning, online learning and optimization, spectral analysis

COMS W4774 Unsupervised Learning. 3.00 points.

Prerequisites: Solid background in multivariate calculus, linear algebra, basic probability, and algorithms.

Prerequisites: see notes re: points COMS W4771; Background in probability and statistics, linear algebra, and multivariate calculus. Ability to program in a high-level language, and familiarity with basic algorithm design and coding principles
Core topics from unsupervised learning such as clustering, dimensionality reduction and density estimation will be studied in detail. Topics in clustering: k-means clustering, hierarchical clustering, spectral clustering, clustering with various forms of feedback, good initialization techniques and convergence analysis of various clustering procedures. Topics in dimensionality reduction: linear techniques such as PCA, ICA, Factor Analysis, Random Projections, non-linear techniques such as LLE, IsoMap, Laplacian Eigenmaps, tSNE, and study of embeddings of general metric spaces, what sorts of theoretical guarantees can one provide about such techniques. Miscellaneous topics: design and analysis of datastructures for fast Nearest Neighbor search such as Cover Trees and LSH. Algorithms will be implemented in either Matlab or Python

COMS W4775 Causal Inference. 3.00 points.

Prerequisites: Discrete Math, Calculus, Statistics (basic probability, modeling, experimental design), some programming experience.

Prerequisites: see notes re: points COMS W4771; Discrete Math, Calculus, Statistics basic probability, modeling, experimental design, Some programming experience
Causal Inference theory and applications. The theoretical topics include the 3-layer causal hierarchy, causal bayesian networks, structural learning, the identification problem and the do-calculus, linear identifiability, bounding, and counterfactual analysis. The applied part includes intersection with statistics, the empirical-data sciences (social and health), and AI and ML

COMS E4775 Causal Inference. 3 points.

Prerequisites: (COMS4711W) and

Causal Inference theory and applications. The theoretical topics include the 3-layer causal hierarchy,  causal bayesian networks, structural learning, the identification problem and the do-calculus, linear identifiability, bounding, and counterfactual analysis. The applied part includes intersection with statistics, the empirical-data sciences (social and health), and AI and ML.

COMS W4776 Machine Learning for Data Science. 3 points.

Lect.: 3

Prerequisites: (STAT GU4001 or IEOR E4150) and SIEO W3600 or W4150 or equivalent.

Introduction to machine learning, emphasis on data science. Topics include least square methods, Gaussian distributions, linear classification, linear regression, maximum likelihood, exponential family distributions, Bayesian networks, Bayesian inference, mixture models, the EM algorithm, graphical models, hidden Markov models, support vector machines kernel methods. Emphasizes methods and problems relevant to big data. Students may not receive credit for both COMS W4771 and W4776.

COMS W4824 COMPUTER ARCHITECTURE. 3.00 points.

COMS W4835 COMPUTER ORGANIZATION II. 3.00 points.

COMS E4899 Research Training. 0.00 points.

Research training course. Recommended in preparation for laboratory related research

COMS W4901 Projects in Computer Science. 1-3 points.

Prerequisites: Approval by a faculty member who agrees to supervise the work.

A second-level 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.

COMS W4910 CURRICULAR PRACTICAL TRAINING. 1.00 point.

COMS E4995 COMPUTER ARTS/VIDEO GAMES. 3.00 points.

Special topics arranged as the need and availability arises. 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. Consult the department for section assignment

COMS W4995 TOPICS IN COMPUTER SCIENCE. 3.00 points.

Lect: 3.

Selected topics in computer science. Content and prerequisites vary between sections and semesters. May be repeated for credit. Check “topics course” webpage on the department website for more information on each section

COMS W4996 Special topics in computer science, II. 3 points.

Lect: 3.Not offered during 2023-2024 academic year.

Prerequisites: Instructor's permission.

A continuation of COMS W4995 when the special topic extends over two terms.

CSEE W3826 FUNDAMENTALS OF COMPUTER ORG. 3.00 points.

CSEE W3827 FUNDAMENTALS OF COMPUTER SYSTS. 3.00 points.

Lect: 3.

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

CSEE W4119 COMPUTER NETWORKS. 3.00 points.

Prerequisites: Comfort with basic probability. Programming fluency in Python, C++, Java, or Ruby please see section course page for specific language requirements.
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

CSEE W4121 COMPUTER SYSTEMS FOR DATA SCIENCE. 3.00 points.

Prerequisites: Background in Computer System Organization and good working knowledge of C/C++. CSOR W4246 Algorithms for Data Science, STAT W4203 Probability Theory, or equivalent as approved by faculty advisor.
An introduction to computer architecture and distributed systems with an emphasis on warehouse scale computing systems. Topics will include fundamental tradeoffs in computer systems, hardware and software techniques for exploiting instruction-level parallelism, data-level parallelism and task level parallelism, scheduling, caching, prefetching, network and memory architecture, latency and throughput optimizations, specialization, and an introduction to programming data center computers

CSEE W4140 NETWORKING LABORATORY. 3.00 points.

Lect: 3.

Prerequisites: (CSEE W4119) or CSEE W4119; 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 protocols 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 Protocol (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)

CSEE W4823 Advanced Logic Design. 3 points.

Lect: 3.

Prerequisites: (CSEE W3827) or CSEE W3827; Or a half semester introduction to digital logic, or the equivalent.

An introduction to modern digital system design. Advanced topics in digital logic: controller synthesis (Mealy and Moore machines); adders and multipliers; structured logic blocks (PLDs, PALs, ROMs); iterative circuits. Modern design methodology: register transfer level modelling (RTL); algorithmic state machines (ASMs); introduction to hardware description languages (VHDL or Verilog); system-level modelling and simulation; design examples.

CSEE W4824 COMPUTER ARCHITECTURE. 3.00 points.

Lect: 3.

Prerequisites: (CSEE W3827) or CSEE W3827
Focuses on advanced topics in computer architecture, illustrated by case studies from classic and modern processors. Fundamentals of quantitative analysis. Pipelining. Memory hierarchy design. Instruction-level and thread-level parallelism. Data-level parallelism and graphics processing units. Multiprocessors. Cache coherence. Interconnection networks. Multi-core processors and systems-on-chip. Platform architectures for embedded, mobile, and cloud computing

CSEE W4840 EMBEDDED SYSTEMS. 3.00 points.

Lect: 3.

Prerequisites: (CSEE W4823) CSEE W4823
Embedded system design and implementation combining hardware and software. I/O, interfacing, and peripherals. Weekly laboratory sessions and term project on design of a microprocessor-based embedded system including at least one custom peripheral. Knowledge of C programming and digital logic required

CSEE W4868 SYSTEM-ON-CHIP PLATFORMS. 3.00 points.

Prerequisites: (COMS W3157) and (CSEE W3827) COMS W3157 AND CSEE W3827
Design and programming of System-on-Chip (SoC) platforms. Topics include: overview of technology and economic trends, methodologies and supporting CAD tools for system-level design, models of computation, the SystemC language, transaction-level modeling, software simulation and virtual platforms, hardware-software partitioning, high-level synthesis, system programming and device drivers, on-chip communication, memory organization, power management and optimization, integration of programmable processor cores and specialized accelerators. Case studies of modern SoC platforms for various classes of applications