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 5:30 p.m.-8:40 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.

• TR 5:30 p.m.-8:40 p.m.
• Instructor: Timothy K Paine
  CULPA: 4 Info
• 3 points

DATA STRUCTURES IN JAVA

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

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

ADVANCED PROGRAMMING

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

• TR 5:40 p.m.-8:40 p.m.
• Instructor: Brian Borowski
  Info
• 4 points

DISCRETE MATHEMATICS

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

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

COMPUTATIONAL LINEAR ALGEBRA

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

COMPUTER SCIENCE THEORY

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

• MW 1 p.m.-4:10 p.m.
• 3 points

FUNDAMENTALS OF COMPUTER SYSTS

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.

• TR 9:30 a.m.-12:40 p.m.
• Instructor: Daniel S Rubenstein
  CULPA: 29 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 1 p.m.-4:10 p.m.
• Instructor: Alexandr Andoni
  CULPA: 2 h-index: 34 Info
• 3 points

NATURAL LANGUAGE PROCESSING

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

• TR 4:10 p.m.-7:20 p.m.
• Instructor: Daniel Bauer
  CULPA: 17 h-index: 13 Info
• 3 points

MACHINE LEARNING

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.

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

TOPICS IN COMPUTER SCIENCE

ML W/ APPLICATIONS IN FINANCE

Prerequisites: Instructor's permission. 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.

• MW 5:30 p.m.-8:40 p.m.
• Instructor: German G Creamer
  CULPA: 3 h-index: 15 Info
• 3 points

TOPICS IN COMPUTER SCIENCE

C++ FOR C PROGRAMMERS

Prerequisites: Instructor's permission. 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.

• TR 4:10 p.m.-7:20 p.m.
• Instructor: Jae W Lee
  CULPA: 42 Info
• 3 points

TOPICS IN COMPUTER SCIENCE

ARTIFICIAL GEN INTEL

Prerequisites: Instructor's permission. 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.

• MW 5:30 p.m.-8:40 p.m.
• Instructor: Iddo Drori
  CULPA: 3 h-index: 15 Info
• 3 points

TOPICS IN COMPUTER SCIENCE

ALGORITHM TO DEVEL

Prerequisites: Instructor's permission. 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.

• MW 5:30 p.m.-8:40 p.m.
• Instructor: Brian Borowski
  Info
• 3 points