INTRO TO INFORMATION SCIENCE

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.

• TR 10:10 a.m.-11:25 a.m.
• Instructor: Adam H Cannon
  CULPA: 81 Info
• 3 points

COMPUTING IN CONTEXT

COMPUTING IN ECONOMICS

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.

• TR 1:10 p.m.-2:25 p.m.
• 4 points

COMPUTING IN CONTEXT

COMPUTING IN ART

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.

• TR 1:10 p.m.-2:25 p.m.
• Instructor: Mark Santolucito
  CULPA: 1 h-index: 8 Info
• 4 points

COMPUTING IN CONTEXT

COMPUTING IN BIOLOGY

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.

• TR 1:10 p.m.-2:25 p.m.
• Instructor: Mark Santolucito
  CULPA: 1 h-index: 8 Info
• 4 points

COMPUTING IN CONTEXT

NLP DIGITAL HUMANITIES

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.

• TR 1:10 p.m.-2:25 p.m.
• Instructor: Mark Santolucito
  CULPA: 1 h-index: 8 Info
• 4 points

INTRO-COMPUT SCI/PROG IN JAVA

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.

• MW 2:40 p.m.-3:55 p.m.
• MW 5:40 p.m.-6:55 p.m.
• Instructor: Paul S Blaer
  CULPA: 46 h-index: 8 Info
• 3 points

INTRO TO COMP FOR ENG/APP SCI

An interdisciplinary course in computing intended for first year SEAS students. Introduces computational thinking, algorithmic problem solving and Python programming with applications in science and engineering. Assumes no prior programming background.

• MW 10:10 a.m.-11:25 a.m.
• Instructor: Daniel Bauer
  CULPA: 17 h-index: 13 Info
• 3 points

COMPUTING IN CONTEXT REC

COMPUTING IN ECON

• R 7:10 p.m.-8 p.m.
• Instructor: Adam H Cannon
  CULPA: 81 Info
• 0 points

COMPUTING IN CONTEXT REC

COMPUTING IN ECON

• R 7:10 p.m.-8 p.m.
• F 10:10 a.m.-11 a.m.
• F 2 p.m.-2:50 p.m.
• Instructor: Adam H Cannon
  CULPA: 81 Info
• 0 points

COMPUTING IN CONTEXT REC

COMPUTING IN ART

• R 7:10 p.m.-8 p.m.
• F 9 a.m.-9:50 a.m.
• Instructor: Mark Santolucito
  CULPA: 1 h-index: 8 Info
• 0 points

COMPUTING IN CONTEXT REC

COMPUTING IN BIOLOGY

• R 7:10 p.m.-8 p.m.
• F 11 a.m.-11:50 a.m.
• Instructor: Mark Santolucito
  CULPA: 1 h-index: 8 Info
• 0 points

COMPUTING IN CONTEXT REC

NLP DIGITAL HUMANITIES

• R 7:10 p.m.-8 p.m.
• F 10:10 a.m.-11 a.m.
• Instructor: Mark Santolucito
  CULPA: 1 h-index: 8 Info
• 0 points

EMERGING SCHOLARS PROG SEMINAR

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.

• F 8:40 a.m.-9:55 a.m.
• F 10:10 a.m.-11:25 a.m.
• F 11:40 a.m.-12:55 p.m.
• F 1:10 p.m.-2:25 p.m.
• F 2:40 p.m.-3:55 p.m.
• F 4:10 p.m.-5:25 p.m.
• F 9:30 a.m.-10:45 a.m.
• F 11 a.m.-12:15 p.m.
• F 12:30 p.m.-1:45 p.m.
• F 2 p.m.-3:15 p.m.
• Instructor: Chris Murphy
  Info
• 1 points

AI in Context

AI IN CONTEXT

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.

• TR 11:40 a.m.-12:55 p.m.
• 3 points

Clean Object-Oriented Design

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.

• TR 2:40 p.m.-3:55 p.m.
• Instructor: Chris Murphy
  Info
