INTRO-COMPUT SCI/PROG IN JAVA
INTRO-COMPUTER PROGRAM 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
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 1 p.m.-4:10 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 5:30 p.m.-8:40 p.m.
-
Instructor:
Paul S Blaer
CULPA: 46
h-index: 8
Info
- 3 points
ADVANCED PROGRAMMING
C programming language and Unix systems programming. Also covers Git, Make, TCP/IP networking basics, C++ fundamentals.
- TR 5:30 p.m.-8:40 p.m.
-
Instructor:
Brian Borowski
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).
- TR 10:10 a.m.-1:20 p.m.
-
Instructor:
Ansaf Salleb-Aouissi
CULPA: 21 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.
- MW 10:10 a.m.-1:20 p.m.
-
Instructor:
Xi Chen
CULPA: 7
Wikipedia
h-index: 64
Info
- 3 points
Mathematics for Machine Learning
MATH FOR MACHINE LEARNING
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.
- MW 1 p.m.-4:10 p.m.
-
Instructor:
Nakul Verma
CULPA: 10
h-index: 16
Info
- 3 points
From Algorithmic Thinking to Development
From Algorithms to Develo
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.
- TR 5:30 p.m.-8:40 p.m.
-
Instructor:
Brian Borowski
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
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.
- MW 4:20 p.m.-7:30 p.m.
-
Instructor:
Tony B Dear
CULPA: 17
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 4:10 p.m.-7:20 p.m.
-
Instructor:
Daniel Bauer
CULPA: 17
h-index: 13
Info
- 3 points
Ethical and Responsible AI
ETHIC AND RESPONSIBLE AI
Principles of Ethical Artificial Intelligence across technical and societal dimensions. Combines technical AI and machine learning implementations and ethical analysis. Students will learn to build, audit, and mitigate ethical risks in AI systems using tools like fairness libraries, explainability frameworks, and privacy-preserving techniques. Emphasizes coding, algorithmic critique, and real-world cases.
Topics include: foundations of AI ethics, fairness, interpretability, explainability, accountability, privacy, robustness, alignment, safety, and societal benefit.
Assessments include coding projects, bias auditing assignments, and ethical analysis papers.
- MW 10:10 a.m.-1:20 p.m.
-
Instructor:
Ansaf Salleb-Aouissi
CULPA: 21 h-index: 16 Info - 3 points
MACHINE LEARNING
Basic statistical principles and algorithmic paradigms of supervised machine learning.
Prerequisites:
Multivariable calculus (e.g. MATH1201 or MATH1205 or APMA2000), linear algebra (e.g. COMS3251 or MATH2010 or MATH2015), probability (e.g. STAT1201 or STAT4001 or IEOR3658 or MATH2015), discrete math (COMS3203), and general mathematical maturity. Programming and algorithm analysis (e.g. COMS 3134). COMS 3770 is recommended for students who wish to refresh their math background.
- TR 1 p.m.-4:10 p.m.
-
Instructor:
Nakul Verma
CULPA: 10
h-index: 16
Info
- 3 points
TOPICS IN COMPUTER SCIENCE
OPEN SOURCE DEVELOPMENT
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 p.m.-4:10 p.m.
-
Instructor:
Chris Murphy
Info - 3 points