• 3 points

DATA STRUCTURES IN 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.

• MW 4:10 p.m.-5:25 p.m.
• MW 5:40 p.m.-6:55 p.m.
• Instructor: Brian Borowski
  Info
• 3 points

ESSENTIAL DATA STRUCTURES

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.

• TR 5:40 p.m.-6:55 p.m.
• Instructor: Timothy K Paine
  CULPA: 4 Info
• 4 points

ADVANCED PROGRAMMING

C programming language and Unix systems programming. Also covers Git, Make, TCP/IP networking basics, C++ fundamentals.

• TR 4:10 p.m.-5:25 p.m.
• F 12:10 p.m.-2 p.m.
• Instructor: Jae W Lee
  CULPA: 42 Info
• 4 points

DISCRETE MATHEMATICS

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

• MW 2:40 p.m.-3:55 p.m.
• F 2:10 p.m.-4 p.m.
• Instructor: Tony B Dear
  CULPA: 17 Info
• 4 points

COMPUTATIONAL LINEAR ALGEBRA

• TR 2:40 p.m.-3:55 p.m.
• Instructor: Nakul Verma
  CULPA: 10 h-index: 16 Info
• 4 points

COMPUTER SCIENCE THEORY

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.

• TR 8:40 a.m.-9:55 a.m.
• TR 10:10 a.m.-11:25 a.m.
• Instructor: Toniann Pitassi
  Wikipedia Info
• 3 points

COMPUTERS AND SOCIETY

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

• W 4:10 p.m.-6:40 p.m.
• Instructor: Ronald Baecker
  Wikipedia Info
• 3 points

FUNDAMENTALS OF COMPUTER SYSTS

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.

• MW 1:10 p.m.-2:25 p.m.
• Instructor: Martha A Kim
  CULPA: 40 Info
• 3 points

INTRODUCTION TO DATABASES

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.

• MW 4:10 p.m.-5:25 p.m.
• F 10:10 a.m.-12:40 p.m.
• Instructor: Kenneth A Ross
  Info
• Instructor: Donald F Ferguson
  CULPA: 17 Wikipedia Info
• 3 points

FUND-LARGE-SCALE DIST SYSTEMS

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.

• F 10:10 a.m.-12:40 p.m.
• Instructor: Roxana Geambasu
  CULPA: 2 Wikipedia h-index: 20 Info
• 3 points

PROGRAMMING LANG & TRANSLATORS

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.

• M 1:10 p.m.-3:40 p.m.
• Instructor: Hubertus Franke
  Info
• 3 points

OPERATING SYSTEMS I

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.

• TR 4:10 p.m.-5:25 p.m.
• Instructor: Jason Nieh
  CULPA: 23 Wikipedia h-index: 50 Info
• 3 points

COMPUTER NETWORKS

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.

• MW 4:10 p.m.-5:25 p.m.
• Instructor: Henning G Schulzrinne
  CULPA: 12 Info
• 3 points

Engineering Software-as-a-Service

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.

• TR 8:40 a.m.-9:55 a.m.
• Instructor: Junfeng Yang
  CULPA: 4 h-index: 33 Info
• 3 points

Cloud Computing

CLOUD COMPUTING

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.

• F 1:10 p.m.-3:40 p.m.
• Instructor: Donald F Ferguson
  CULPA: 17 Wikipedia Info
• 3 points

ADVANCED SOFTWARE ENGINEERING

Software lifecycle using frameworks, libraries and services. Major emphasis on software testing. Centers on a team project.

• TR 10:10 a.m.-11:25 a.m.
• Instructor: Gail E Kaiser
  CULPA: 10 Info
• 3 points

COMPUTER GRAPHICS

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.

Due to significant overlap in content, only one of COMS 4160 or Barnard COMS 3160BC may be taken for credit.

• MW 10:10 a.m.-11:25 a.m.
• Instructor: Silvia Sellan
  Info
• 3 points

USER INTERFACE DESIGN

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.

• TR 11:40 a.m.-12:55 p.m.
• Instructor: Brian A Smith
  CULPA: 2 h-index: 5 Info
• 3 points

MALWARE ANALYSIS&REVERSE ENGINEERING

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.

• R 4:10 p.m.-6:40 p.m.
• Instructor: Michael S Sikorski
  CULPA: 2 Info
• 3 points

Networks, Crowds, and the Web

NETWORKS CROWDS AND THE W

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.

• TR 4:10 p.m.-5:25 p.m.
• Instructor: Augustin Chaintreau
  CULPA: 6 h-index: 33 Info
• 3 points

ANALYSIS OF ALGORITHMS I

Prerequisites: (COMS W3134 or COMS W3136COMS W3137) and (COMS 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.

• MW 8:40 a.m.-9:55 a.m.
• MW 1:10 p.m.-2:25 p.m.
• Instructor: Xi Chen
  CULPA: 7 Wikipedia h-index: 64 Info
• Instructor: Mihalis Yannakakis
  CULPA: 14 Wikipedia h-index: 93 Info
• 3 points

INTRO-COMPUTATIONAL COMPLEXITY

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.

• MW 10:10 a.m.-11:25 a.m.
• Instructor: Xi Chen
  CULPA: 7 Wikipedia h-index: 64 Info
• 3 points

ALGORITHMS FOR DATA SCIENCE

Methods for organizing data, e.g. hashing, trees, queues, lists,priority queues. Streaming algorithms for computing statistics on the data. Sorting and searching. Basic graph models and algorithms for searching, shortest paths, and matching. Dynamic programming. Linear and convex programming. Floating point arithmetic, stability of numerical algorithms, Eigenvalues, singular values, PCA, gradient descent, stochastic gradient descent, and block coordinate descent. Conjugate gradient, Newton and quasi-Newton methods. Large scale applications from signal processing, collaborative filtering, recommendations systems, etc.

• TR 11:40 a.m.-12:55 p.m.
• TR 1:10 p.m.-2:25 p.m.
• Instructor: Eleni Drinea
  CULPA: 8 Info
• 3 points

INTRO-COMPUTATIONAL LEARN THRY

• TR 11:40 a.m.-12:55 p.m.
• Instructor: Rocco Servedio
  CULPA: 15 h-index: 48 Info
• 3 points

INTRO TO CRYPTOGRAPHY

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.

• TR 2:40 p.m.-3:55 p.m.
• Instructor: Tal Malkin
  CULPA: 18 Wikipedia h-index: 45 Info
• 3 points

INTRO TO QUANTUM COMPUTING

• TR 10:10 a.m.-11:25 a.m.
• Instructor: Henry Yuen
  CULPA: 1 Info
• 3 points

PROGRAMMING & PROBLEM SOLVING

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.

• MW 1:10 p.m.-2:25 p.m.
• Instructor: Kenneth A Ross
  Info
• 3 points

PRIN-INNOVATN/ENTREPRENEURSHIP

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.

• MW 8:40 a.m.-9:55 a.m.
• Instructor: William Reinisch
  CULPA: 1 Info
• 3 points

ARTIFICIAL INTELLIGENCE

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.

• TR 10:10 a.m.-11:25 a.m.
• TR 11:40 a.m.-12:55 p.m.
• Instructor: Ansaf Salleb-Aouissi
  CULPA: 21 h-index: 16 Info
• 3 points

NATURAL LANGUAGE PROCESSING

Computational approaches to the analysis, understanding, and generation of natural language text at scale. Emphasis on machine learning techniques for NLP, including deep learning and large language models. Applications may include information extraction, sentiment analysis, question answering, summarization, machine translation, and conversational AI. Discussion of datasets, benchmarking and evaluation, interpretability, and ethical considerations.
Due to significant overlap in content, only one of COMS 4705 or Barnard COMS 3705BC may be taken for credit.

• MW 2:40 p.m.-3:55 p.m.
• TR 2:40 p.m.-3:55 p.m.
• Instructor: Daniel Bauer
  CULPA: 17 h-index: 13 Info
• Instructor: John Hewitt
  Info
• 3 points

Computer Vision I: First Principles

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.

• MW 5:40 p.m.-6:55 p.m.
• Instructor: Austin D Reiter
  Info
• 3 points

COMPUTATIONAL ASPECTS OF ROBOTICS

COMPUTATNL ASPECTS OF ROB

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.

• MW 2:40 p.m.-3:55 p.m.
• Instructor: Yunzhu Li
  Info
• 3 points

Machine Learning for Functional Genomics

ML for Functional Genomic

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.

• F 1:10 p.m.-3:40 p.m.
• Instructor: David A Knowles
  h-index: 35 Info
• 3 points

MACHINE LEARNING

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.

• TR 1:10 p.m.-2:25 p.m.
• TR 2:40 p.m.-3:55 p.m.
• Instructor: Daniel Hsu
  CULPA: 6 h-index: 44 Info
• 3 points

Unsupervised Learning

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.

• TR 1:10 p.m.-2:25 p.m.
• Instructor: Nakul Verma
  CULPA: 10 h-index: 16 Info
• 3 points

Causal Inference

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.

• MW 4:10 p.m.-5:25 p.m.
• Instructor: Elias Bareinboim
  h-index: 25 Info
• 3 points

Neural Networks & Deep Learning

NEURAL NETWORKS DEEP LEAR

Foundational concepts, methods, applications, and recent advances in neural network algorithms.

• TR 2:40 p.m.-3:55 p.m.
• Instructor: Richard Zemel
  Wikipedia Info
• 3 points

COMPUTER ARCHITECTURE

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.

• MW 10:10 a.m.-11:25 a.m.
• Instructor: Simha Sethumadhavan
  CULPA: 8 Info
• 3 points

SYSTEM-ON-CHIP PLATFORMS

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.

• TR 11:40 a.m.-12:55 p.m.
• Instructor: Luca Carloni
  CULPA: 2 Wikipedia h-index: 45 Info
• 3 points

TOPICS IN COMPUTER SCIENCE

DEEP LRNG FOR COMP VISION

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.

• TR 2:40 p.m.-3:55 p.m.
• Instructor: Peter Belhumeur
  CULPA: 6 h-index: 59 Info
• 3 points

TOPICS IN COMPUTER SCIENCE

HACKING 4 DEFENSE

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.

• T 4:10 p.m.-6:40 p.m.
• Instructor: Paul S Blaer
  CULPA: 46 h-index: 8 Info
• 3 points

TOPICS IN COMPUTER SCIENCE

THE QUANTUM INTERNET

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.

• T 10:10 a.m.-12:40 p.m.
• Instructor: Daniel S Rubenstein
  CULPA: 29 Info
• 3 points

TOPICS IN COMPUTER SCIENCE

DESIGN USING C++

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.

• F 10:10 a.m.-12:40 p.m.
• Instructor: Bjarne Stroustrup
  CULPA: 1 Wikipedia h-index: 38 Info
• 3 points

TOPICS IN COMPUTER SCIENCE

PARALLEL FUNCTIONAL PROGRAMMIN

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.

• MW 1:10 p.m.-2:25 p.m.
• Instructor: Stephen A Edwards
  CULPA: 21 h-index: 35 Info
• 3 points

TOPICS IN COMPUTER SCIENCE

C++ DEEP DIVE FOR C PRGS

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.

• MW 5:40 p.m.-6:55 p.m.
• Instructor: Hans J Montero
  Info
• 3 points

TOPICS IN COMPUTER SCIENCE

INNOVATION & DESIGN LAB

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.

• T 1:10 p.m.-3:40 p.m.
• Instructor: Gary Zamchick
  Info
• 3 points

TOPICS IN COMPUTER SCIENCE

COMPETITIVE PROGRAMMING

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.

• M 7 p.m.-9:30 p.m.
• Instructor: Yongwhan Lim
  Info
• 3 points

TOPICS IN COMPUTER SCIENCE

CASL MLTPLAYER GAME OCAML

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.

• F 1:10 p.m.-3:40 p.m.
• 3 points

TOPICS IN COMPUTER SCIENCE

NEURAL RENDERING GRAPHICS

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.

• MW 2:40 p.m.-3:55 p.m.
• Instructor: Corey Toler-Franklin
  Info
• 3 points

TOPICS IN COMPUTER SCIENCE

ELEMENTS FOR DATA SCIENCE

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.

• T 7 p.m.-9:30 p.m.
• Instructor: Andi Cupallari
  Info
• 3 points

TOPICS IN COMPUTER SCIENCE

APPLIED DEEP LEARNING

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.

• T 7 p.m.-9:30 p.m.
• Instructor: Andrei A Simion
  Info
• 3 points

Topics in Database Systems

AGENTIC SYSTEMS MADE REAL

• T 10:10 a.m.-noon
• Instructor: Junfeng Yang
  CULPA: 4 h-index: 33 Info
• 3 points

OPERATING SYSTEMS, II

• R 2:10 p.m.-4 p.m.
• Instructor: Jason Nieh
  CULPA: 23 Wikipedia h-index: 50 Info
• 3 points

Virtual Reality and Augmented Reality

Virtual and Augmented Rea

This course will cover selected topics in virtual reality (VR) and augmented reality (AR). There are two main components, with everyone participating in both: papers and projects.

• W 2:10 p.m.-4 p.m.
• Instructor: Steven K Feiner
  CULPA: 18 Wikipedia Info
• 3 points

MODELING & PERFORMANCE EVALUATION

Introduction to queuing analysis and simulation techniques. Evaluation of time-sharing and multiprocessor systems. Topics include priority queuing, buffer storage, and disk access, interference and bus contention problems, and modeling of program behaviors.

• W 4:10 p.m.-6 p.m.
• Instructor: Vishal Misra
  CULPA: 5 Wikipedia h-index: 53 Info
• 3 points

Advanced Spoken Language Processing

ADV SPOKEN LANG PROC

Applications of spoken language processing, including text-to-speech and dialogue systems. Analysis of speech and text, including entrainment, empathy, personality, emotion, humor, sarcasm, deception, trust, radicalization, and charisma.

• T 4:10 p.m.-6 p.m.
• Instructor: Julia Hirschberg
  CULPA: 8 h-index: 77 Info
• 3 points

FORMAL VERIF HW SW SYSTEMS

Introduction to the theory and practice of formal methods for the design and analysis of correct (i.e. bug-free) concurrent and embedded hardware/software systems. Topics include temporal logics; model checking; deadlock and liveness issues; fairness; satisfiability (SAT) checkers; binary decision diagrams (BDDs); abstraction techniques; introduction to commercial formal verification tools. Industrial state-of-art, case studies and experiences: software analysis (C/C++/Java), hardware verification (RTL).

• M 6:10 p.m.-8 p.m.
• 3 points

TOPICS IN COMPUTER SCIENCE

READINGS LANGUAGE DESIGN

Selected topics in computer science (advanced level). 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.

• R 2:10 p.m.-4 p.m.
• Instructor: Bjarne Stroustrup
  CULPA: 1 Wikipedia h-index: 38 Info
• 3 points

TOPICS IN COMPUTER SCIENCE

ALGORITHMS FOR MASSIVE DATA

Selected topics in computer science (advanced level). 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.

• MW 2:40 p.m.-3:55 p.m.
• Instructor: Alexandr Andoni
  CULPA: 2 h-index: 34 Info
• 3 points

TOPICS IN COMPUTER SCIENCE

TPCS QUANTUM CRYPTOGRAPHY

Selected topics in computer science (advanced level). 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.

• F 2:10 p.m.-4 p.m.
• Instructor: James L Bartusek
  Info
• 3 points