Code | Title | Points |
---|---|---|
Linear Algebra Requirement: Select one of the following courses: | ||
COMPUTATIONAL LINEAR ALGEBRA (recommended) | ||
LINEAR ALGEBRA | ||
Linear Algebra and Probability | ||
Honors Linear Algebra | ||
INTRO TO APPLIED MATHEMATICS | ||
APPLIED MATH I: LINEAR ALGEBRA |
Code | Title | Points |
---|---|---|
Probability / Statistics Requirement: Select one of the following courses: | ||
Linear Algebra and Probability | ||
PROBABILITY FOR ENGINEERS | ||
CALC-BASED INTRO TO STATISTICS | ||
INTRODUCTION TO PROBABILITY AND STATISTICS | ||
NOTE: Math 2015 Linear Algebra and Probability may simultaneously satisfy both linear algebra and probability requirements without the need to take additional classes thus reducing the total number of points required. |
Code | Title | Points |
---|---|---|
INTRO TO COMP FOR ENG/APP SCI (recommended but not required) | ||
or | COMPUTING IN CONTEXT |
Code | Title | Points |
---|---|---|
First Year | ||
Introduction to Computer Science and Programming in Java | ||
or COMS W1007 | ||
Sophomore Year | ||
Data Structures in Java | ||
or | HONORS DATA STRUCTURES & ALGOL | |
ADVANCED PROGRAMMING | ||
DISCRETE MATHEMATICS | ||
Junior and Senior Year | ||
Complete the remaining required core courses: | ||
COMPUTER SCIENCE THEORY | ||
FUNDAMENTALS OF COMPUTER SYSTS |
Select three from the following list:
Code | Title | Points |
---|---|---|
INTRODUCTION TO DATABASES | ||
FUND-LARGE-SCALE DIST SYSTEMS | ||
PROGRAMMING LANG & TRANSLATORS | ||
OPERATING SYSTEMS I | ||
COMPUTER NETWORKS | ||
Engineering Software-as-a-Service | ||
ADVANCED SOFTWARE ENGINEERING | ||
COMPUTER GRAPHICS | ||
COMPUTER ANIMATION | ||
USER INTERFACE DESIGN | ||
SECURITY I | ||
ANALYSIS OF ALGORITHMS I | ||
INTRO-COMPUTATIONAL COMPLEXITY | ||
ARTIFICIAL INTELLIGENCE | ||
NATURAL LANGUAGE PROCESSING | ||
Computer Vision I: First Principles | ||
COMPUTATIONAL ASPECTS OF ROBOTICS | ||
COMPUTATIONAL GENOMICS | ||
MACHINE LEARNING | ||
COMPUTER ARCHITECTURE | ||
SYSTEM-ON-CHIP PLATFORMS |
Any three COMS courses or jointly offered computer science courses such as CSXX or XXCS course that are worth at least 3 points and are at the 3000 level or above. This includes 3000-level courses offered by Barnard CS.
Major in computational biology.
For a description of the joint major in computer science—Biology, see the Biological Sciences section in this bulletin.
For a description of the joint major in computer science—mathematics, see the Mathematics section in this bulletin.
The major in information science requires a minimum of 33 points, including a core requirement of five courses. Adjustments were made to the course lists below in March 2022.
The elective courses must be chosen with a faculty adviser to focus on the modeling and use of information within the context of a disciplinary theme. After discussing potential selections, students prepare a proposal of study that must be approved by the faculty adviser. In all cases, the six courses must be at the 3000 level or above, with at least three courses chosen from computer science. Following are some example programs. For more examples or templates for the program proposal, see a faculty adviser.
Note: In most cases, additional courses will be necessary as prerequisites in order to take some of the elective courses. This will depend on the student's proposed program of study.
Code | Title | Points |
---|---|---|
Introduction to Information Science | ||
Computing in Context | ||
Introduction to Computer Science and Programming in Java | ||
Clean Object-Oriented Design | ||
Data Structures in Java | ||
INTRODUCTION TO PROBABILITY AND STATISTICS |
Following are some suggested programs of instruction:
Students may focus on how humans use technology and how technology has changed society.
The requirements include:
Code | Title | Points |
---|---|---|
INTRODUCTION TO DATABASES | ||
USER INTERFACE DESIGN | ||
ARTIFICIAL INTELLIGENCE | ||
COMPUTERS AND SOCIETY | ||
METHODS FOR SOCIAL RESEARCH | ||
SEMINAR - PROBLEMS OF LAW & SOCIETY |
Students may focus on understanding information modeling together with existing and emerging needs in economics and finance as well as algorithms and systems to address those needs.
Code | Title | Points |
---|---|---|
INTRODUCTION TO DATABASES | ||
ARTIFICIAL INTELLIGENCE | ||
MACHINE LEARNING | ||
INTRODUCTION TO ECONOMETRICS | ||
FINANCIAL ECONOMICS | ||
MONEY AND BANKING |
Students may focus on understanding information modeling together with existing and emerging needs in health sciences, as well as algorithms and systems to address those needs.
Code | Title | Points |
---|---|---|
INTRODUCTION TO DATABASES | ||
USER INTERFACE DESIGN | ||
ARTIFICIAL INTELLIGENCE | ||
BINF G4001 | ||
Bioinformatics of Gene Expression | ||
ECBM E3060/E4060 |
In response to the ever-growing importance of "big data" in scientific and policy endeavors, the last few years have seen explosive growth in theory, methods, and applications at the interface between computer science and statistics. The statistics and computer science departments have responded with a joint major that emphasizes the interface between the disciplines.
Code | Title | Points |
---|---|---|
Prerequisites (15 points) | ||
CALCULUS I | ||
CALCULUS II | ||
CALCULUS III | ||
LINEAR ALGEBRA | ||
This introductory Statistics course: | ||
CALC-BASED INTRO TO STATISTICS | ||
Statistics (12 points) | ||
PROBABILITY THEORY | ||
STATISTICAL INFERENCE | ||
LINEAR REGRESSION MODELS | ||
STATISTICAL MACHINE LEARNING | ||
Machine Learning | ||
Computer Science (12 points) | ||
Select one of the following courses: | ||
Introduction to Computer Science and Programming in Java | ||
Introduction to Computer Science and Programming in MATLAB | ||
COMS W1007 | ||
INTRO TO COMP FOR ENG/APP SCI | ||
Select one of the following courses: | ||
Data Structures in Java | ||
ESSENTIAL DATA STRUCTURES | ||
HONORS DATA STRUCTURES & ALGOL | ||
Two required courses: | ||
DISCRETE MATHEMATICS | ||
ANALYSIS OF ALGORITHMS I | ||
Electives (15 points) | ||
Select two of the following courses: | ||
APPLIED MACHINE LEARNING | ||
STAT COMP & INTRO DATA SCIENCE | ||
BAYESIAN STATISTICS | ||
APPLIED DATA SCIENCE | ||
Advanced Machine Learning | ||
Select three of the following courses: | ||
COMPUTER SCIENCE THEORY | ||
INTRODUCTION TO DATABASES | ||
COMS W4130 | ||
INTRO-COMPUTATIONAL COMPLEXITY | ||
INTRO-COMPUTATIONAL LEARN THRY | ||
Any COMS W47xx course EXCEPT W4771 |
Students who pass the Computer Science Advanced Placement Exam A with a 4 or 5 will receive 3 points and an exemption from COMS W1004.
The Computer Science Minor consists of 6 courses as follows:
1. COMS W1004: Intro to computer science and programming in Java (3) or COMS W1007: Honors intro to comp sci (3)
2. COMS W3134: Data structures in Java (3) or COMS W3137: Honors data structures and algorithms (4)
3. COMS W3203: Discrete mathematics (4)
4. One course of the following:
COMS W3157: Advanced programming (4)
COMS W3261: Comp science theory (3)
CSEE W3827: Fundamentals of computer systems (3)
5. Any 3000-level or 4000-level COMS/CSXX/XXCS course of at least 3 points
6. Any 3000-level or 4000-level COMS/CSXX/XXCS course of at least 3 points OR one linear algebra or probability/statistics course from the following : APMA E3101, APMA E2101, MATH UN2010, MATH UN2015, IEOR E3658, STAT UN1201, STAT GU4001 or STAT GU4203 .
Concentration in computer science.
The concentration in computer science requires a minimum of 22-24 points, as follows:
Code | Title | Points |
---|---|---|
Introduction to Computer Science and Programming in Java | ||
or COMS W1007 | ||
Data Structures in Java | ||
or | HONORS DATA STRUCTURES & ALGOL | |
ADVANCED PROGRAMMING | ||
DISCRETE MATHEMATICS | ||
COMPUTER SCIENCE THEORY | ||
FUNDAMENTALS OF COMPUTER SYSTS (or any 3 point 4000-level computer science course) | ||
Select one of the following courses: | ||
COMPUTATIONAL LINEAR ALGEBRA | ||
LINEAR ALGEBRA | ||
Linear Algebra and Probability | ||
Honors Linear Algebra | ||
INTRO TO APPLIED MATHEMATICS | ||
APPLIED MATH I: LINEAR ALGEBRA | ||
PROBABILITY FOR ENGINEERS | ||
CALC-BASED INTRO TO STATISTICS | ||
INTRODUCTION TO PROBABILITY AND STATISTICS |
COMS W1001 Introduction to Information Science. 3 points .
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
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 1002 | 001/11915 | T Th 1:10pm - 2:25pm 417 International Affairs Bldg | Adam Cannon | 4.00 | 73/160 |
COMS 1002 | 002/11916 | T Th 1:10pm - 2:25pm 330 Uris Hall | Adam Cannon, Eugenia Antic | 4.00 | 19/60 |
COMS 1002 | 003/11917 | T Th 2:40pm - 3:55pm 417 International Affairs Bldg | Adam Cannon | 4.00 | 147/300 |
COMS 1002 | 004/11918 | T Th 2:40pm - 3:55pm 415 Schapiro Cepser | Adam Cannon, Philippe Chlenski | 4.00 | 27/40 |
COMS W1003 INTRO-COMPUT SCI/PROGRAM IN C. 3.00 points .
COMS W1004 Introduction to Computer Science and Programming in Java. 3 points .
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 .
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 1004 | 001/11451 | T Th 11:40am - 12:55pm 417 International Affairs Bldg | Adam Cannon | 3 | 123/398 |
COMS 1004 | 002/12052 | T Th 1:10pm - 2:25pm 417 International Affairs Bldg | Adam Cannon | 3 | 116/398 |
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
COMS 1004 | 001/11919 | M W 2:40pm - 3:55pm 309 Havemeyer Hall | Paul Blaer | 3 | 158/320 |
COMS 1004 | 002/11920 | M W 5:40pm - 6:55pm 417 International Affairs Bldg | Paul Blaer | 3 | 107/320 |
COMS W1005 Introduction to Computer Science and Programming in MATLAB. 3 points .
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 .
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 1012 | 001/11921 | Th 7:10pm - 8:00pm 227 Seeley W. Mudd Building | Adam Cannon | 0.00 | 0/40 |
COMS 1012 | 002/11922 | Th 7:10pm - 8:00pm 644 Seeley W. Mudd Building | Adam Cannon | 0.00 | 0/40 |
COMS 1012 | 003/11923 | F 10:10am - 11:00am 307 Uris Hall | Adam Cannon | 0.00 | 0/40 |
COMS 1012 | 004/11924 | F 2:00pm - 2:50pm 307 Uris Hall | Adam Cannon | 0.00 | 0/40 |
COMS 1012 | 005/11925 | Th 7:10pm - 8:00pm 415 Schapiro Cepser | Adam Cannon | 0.00 | 0/40 |
COMS 1012 | 006/11926 | Th 7:10pm - 8:00pm 825 Seeley W. Mudd Building | Adam Cannon | 0.00 | 0/40 |
COMS 1012 | 007/11927 | F 9:00am - 9:50am 307 Uris Hall | Adam Cannon | 0.00 | 0/40 |
COMS 1012 | 008/11928 | Th 7:10pm - 8:00pm 401 Chandler | Adam Cannon | 0.00 | 0/30 |
COMS 1012 | 009/11929 | F 10:10am - 11:00am 608 Schermerhorn Hall | Adam Cannon | 0.00 | 0/30 |
COMS 1012 | 010/11930 | Th 7:10pm - 8:00pm 233 Seeley W. Mudd Building | Adam Cannon | 0.00 | 0/30 |
COMS 1012 | 011/11931 | F 11:00am - 11:50am 307 Uris Hall | Adam Cannon | 0.00 | 0/30 |
COMS W1103 HONORS INTRO COMPUTER SCIENCE. 3.00 points .
COMS W1404 EMERGING SCHOLARS PROG SEMINAR. 1.00 point .
Pass/Fail only.
Prerequisites: the instructor's permission. Corequisites: COMS W1002 or COMS W1004 or COMS W1007 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
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 1404 | 001/12053 | F 8:40am - 9:55am 502 Northwest Corner | Adam Cannon | 1.00 | 6/16 |
COMS 1404 | 002/12054 | F 10:10am - 11:25am 502 Northwest Corner | Adam Cannon | 1.00 | 3/16 |
COMS 1404 | 003/12055 | F 11:40am - 12:55pm 502 Northwest Corner | Adam Cannon | 1.00 | 0/16 |
COMS 1404 | 004/12056 | F 1:10pm - 2:25pm 502 Northwest Corner | Adam Cannon | 1.00 | 4/16 |
COMS 1404 | 005/12057 | F 2:40pm - 3:55pm 502 Northwest Corner | Adam Cannon | 1.00 | 6/16 |
COMS 1404 | 006/12058 | F 4:10pm - 5:25pm 502 Northwest Corner | Adam Cannon | 1.00 | 3/16 |
COMS 1404 | 007/12059 | F 9:30am - 10:45am 253 Engineering Terrace | Adam Cannon | 1.00 | 0/16 |
COMS 1404 | 008/12061 | F 11:00am - 12:15pm 253 Engineering Terrace | Adam Cannon | 1.00 | 5/16 |
COMS 1404 | 009/12063 | F 12:30pm - 1:45pm 253 Engineering Terrace | Adam Cannon | 1.00 | 9/16 |
COMS 1404 | 010/12064 | F 2:00pm - 3:15pm 253 Engineering Terrace | Adam Cannon | 1.00 | 3/16 |
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
COMS 1404 | 001/11996 | F 8:40am - 9:55am 253 Engineering Terrace | Adam Cannon | 1.00 | 0/16 |
COMS 1404 | 002/11997 | F 10:10am - 11:25am 253 Engineering Terrace | Adam Cannon | 1.00 | 0/16 |
COMS 1404 | 003/11998 | F 11:40am - 12:55pm 253 Engineering Terrace | Adam Cannon | 1.00 | 0/16 |
COMS 1404 | 004/11999 | F 1:10pm - 2:25pm 253 Engineering Terrace | Adam Cannon | 1.00 | 0/16 |
COMS 1404 | 005/12000 | F 2:40pm - 3:55pm 253 Engineering Terrace | Adam Cannon | 1.00 | 0/16 |
COMS 1404 | 006/12001 | F 4:10pm - 5:25pm 337 Seeley W. Mudd Building | Adam Cannon | 1.00 | 0/16 |
COMS 1404 | 007/12002 | F 9:30am - 10:45am 337 Seeley W. Mudd Building | Adam Cannon | 1.00 | 0/16 |
COMS 1404 | 008/12003 | F 11:00am - 12:15pm 337 Seeley W. Mudd Building | Adam Cannon | 1.00 | 0/16 |
COMS 1404 | 009/12004 | F 12:30pm - 1:45pm 337 Seeley W. Mudd Building | Adam Cannon | 1.00 | 0/16 |
COMS 1404 | 010/12005 | F 2:00pm - 3:15pm 337 Seeley W. Mudd Building | Adam Cannon | 1.00 | 0/16 |
COMS W2702 AI in Context. 3.00 points .
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
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 2702 | 001/20900 | M W 10:10am - 11:25am 833 Seeley W. Mudd Building | Chris Wiggins, Vishal Misra, Katja Vogt, Adam Cannon, Dennis Tenen, Seth Cluett | 3.00 | 1/120 |
COMS W3011 INTERMED COMPUTER PROGRAMMING. 3.00 points .
COMS W3101 PROGRAMMING LANGUAGES. 1.00 point .
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
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 3102 | 001/12065 | F 6:10pm - 8:00pm 451 Computer Science Bldg | Shoaib Ahamed | 1.00-2.00 | 62/70 |
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 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 .
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
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 3132 | 001/15110 | F 1:10pm - 3:40pm 413 Kent Hall | Jan Janak | 4.00 | 60/60 |
COMS W3134 Data Structures in Java. 3 points .
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 .
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 3134 | 001/12067 | M W 4:10pm - 5:25pm 301 Uris Hall | Brian Borowski | 3 | 227/250 |
COMS 3134 | 002/12068 | M W 5:40pm - 6:55pm 301 Uris Hall | Brian Borowski | 3 | 144/250 |
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
COMS 3134 | 001/11932 | M W 4:10pm - 5:25pm 301 Uris Hall | Brian Borowski | 3 | 172/200 |
COMS 3134 | 002/11933 | M W 5:40pm - 6:55pm 301 Uris Hall | Brian Borowski | 3 | 119/200 |
COMS W3136 ESSENTIAL DATA STRUCTURES. 4.00 points .
Prerequisites: ( COMS W1004 ) or ( COMS W1005 ) or (COMS W1007) or ( ENGI E1006 ) 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
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 3136 | 001/15424 | T Th 5:40pm - 6:55pm 141 Uris Hall | Timothy Paine | 4.00 | 35/65 |
COMS W3137 HONORS DATA STRUCTURES & ALGOL. 4.00 points .
Prerequisites: ( 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 .
Prerequisites: ( COMS W3134 ) or ( COMS W3137 ) C programming language and Unix systems programming. Also covers Git, Make, TCP/IP networking basics, C fundamentals
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 3157 | 001/12069 | T Th 4:10pm - 5:25pm 417 International Affairs Bldg | Jae Lee | 4.00 | 295/398 |
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
COMS 3157 | 001/11934 | T Th 4:10pm - 5:25pm 417 International Affairs Bldg | Jae Lee | 4.00 | 396/398 |
COMS W3202 FINITE MATHEMATICS. 3.00 points .
COMS W3203 DISCRETE MATHEMATICS. 4.00 points .
Prerequisites: Any introductory course in computer programming. Logic and formal proofs, sequences and summation, mathematical induction, binomial coefficients, elements of finite probability, recurrence relations, equivalence relations and partial orderings, and topics in graph theory (including isomorphism, traversability, planarity, and colorings)
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 3203 | 001/12070 | T Th 10:10am - 11:25am 301 Uris Hall | Ansaf Salleb-Aouissi | 4.00 | 215/200 |
COMS 3203 | 002/12071 | T Th 11:40am - 12:55pm 301 Uris Hall | Ansaf Salleb-Aouissi | 4.00 | 207/200 |
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
COMS 3203 | 001/11935 | M W 4:10pm - 5:25pm 301 Pupin Laboratories | Tony Dear | 4.00 | 188/270 |
COMS W3210 Scientific Computation. 3 points .
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 .
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
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 3261 | 001/12072 | M W 2:40pm - 3:55pm 417 International Affairs Bldg | Josh Alman | 3.00 | 130/150 |
COMS 3261 | 022/12073 | T Th 11:40am - 12:55pm 501 Northwest Corner | Mihalis Yannakakis | 3.00 | 152/160 |
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
COMS 3261 | 001/11936 | T Th 8:40am - 9:55am 451 Computer Science Bldg | Tal Malkin | 3.00 | 107/105 |
COMS 3261 | 002/11937 | T Th 10:10am - 11:25am 451 Computer Science Bldg | Tal Malkin | 3.00 | 105/105 |
COMS W3410 COMPUTERS AND SOCIETY. 3.00 points .
Broader impact of computers. Social networks and privacy. Employment, intellectual property, and the media. Science and engineering ethics. Suitable for nonmajors
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 3410 | 001/11938 | W 4:10pm - 6:40pm 303 Uris Hall | Ronald Baecker | 3.00 | 60/60 |
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 .
COMS W3995 Special Topics in Computer Science. 3 points .
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.
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 .
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 .
Prerequisites: 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 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 The fundamentals of database design and application development using databases: entity-relationship modeling, logical design of relational databases, relational data definition and manipulation languages, SQL, XML, query processing, physical database tuning, transaction processing, security. Programming projects are required
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 4111 | 001/12074 | M W 2:40pm - 3:55pm 309 Havemeyer Hall | Kenneth Ross | 3.00 | 126/200 |
COMS 4111 | 002/12075 | F 10:10am - 12:40pm 417 International Affairs Bldg | Donald Ferguson | 3.00 | 398/398 |
COMS 4111 | V02/20370 | | Donald Ferguson | 3.00 | 18/99 |
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
COMS 4111 | 001/11939 | T Th 10:10am - 11:25am 207 Mathematics Building | Luis Gravano | 3.00 | 165/150 |
COMS 4111 | 002/11940 | T Th 8:40am - 9:55am 301 Uris Hall | Eugene Wu | 3.00 | 47/150 |
COMS 4111 | 003/11941 | F 10:10am - 12:40pm 309 Havemeyer Hall | Donald Ferguson | 3.00 | 219/200 |
COMS 4111 | V03/18703 | | Donald Ferguson | 3.00 | 18/99 |
COMS W4112 DATABASE SYSTEM IMPLEMENTATION. 3.00 points .
Prerequisites: ( COMS W4111 ) and 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 ) 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
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 4113 | 001/11942 | F 10:10am - 12:40pm 451 Computer Science Bldg | Roxana Geambasu | 3.00 | 117/110 |
COMS 4113 | V01/17521 | | Roxana Geambasu | 3.00 | 10/99 |
COMS E4115 PROGRAMMING LANG & TRANSL. 3.00 points .
COMS W4115 PROGRAMMING LANG & TRANSLATORS. 3.00 points .
Prerequisites: ( COMS W3134 or COMS W3136 or COMS W3137 ) and ( COMS W3261 ) and ( CSEE W3827 ) or equivalent, or the instructor's permission. Modern programming languages and compiler design. Imperative, object-oriented, declarative, functional, and scripting languages. Language syntax, control structures, data types, procedures and parameters, binding, scope, run-time organization, and exception handling. Implementation of language translation tools including compilers and interpreters. Lexical, syntactic and semantic analysis; code generation; introduction to code optimization. Teams implement a language and its compiler
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 4115 | 001/12077 | M W 4:10pm - 5:25pm 501 Schermerhorn Hall | Ronghui Gu | 3.00 | 72/120 |
COMS 4115 | V01/15375 | | Ronghui Gu | 3.00 | 11/99 |
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
COMS 4115 | 001/11943 | T Th 11:40am - 12:55pm 451 Computer Science Bldg | Baishakhi Ray | 3.00 | 84/100 |
COMS 4115 | V01/18705 | | Baishakhi Ray | 3.00 | 5/99 |
COMS W4118 OPERATING SYSTEMS I. 3.00 points .
Prerequisites: ( CSEE W3827 ) and knowledge of C and programming tools as covered in COMS W3136 , W3157 , or W3101, or the instructor's permission. Design and implementation of operating systems. Topics include process management, process synchronization and interprocess communication, memory management, virtual memory, interrupt handling, processor scheduling, device management, I/O, and file systems. Case study of the UNIX operating system. A programming project is required
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 4118 | 001/12079 | T Th 4:10pm - 5:25pm 501 Northwest Corner | Kostis Kaffes | 3.00 | 88/160 |
COMS 4118 | V01/18798 | | Kostis Kaffes | 3.00 | 4/99 |
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
COMS 4118 | 001/11944 | T Th 4:10pm - 5:25pm 501 Northwest Corner | Jason Nieh | 3.00 | 122/160 |
COMS 4118 | V01/17522 | | Jason Nieh | 3.00 | 5/99 |
COMS W4119 COMPUTER NETWORKS. 3.00 points .
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: 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 .
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 .
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
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 4153 | 001/14010 | F 1:10pm - 3:40pm 309 Havemeyer Hall | Donald Ferguson | 3.00 | 218/200 |
COMS 4153 | V01/18778 | | Donald Ferguson | 3.00 | 17/99 |
COMS W4156 ADVANCED SOFTWARE ENGINEERING. 3.00 points .
Prerequisites: ( COMS W3157 ) or equivalent. Software lifecycle using frameworks, libraries and services. Major emphasis on software testing. Centers on a team project
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 4156 | 001/11945 | T Th 10:10am - 11:25am 833 Seeley W. Mudd Building | Gail Kaiser | 3.00 | 130/120 |
COMS 4156 | V01/17608 | | Gail Kaiser | 3.00 | 6/99 |
COMS W4160 COMPUTER GRAPHICS. 3.00 points .
Prerequisites: ( COMS W3134 ) or ( COMS W3136 ) or ( COMS W3137 ) COMS W4156 is recommended. Strong programming background and some mathematical familiarity including linear algebra is required. Introduction to computer graphics. Topics include 3D viewing and projections, geometric modeling using spline curves, graphics systems such as OpenGL, lighting and shading, and global illumination. Significant implementation is required: the final project involves writing an interactive 3D video game in OpenGL
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 4160 | 001/13865 | T Th 7:10pm - 8:25pm 451 Computer Science Bldg | Hadi Fadaifard | 3.00 | 64/75 |
COMS W4162 Advanced Computer Graphics. 3 points .
Prerequisites: ( COMS W4160 ) or equivalent, or the instructor's permission.
A second course in computer graphics covering more advanced topics including image and signal processing, geometric modeling with meshes, advanced image synthesis including ray tracing and global illumination, and other topics as time permits. Emphasis will be placed both on implementation of systems and important mathematical and geometric concepts such as Fourier analysis, mesh algorithms and subdivision, and Monte Carlo sampling for rendering. Note: Course will be taught every two years.
COMS W4165 COMPUT TECHNIQUES-PIXEL PROCSS. 3.00 points .
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 .
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).
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 4167 | 001/12080 | T Th 4:10pm - 5:25pm 451 Computer Science Bldg | Changxi Zheng | 3.00 | 46/75 |
COMS W4170 USER INTERFACE DESIGN. 3.00 points .
Prerequisites: ( 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
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 4170 | 001/12081 | M W 1:10pm - 2:25pm 417 International Affairs Bldg | Lydia Chilton | 3.00 | 412/398 |
COMS 4170 | V01/15381 | | Lydia Chilton | 3.00 | 20/20 |
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
COMS 4170 | 001/11946 | T Th 1:10pm - 2:25pm 833 Seeley W. Mudd Building | Brian Smith | 3.00 | 0/120 |
COMS 4170 | V01/17523 | | Brian Smith | 3.00 | 0/99 |
COMS W4172 3D UI AND AUGMENTED REALITY. 3.00 points .
Prerequisites: ( COMS W4160 ) or ( COMS W4170 ) or the instructor's permission. Design, development, and evaluation of 3D user interfaces. Interaction techniques and metaphors, from desktop to immersive. Selection and manipulation. Travel and navigation. Symbolic, menu, gestural, and multimodal interaction. Dialogue design. 3D software support. 3D interaction devices and displays. Virtual and augmented reality. Tangible user interfaces. Review of relevant 3D math
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 4172 | 001/12082 | T Th 1:10pm - 2:25pm 227 Seeley W. Mudd Building | Steven Feiner | 3.00 | 35/45 |
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
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 4181 | 001/11947 | M W 1:10pm - 2:25pm 1127 Seeley W. Mudd Building | Suman Jana | 3.00 | 63/60 |
COMS 4181 | V01/17631 | | Suman Jana | 3.00 | 5/5 |
COMS W4182 SECURITY II. 3.00 points .
Prerequisites: COMS W4181 , COMS W4118 , COMS 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
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 4182 | 001/12083 | F 1:10pm - 3:40pm 1127 Seeley W. Mudd Building | John Koh | 3.00 | 21/40 |
COMS 4182 | V01/15421 | | John Koh | 3.00 | 2/99 |
COMS W4186 MALWARE ANALYSIS&REVERSE ENGINEERING. 3.00 points .
Prerequisites: COMS W3157 or equivalent. COMS W3827 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
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 4186 | 001/12324 | Th 4:10pm - 6:40pm 545 Seeley W. Mudd Building | Michael Sikorski | 3.00 | 38/40 |
COMS 4186 | V01/18706 | | Michael Sikorski | 3.00 | 8/99 |
COMS W4203 Graph Theory. 3 points .
Prerequisites: ( COMS W3203 )
General introduction to graph theory. Isomorphism testing, algebraic specification, symmetries, spanning trees, traversability, planarity, drawings on higher-order surfaces, colorings, extremal graphs, random graphs, graphical measurement, directed graphs, Burnside-Polya counting, voltage graph theory.
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 4203 | 001/20497 | W 7:00pm - 9:30pm 451 Computer Science Bldg | Yihao Zhang | 3 | 24/60 |
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 .
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
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 4223 | 001/15083 | T Th 4:10pm - 5:25pm 833 Seeley W. Mudd Building | Augustin Chaintreau | 3.00 | 69/110 |
COMS 4223 | V01/18856 | | Augustin Chaintreau | 3.00 | 14/99 |
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 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
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 4232 | 001/12084 | M W 2:40pm - 3:55pm 633 Seeley W. Mudd Building | Alexandr Andoni | 3.00 | 43/100 |
COMS 4232 | V01/15422 | | Alexandr Andoni | 3.00 | 2/99 |
COMS W4236 INTRO-COMPUTATIONAL COMPLEXITY. 3.00 points .
Prerequisites: ( 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
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 4236 | 001/11948 | M W 8:40am - 9:55am 451 Computer Science Bldg | Xi Chen | 3.00 | 55/50 |
COMS 4236 | V01/17552 | | Xi Chen | 3.00 | 5/99 |
COMS W4241 Numerical Algorithms and Complexity. 3 points .
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 .
Prerequisites: ( CSOR W4231 ) or ( COMS W4236 ) or COMS W3203 and the instructor's permission, or COMS W3261 and the instructor's permission.
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 .
Prerequisites: 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 .
Prerequisites: Knowledge of linear algebra. Prior knowledge of quantum mechanics is not required although helpful.
Introduction to quantum computing. Shor's factoring algorithm, Grover's database search algorithm, the quantum summation algorithm. Relationship between classical and quantum computing. Potential power of quantum computers.
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 4281 | 001/11949 | M W 10:10am - 11:25am 209 Havemeyer Hall | Henry Yuen | 3.00 | 11/90 |
COMS W4419 INTERNET TECHNOLOGY,ECONOMICS,AND POLICY. 3.00 points .
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 .
Prerequisites: ( COMS W3134 or 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
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 4444 | 001/11950 | M W 1:10pm - 2:25pm 337 Seeley W. Mudd Building | Kenneth Ross | 3.00 | 0/33 |
COMS W4460 PRIN-INNOVATN/ENTREPRENEURSHIP. 3.00 points .
Prerequisites: ( COMS W3134 or COMS W3136 or COMS W3137 ) or the 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
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 4460 | 001/12085 | M W 8:40am - 9:55am 415 Schapiro Cepser | William Reinisch | 3.00 | 34/40 |
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
COMS 4460 | 001/13626 | F 10:10am - 12:40pm 829 Seeley W. Mudd Building | William Reinisch | 3.00 | 39/40 |
COMS W4701 ARTIFICIAL INTELLIGENCE. 3.00 points .
Prerequisites: ( COMS W3134 or COMS W3136 or COMS W3137 ) and any course on probability. Prior knowledge of Python is recommended. 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
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 4701 | 001/12086 | M W 2:40pm - 3:55pm 501 Northwest Corner | Tony Dear | 3.00 | 90/164 |
COMS 4701 | 002/12087 | M W 4:10pm - 5:25pm 501 Northwest Corner | Tony Dear | 3.00 | 102/164 |
COMS 4701 | V01/17158 | | Tony Dear | 3.00 | 8/99 |
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
COMS 4701 | 001/11951 | T Th 10:10am - 11:25am 501 Schermerhorn Hall | Ansaf Salleb-Aouissi | 3.00 | 197/180 |
COMS 4701 | 002/11952 | T Th 11:40am - 12:55pm 501 Schermerhorn Hall | Ansaf Salleb-Aouissi | 3.00 | 196/180 |
COMS 4701 | V01/17524 | | Ansaf Salleb-Aouissi | 3.00 | 20/99 |
COMS W4705 NATURAL LANGUAGE PROCESSING. 3.00 points .
Prerequisites: ( COMS W3134 or COMS W3136 or COMS W3137 ) or the instructor's permission. Computational approaches to natural language generation and understanding. Recommended preparation: some previous or concurrent exposure to AI or Machine Learning. Topics include information extraction, summarization, machine translation, dialogue systems, and emotional speech. Particular attention is given to robust techniques that can handle understanding and generation for the large amounts of text on the Web or in other large corpora. Programming exercises in several of these areas
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 4705 | 001/12088 | M W 2:40pm - 3:55pm 451 Computer Science Bldg | Daniel Bauer | 3.00 | 110/110 |
COMS 4705 | 002/12090 | F 10:10am - 12:40pm 301 Pupin Laboratories | Daniel Bauer | 3.00 | 205/272 |
COMS 4705 | V02/15423 | | Daniel Bauer | 3.00 | 18/99 |
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
COMS 4705 | 001/11953 | F 10:10am - 12:40pm 417 International Affairs Bldg | Daniel Bauer | 3.00 | 223/240 |
COMS 4705 | 002/11954 | M W 4:10pm - 5:25pm 451 Computer Science Bldg | Zhou Yu | 3.00 | 45/100 |
COMS 4705 | V01/17525 | | Daniel Bauer | 3.00 | 21/99 |
COMS W4706 Spoken Language Processing. 3 points .
Prerequisites: ( COMS W3134 or COMS W3136 or COMS 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 .
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 4721 | 001/12843 | F 1:10pm - 3:40pm 501 Schermerhorn Hall | Robert Kramer, Nakul Verma | 3.00 | 171/189 |
COMS 4721 | V01/16718 | | Nakul Verma | 3.00 | 2/99 |
COMS W4725 Knowledge representation and reasoning. 3 points .
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 .
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
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 4731 | 001/11955 | M W 10:10am - 11:25am 451 Computer Science Bldg | Shree Nayar | 3.00 | 110/100 |
COMS W4732 Computer Vision II: Learning. 3.00 points .
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
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 4732 | 001/12091 | F 10:10am - 12:40pm 451 Computer Science Bldg | Carl Vondrick | 3.00 | 109/100 |
COMS 4732 | V01/15424 | | Carl Vondrick | 3.00 | 46/99 |
COMS W4733 COMPUTATIONAL ASPECTS OF ROBOTICS. 3.00 points .
Prerequisites: ( COMS W3134 or COMS W3136COMS W3137) 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
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 4733 | 001/14014 | F 1:10pm - 3:40pm 501 Northwest Corner | Tony Dear | 3.00 | 95/164 |
COMS 4733 | V01/18546 | | Tony Dear | 3.00 | 5/99 |
COMS W4735 VISUAL INTERFACES TO COMPUTERS. 3.00 points .
Prerequisites: ( 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 .
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
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
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 4762 | 001/11956 | F 1:10pm - 3:40pm 451 Computer Science Bldg | David Knowles | 3.00 | 8/100 |
COMS W4771 MACHINE LEARNING. 3.00 points .
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
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 4771 | 001/12092 | T Th 1:10pm - 2:25pm 451 Computer Science Bldg | Nakul Verma | 3.00 | 73/110 |
COMS 4771 | 002/12093 | T Th 2:40pm - 3:55pm 451 Computer Science Bldg | Nakul Verma | 3.00 | 78/110 |
COMS 4771 | V01/16720 | | Nakul Verma | 3.00 | 5/99 |
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
COMS 4771 | 001/11957 | T Th 2:40pm - 3:55pm 451 Computer Science Bldg | Nakul Verma | 3.00 | 0/110 |
COMS 4771 | V01/17526 | | Nakul Verma | 3.00 | 0/99 |
COMS W4772 ADVANCED MACHINE LEARNING. 3.00 points .
Prerequisites: ( COMS W4771 ) or 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.
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
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 4773 | 001/12094 | T Th 8:40am - 9:55am 451 Computer Science Bldg | Daniel Hsu | 3.00 | 34/60 |
COMS W4774 Unsupervised Learning. 3.00 points .
Prerequisites: Solid background in multivariate calculus, linear algebra, basic probability, and algorithms.
Prerequisites: see notes re: points 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
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 4774 | 001/11958 | T Th 1:10pm - 2:25pm 451 Computer Science Bldg | Nakul Verma | 3.00 | 0/50 |
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 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
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 4775 | 001/11959 | M W 4:10pm - 5:25pm 616 Martin Luther King Building | Elias Bareinboim | 3.00 | 33/50 |
COMS E4775 Causal Inference. 3 points .
Prerequisites: (COMS4711W) and 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 W4776 Machine Learning for Data Science. 3 points .
Prerequisites: ( STAT GU4001 or IEOR E4150 ) and linear algebra.
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 .
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 .
Prerequisites: Instructor's permission. 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
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
COMS 4995 | 001/12095 | T Th 8:40am - 9:55am 1024 Seeley W. Mudd Building | Andrew Blumberg | 3.00 | 26/40 |
COMS 4995 | 002/12096 | M W 5:40pm - 6:55pm 1024 Seeley W. Mudd Building | Yongwhan Lim | 3.00 | 11/50 |
COMS 4995 | 003/12098 | Th 4:10pm - 6:40pm 1127 Seeley W. Mudd Building | Christian Swinehart | 3.00 | 33/40 |
COMS 4995 | 004/12099 | T Th 5:40pm - 6:55pm 451 Computer Science Bldg | Austin Reiter | 3.00 | 95/110 |
COMS 4995 | 005/12101 | F 10:10am - 12:40pm 1127 Seeley W. Mudd Building | Michelle Levine | 3.00 | 24/40 |
COMS 4995 | 006/12102 | T 1:10pm - 3:40pm 1127 Seeley W. Mudd Building | Gary Zamchick | 3.00 | 39/40 |
COMS 4995 | 008/12104 | W 4:10pm - 6:40pm 451 Computer Science Bldg | Jae Lee, Hans Montero | 3.00 | 74/110 |
COMS 4995 | 030/12956 | T 7:00pm - 9:30pm 413 Kent Hall | Adam Kelleher | 3.00 | 63/70 |
COMS 4995 | 032/12965 | W 4:10pm - 6:40pm 329 Pupin Laboratories | Vijay Pappu | 3.00 | 101/100 |
COMS 4995 | V01/18718 | | Andrew Blumberg | 3.00 | 0/99 |
COMS 4995 | V02/15425 | | Yongwhan Lim | 3.00 | 0/99 |
COMS 4995 | V08/16721 | | Jae Lee, Hans Montero | 3.00 | 2/99 |
COMS 4995 | V32/20861 | | Vijay Pappu | 3.00 | 20/99 |
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
COMS 4995 | 001/11960 | T 4:10pm - 6:40pm 829 Seeley W. Mudd Building | Paul Blaer, Jason Cahill | 3.00 | 0/40 |
COMS 4995 | 002/11961 | F 10:10am - 12:40pm 644 Seeley W. Mudd Building | Bjarne Stroustrup | 3.00 | 26/33 |
COMS 4995 | 003/11962 | M W 1:10pm - 2:25pm 633 Seeley W. Mudd Building | Stephen Edwards | 3.00 | 41/70 |
COMS 4995 | 004/11963 | W 4:10pm - 6:40pm 833 Seeley W. Mudd Building | Jae Lee, Hans Montero | 3.00 | 39/110 |
COMS 4995 | 005/11964 | T Th 2:40pm - 3:55pm 428 Pupin Laboratories | Peter Belhumeur | 3.00 | 138/125 |
COMS 4995 | 006/11965 | T Th 5:40pm - 6:55pm 644 Seeley W. Mudd Building | Itsik Pe'er | 3.00 | 7/40 |
COMS 4995 | 007/11966 | T Th 5:40pm - 6:55pm 451 Computer Science Bldg | Yongwhan Lim | 3.00 | 4/100 |
COMS 4995 | 008/11967 | T 1:10pm - 3:40pm 829 Seeley W. Mudd Building | Gary Zamchick | 3.00 | 44/40 |
COMS 4995 | 009/11968 | W 10:10am - 12:40pm 415 Schapiro Cepser | Michelle Levine | 3.00 | 9/40 |
COMS 4995 | 010/11969 | Th 4:10pm - 6:40pm 633 Seeley W. Mudd Building | Homayoon Beigi | 3.00 | 25/60 |
COMS 4995 | 011/13628 | T Th 4:10pm - 5:25pm 451 Computer Science Bldg | Hugh Thomas | 3.00 | 100/100 |
COMS 4995 | 012/15929 | W 7:00pm - 9:30pm 451 Computer Science Bldg | Yihao Zhang | 3.00 | 18/50 |
COMS 4995 | 030/13530 | M 7:00pm - 9:30pm 833 Seeley W. Mudd Building | Andi Cupallari | 3.00 | 45/120 |
COMS 4995 | 031/13532 | W 7:00pm - 9:30pm 501 Schermerhorn Hall | Andrei Simion | 3.00 | 144/170 |
COMS 4995 | 032/13534 | T 4:10pm - 6:40pm 402 Chandler | Vijay Pappu | 3.00 | 116/120 |
COMS 4995 | 033/13533 | Th 7:00pm - 9:30pm 402 Chandler | Vijay Pappu | 3.00 | 78/135 |
COMS 4995 | V03/17527 | | Stephen Edwards | 3.00 | 6/99 |
COMS 4995 | V10/17528 | | Homayoon Beigi | 3.00 | 2/99 |
COMS 4995 | V32/17555 | | Vijay Pappu | 3.00 | 19/99 |
COMS W4996 Special topics in computer science, II. 3 points .
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 .
Prerequisites: an introductory programming course. Fundamentals of computer organization and digital logic. Boolean algebra, Karnaugh maps, basic gates and components, flipflops and latches, counters and state machines, basics of combinational and sequential digital design. Assembly language, instruction sets, ALU’s, single-cycle and multi-cycle processor design, introduction to pipelined processors, caches, and virtual memory
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
CSEE 3827 | 001/12121 | T Th 10:10am - 11:25am 207 Mathematics Building | Daniel Rubenstein | 3.00 | 134/152 |
CSEE 3827 | 002/12122 | T Th 11:40am - 12:55pm 428 Pupin Laboratories | Daniel Rubenstein | 3.00 | 136/147 |
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
CSEE 3827 | 001/11985 | T Th 11:40am - 12:55pm 301 Pupin Laboratories | Martha Kim, Martha Barker | 3.00 | 164/164 |
CSEE 3827 | 002/11986 | T Th 1:10pm - 2:25pm 301 Pupin Laboratories | Martha Kim, Martha Barker | 3.00 | 164/164 |
CSEE W4119 COMPUTER NETWORKS. 3.00 points .
Introduction to computer networks and the technical foundations of the Internet, including applications, protocols, local area networks, algorithms for routing and congestion control, security, elementary performance evaluation. Several written and programming assignments required
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
CSEE 4119 | 002/12160 | T Th 11:40am - 12:55pm 451 Computer Science Bldg | Xia Zhou | 3.00 | 101/110 |
CSEE 4119 | V02/15427 | | Xia Zhou | 3.00 | 6/99 |
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
CSEE 4119 | 001/14071 | T Th 4:10pm - 5:25pm 614 Schermerhorn Hall | Ethan Katz-Bassett, Thomas Koch | 3.00 | 92/120 |
CSEE 4119 | 002/14070 | T Th 5:40pm - 6:55pm 614 Schermerhorn Hall | Ethan Katz-Bassett, Thomas Koch | 3.00 | 47/120 |
CSEE 4119 | V01/19321 | | Ethan Katz-Bassett | 3.00 | 0/99 |
CSEE W4121 COMPUTER SYSTEMS FOR DATA SCIENCE. 3.00 points .
Prerequisites: Background in Computer System Organization and good working knowledge of C/C++. Corequisites: 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
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
CSEE 4121 | 002/12974 | Th 7:00pm - 9:30pm 417 International Affairs Bldg | Sambit Sahu, Robert Kramer | 3.00 | 178/175 |
CSEE W4140 NETWORKING LABORATORY. 3.00 points .
Prerequisites: ( 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 .
Prerequisites: ( 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.
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
CSEE 4823 | 001/11307 | T Th 2:40pm - 3:55pm Room TBA | Mingoo Seok | 3 | 117/110 |
CSEE W4824 COMPUTER ARCHITECTURE. 3.00 points .
Prerequisites: ( CSEE W3827 ) or equivalent. 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
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
CSEE 4824 | 001/11987 | M W 10:10am - 11:25am 214 Pupin Laboratories | Simha Sethumadhavan | 3.00 | 61/55 |
CSEE W4840 EMBEDDED SYSTEMS. 3.00 points .
Prerequisites: ( 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
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
CSEE 4840 | 001/12033 | M W 1:10pm - 2:25pm 451 Computer Science Bldg | Stephen Edwards | 3.00 | 97/110 |
CSEE W4868 SYSTEM-ON-CHIP PLATFORMS. 3.00 points .
Prerequisites: ( 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
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
CSEE 4868 | 001/11988 | T Th 11:40am - 12:55pm 141 Uris Hall | Luca Carloni | 3.00 | 60/60 |
CBMF W4761 COMPUTATIONAL GENOMICS. 3.00 points .
Prerequisites: Working knowledge of at least one programming language, and some background in probability and statistics. Computational techniques for analyzing genomic data including DNA, RNA, protein and gene expression data. Basic concepts in molecular biology relevant to these analyses. Emphasis on techniques from artificial intelligence and machine learning. String-matching algorithms, dynamic programming, hidden Markov models, expectation-maximization, neural networks, clustering algorithms, support vector machines. Students with life sciences backgrounds who satisfy the prerequisites are encouraged to enroll
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
CBMF 4761 | 001/12050 | M W 5:40pm - 6:55pm 1127 Seeley W. Mudd Building | Itsik Pe'er | 3.00 | 32/60 |
CBMF 4761 | V01/15241 | | Itsik Pe'er | 3.00 | 1/99 |
Columbia University in the City of New York 208 Hamilton Hall , Mail Code 2805 1130 Amsterdam Avenue New York, NY 10027
[email protected] Phone: 212-854-2441
© 2024-2025 Columbia University | Privacy Policy | Notice of Non-Discrimination | Terms of Use | Accessibility | University Home Page
Print this page including tabs.
Stack Exchange network consists of 183 Q&A communities including Stack Overflow , the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Q&A for work
Connect and share knowledge within a single location that is structured and easy to search.
I'm an undergraduate student at a top CS school who is looking to apply for my Master's soon (in about a year or so). I am applying to my school's 5 year masters program as a backup, but I would prefer to switch schools just to get a different experience.
My first question has to do with the acceptance rates of various CS Masters degree programs. I found that it was very difficult to search for the acceptance rates for various schools that I am interested in. Some of those schools include Yale, Berkeley, Stanford, and CalTech. However, I was unable to find acceptance rates for any of these schools. Could someone point me to a resource that I could use, or just give me the acceptance rates? Also, are there any "underrated" schools that I should be aware of (and by underrated, I mean high acceptance rates and good departments)?
I suspect that most programs do not post their acceptance rates at the master's level. That's in part because they could be subject to wild fluctuations from year to year, as the number of applications change.
In particular, one other thing to consider: most graduate programs have a target of incoming students they want to enroll. They will generally admit only as many students as they feel they need to reach the goal. If students are accepting offers at higher-than-expected rates, they may lower the admit rate in subsequent years to compensate. Similarly, if they are under their target, they may admit a larger than expected pool.
Considering top-tier schools, my suspicion (although I don't have the numerical evidence) is that they get enough qualified applications that admissions now are partly a "lottery": if you meet the qualifications of a typical student, you may or may not get in, depending on the needs of the department in that particular year. So just do your best.
I found this link on Quora. It looks like top 30 programs all have nearly same acceptance rates hovering from 6% to 10%.
When you mean underrated, I understand it as underrated by public and does not trigger 'wow' to public which includes Big Ten schools like Purdue, Penn State, UMichigan, UMaryland, UMadison, and other schools like UCIrvine, UCSanDiego, UTAustin, Georgia Tech etc.
Overrated are Ivy Leagues for sure including Harvard, Columbia and revenue generator masters programs in USC, UPenn, Brown, Johns Hopkins etc. (for CS/IT)
Level (neither underrated nor overrated) are CMU, Stanford, UIUC, MIT, Caltech, Princeton etc.
You are using an outdated browser. Please upgrade your browser to improve your experience.
Search up-to-date admission results to more than 250 graduate schools. With over 840,000 admission results submitted, TheGradCafe helps millions of grad students each year with their admissions journey.
Welcome to TheGradCafe.com! Search our database of over 500,000 admission results or jump into a discussion in the forum. If you've got a question about grad school, we've got it covered.
Example searches: math* , computer science , (Yale|"johns hopkins") econ* , or "media studies"
How Many Grad Schools Should I Apply To?
Last Mile Education Fund Paves the Way for Tech Students, Offers Lifeline Grants
When to Apply for Grad School: Easy Monthly Timeline [2025-2026]
30+ Best Dorm Room Essentials for Guys in 2024
2024 most popular master programs.
Testimonials
Free Resources
Gre prep online guides and tips, graduate school acceptance rates: can you get in.
Even the most qualified and confident applicants worry about getting into grad school. But don’t panic! Graduate school acceptance rates, which give the percentage of applicants that were admitted to a particular school or program in an academic year, can help you determine how likely you are to get into a given program. But where can you find grad school admissions statistics?
In this article, we’ll first investigate the trends and factors associated with graduate school acceptance rates. Then, we’ll take a look at some of the current acceptance rates and give you expert tips on how to find acceptance rates for your programs. Finally, we’ll show you how to determine your odds of getting into grad school.
Grad school acceptance rates are the same as any other acceptance rate: the lower the acceptance rate, the more selective the school or program is. Similarly, the higher the acceptance rate, the less selective the school or program is. As with undergrad acceptance rates, grad school acceptance rates vary widely, from extraordinarily selective (less than 5 percent) to incredibly lenient (nearly 100 percent).
Unlike undergrad rates, though, grad school acceptance rates are usually calculated for specific programs or departments and not for entire universities. This is because with grad school, you are essentially applying to an individual program rather than an overall institution (as you did for undergrad).
Now that we’ve covered all of the basics, let’s look at a few key trends. Our research indicates there are three major factors that help determine grad school acceptance rates:
Let’s look at how each of these factors influences grad school acceptance rates.
Quick side note: we've created the world's leading online GRE prep program that adapts to you and your strengths and weaknesses. Not sure what to study? Confused by how to improve your score? We give you minute by minute guide.
You don't NEED a prep program to get a great GRE score. But we believe PrepScholar is the best GRE prep program available right now , especially if you find it hard to organize your study schedule and don't know what to study .
Click here to learn how you can improve your GRE score by 7 points, guaranteed .
How prestigious a particular grad school or program is can affect its overall competitiveness and selectivity. In general, the more prestigious a program is, the more competitive it’ll be and thus the lower acceptance rate it’ll have.
An easy way to determine school or program prestige is to consult official rankings, such as those listed on U.S. News . (Grad schools are typically ranked by field or program and not by overall institution.)
For example, a 2017 U.S. News list of the best political science grad programs ranked Duke’s political science program at #7 and Northwestern’s at #23. Because both of the programs have fairly high rankings, it’s safe to assume they’re probably quite selective.
And this is true: in 2016, Duke reported a mere 10 percent acceptance rate to its political science doctoral program, while Northwestern reported a 12 percent acceptance rate.
Another major factor is degree type. Generally, doctoral programs tend to be more selective than master’s programs (though this isn’t always the case as I’ll explain in a moment). This trend is likely due to the fact that doctoral programs often look for higher-quality applicants with proven academic track records and more relevant experience in their fields.
For example, in 2016 University of Michigan’s math doctoral program had a 17.2 percent acceptance rate, whereas its master’s program had a much higher 31.8 percent rate. In this case, the doctoral program is clearly tougher to get into than the master’s program.
Still, master’s programs can have lower acceptance rates than doctoral programs. If we were to take the University of Michigan’s grad programs in computer science and engineering, we’d find that the doctoral program has a 15 percent acceptance rate and the master’s an even lower 8 percent acceptance rate .
Additionally, M.F.A. programs are particularly cutthroat. In 2015, the creative writing M.F.A. program at UT Austin’s James A. Michener Center for Writers only admitted 12 out of 678 applicants — that’s a mere 1.8 percent acceptance rate !
Funding, too, plays a big role in how selective a grad program is.
Well-funded programs typically receive more applications than those offering little to no aid, thereby raising their selectivity. Competition is especially fierce for fully funded programs — possibly because fewer people are willing to go into debt for grad school.
Compared to fully funded doctoral programs, fully funded master’s programs are somewhat rare and thus pretty competitive. UT Austin’s Creative Writing M.F.A. program, for instance, is not only a prestigious program but also one of the most well-funded Creative Writing M.F.A. programs in the country: it offers full tuition remission and a $27,500 stipend per academic year . It’s no wonder, then, that its acceptance rate is below 2 percent!
For this section, we’ve scoured the internet to bring you a robust assortment of acceptance rates for popular U.S. grad schools.
Before we dive in, note that not all institutions calculate grad school acceptance rates using the same methodologies. Some offer only a single acceptance rate for all of their grad schools put together, while others offer individual rates by school, field, or program.
Now, let’s see how selective these schools really are!
Cornell | (2016) | Computer Science Ph.D.: 16.4% English Language and Literature Ph.D.: 13.2% History Ph.D.: 14% |
Dartmouth | (2016) | Arts and Sciences: 30% Thayer School of Engineering (M.S. and Ph.D.): 15% Tuck School of Business: 22% |
Duke | (2016-17) | Computer Science M.S.: Computer Science Ph.D.: English Ph.D.: History Ph.D.: |
Harvard | Business School | (2015) |
John A. Paulson School of Engineering and Applied Sciences | (2014) | |
T.H. Chan School of Public Health | Master of Public Health (M.P.H.): (2014) | |
MIT | All grad admissions | (2016) |
NYU | (2014-17)* | Accounting Ph.D.: 2.1% Economics Ph.D.: 2% Marketing Ph.D.: 2.2% |
Northwestern | (2016) | Arts and humanities: Life sciences: Physical sciences, mathematics, and Engineering: Social and behavioral sciences: |
(2016) | Arts and humanities: Life sciences: Physical sciences, mathematics, and Engineering: Social and behavioral sciences: | |
Notre Dame | (2013) | Computer Science and Engineering Ph.D.: English Ph.D.: History Ph.D.: |
Princeton | (2016-17) | Humanities: 11% Natural Sciences: 15% School of Architecture: 13% School of Engineering and Applied Science: 13% Social Sciences: 8% Woodrow Wilson School of Public and International Affairs: 13% |
Stanford | Graduate School of Business | (2015) |
UC Berkeley | College of Engineering | (2014) |
UCLA | (2009-13) | Computer Science M.S. and Ph.D.: English Ph.D.: History Ph.D.: |
University of Michigan – Ann Arbor | (2016) | Computer Science and Engineering Ph.D.: 15% English Language and Literature Ph.D.: 16.4% History Ph.D.: 16.9% |
(2016) | Computer Science and Engineering M.S.: 8% Creative Writing M.F.A.: 3.7% Master of Public Administration (M.P.A.): 71.1% | |
University of Texas – Austin | (2015-16) | English Ph.D.: 11.5% History Ph.D.: 16.6% |
University of Washington – Seattle | (2016) | Arts: 17% Humanities: 20.4% Sciences: 18.6% Social sciences: 22.8% |
Yale | School of Engineering & Applied Science | (2014) |
*Statistics for NYU are based on the number of enrolled students and not the number of admitted students. Therefore, expect actual acceptance rates to be slightly higher.
Unfortunately, grad school admissions statistics tend to be more difficult to find than undergrad acceptance rates. But there are ways to search for them — you just have to do a lot of digging and possibly a little reaching out.
Below are our top four methods for finding grad school acceptance rates for the programs you’re applying to.
By far the most reliable resources for grad school admissions statistics are school websites.
Start your search by consulting program and departmental pages, particularly admissions and FAQ pages. Look out for any statistics-related keywords or phrases, such as “admission(s) rates,” “acceptance rates,” “enrollment,” “facts and figures,” etc. Use ctrl+F to move swiftly through large chunks of text.
Not all schools publish grad admissions information online, and those that do don’t always report it in the same way as others. For example, Princeton offers a handy PDF containing acceptance rates for all academic fields of study. On the other hand, Notre Dame gives separate admissions charts for each of its grad programs (which you can access by selecting a program and then clicking “Admissions Statistics”).
Additionally, many schools release admissions statistics without explicitly publishing acceptance rates. In this case, it’s your job to take the statistics provided and use them to calculate an acceptance rate. To find the acceptance rate of a school or program, you’ll need the following information:
The acceptance rate equals the total number of applicants offered admission divided by the total number of applicants and then multiplied by 100, or:
$$\acceptance \rate = {\number \of \applicants \offered \admission}/{\total \number \of \applicants}100$$
Be sure to avoid conflating the number of students who were offered admission with the number of students who accepted their offers of admission. These two concepts sound alike but are actually different. What you’re looking for is the first statistic — that is, the number of admitted students (regardless of whether they decided to enroll).
If you’re having trouble finding admissions statistics by browsing school websites, search on Google for “[Your School] graduate acceptance rate” and see if any relevant school pages appear. While searching for acceptance rates to use in the table above, I consistently swapped “acceptance rate” with similar phrases, such as “admission(s) rate,” “facts and figures,” “student statistics,” “admittance rates,” and “admission(s) statistics.”
Want to improve your GRE score by 7 points? We have the industry's leading GRE prep program. Built by world-class instructors with 99th percentile GRE scores , the program learns your strengths and weaknesses through machine learning data science, then customizes your prep program to you so you get the most effective prep possible.
Try our 5-day full access trial for free:
Don’t be afraid to get creative! You can also use phrases like “Ph.D. admissions statistics” or “master’s admissions statistics” to narrow your search even further. Try to think outside the box as you do your research. What are other ways people talk about acceptance rates?
If your school or program doesn’t offer any admissions statistics on its website, go to U.S. News . This website offers official rankings of grad programs as well as lists of the most (and least) selective programs in various fields.
For example, I found a 2016 list of the most competitive online M.B.A. programs and a 2015 list of the most competitive online graduate engineering programs .
If U.S. News doesn’t offer any relevant lists for you to use, try skimming the current grad school rankings to gauge how competitive your program is compared with others in the same field.
One less reliable method for looking up grad school admissions statistics is to look for (unofficial) websites discussing acceptance rates for your school or program.
The Grad Cafe’s admissions results section is a solid place to start. Here, applicants post whether they’ve been accepted, rejected, or waitlisted for grad programs.
Search for your program to get a rough feel for how many acceptances and rejections go out each year. You might notice that certain types of applicants are more active than others. Creative Writing M.F.A. applicants, for example, are prolific posters in winter and spring (during admissions season).
Occasionally, Google itself will provide you with grad school acceptance rates, but this only appears to work consistently for well-known law schools, medical schools, and business schools.
Additionally, while using Google, don’t assume that any acceptance rates that pop up are directly connected to your search terms. For example, when I searched “stanford graduate acceptance rate,” Google gave me this result:
This 4.8 percent acceptance rate is not the acceptance rate for Stanford’s grad programs (what I searched for) but rather the acceptance rate for undergrads. So always cross-check any statistics Google gives you.
You can also consult grad school data websites such as Peterson’s and StartClass . Take their grad school acceptance rates with a grain of salt, though — their data isn’t always verifiable online. If possible, try to compare any data you find on these types of websites with the school websites themselves or U.S. News .
If the internet isn’t giving you the help you need, call or email your schools. Be polite but upfront: ask whether the school calculates acceptance rates for grad programs and where you can find this information online (if available).
If a school refuses to divulge admissions statistics or simply doesn’t report acceptance rates, see if they can give you estimates for how many applications they receive each year, or for how many acceptances they usually extend to applicants in your program.
By this point, you might be wondering how likely it is you’ll actually get into the grad program you wish to attend. After all, acceptance rates are pretty broad — they tell you what everyone’s odds are but not your odds specifically.
Below are three easy steps for determining your odds of getting into grad school, including advice on when it’s better to go for it or choose another program.
First, go to your program’s website and pinpoint the admissions requirements page. Now, ask yourself: do you meet all of the program’s basic requirements? If not, you’ll likely wind up with a rejection (and might not even be able to apply).
However, if you’re still interested in applying, contact the program and ask if they’ll make an exception for you. Your chance of getting accepted is still low, but you’ll at least have your application considered.
If your program strongly recommends qualities you lack, don’t interpret this as an automatic rejection. Sometimes, applicants can make up for deficiencies in other ways. For example, if your undergrad GPA is 3.1 and your program recommends applicants have a minimum 3.2, don’t write off the program — you might still have a shot at getting in as long as the rest of your application is solid.
On the other hand, even if you meet all of a program’s requirements, you’re not necessarily a shoo-in. Remember, all other applicants have met these requirements, too, so you’ll need to find a unique way to make your application stand out.
Your next step is to look up your program’s average GRE scores and GPA to see how your own scores and GPA compare with those of previously admitted applicants.
You can usually find GRE score information on admissions requirements or FAQ pages. You can also search on Google for “[Your School] [Your Program] average GRE scores.” For step-by-step instructions on how to find average GRE scores, check out my article on average GRE scores by school .
For GPAs, you can use the same basic methodology. Check admissions requirements and FAQ pages and use ctrl+F to search for “GPA.” If GPA information is available, you’ll most likely come across minimum GPAs or average GPAs (or both). For more tips on how to find GPA information for your grad schools, read our guide .
Now, compare your own GRE scores and GPA with the averages you’ve found. Below are all possible scenarios and what they mean for you and your odds of getting into the program:
Want to improve your GRE score by 7+ points?
Check out our best-in-class online GRE prep program . We guarantee your money back if you don't improve your GRE score by 7 points or more.
PrepScholar GRE is entirely online, and it customizes your prep program to your strengths and weaknesses . We also feature 2,000 practice questions , official practice tests, 150 hours of interactive lessons, and 1-on-1 scoring and feedback on your AWA essays.
Check out our 5-day free trial now:
Now, we get to the final question: do you apply to the program or not? This is a vague question that’s difficult to answer as is. The real questions you should be asking yourself are as follows:
Although acceptance rates and GRE/GPA comparisons are helpful, don’t base your decision to apply solely on how difficult the program is to get into. We can’t know for sure what kind of applicant a grad program is looking for or who they’re willing to make an exception for.
Take a moment to think deeply about how interested you are in this particular program. Be realistic about your chances of getting in — but don’t cross the line into pessimism. If you don’t meet most or all of a program’s expectations and you’re not super invested in it, consider applying elsewhere.
But if you meet some, most, or all of a program’s expectations and you’re extremely interested in enrolling, give the application a go. Remember, it’s totally normal (and even encouraged) to have a few reach schools. Plus, you’ll never get in if you don’t apply!
Grad school acceptance rates quantify for us the selectivity of grad schools and programs. More specifically, acceptance rates tell us what percentage of applicants were offered admission to a particular grad school or program.
With grad school, acceptance rates are often reported for individual schools or programs, not entire universities. Acceptance rates can vary widely depending on program prestige, the type of degree you’re seeking, and how much (or how little) funding a program offers.
Unlike undergrad acceptance rates, grad school acceptance rates are somewhat difficult to locate online. You can look for them using any of the following four methods:
When trying to determine your odds of getting into a program, look at your program’s requirements as well as the average GPA and GRE scores of previously admitted applicants to your program. If your GRE scores and GPA are comparable to those of your program, you have a decent shot at getting accepted. If one or both are lower than your program’s averages, however, you can always try to raise your GRE score with a retake or address your GPA in your statement of purpose.
At the end of the day, what ultimately matters isn’t that you get accepted to a highly competitive grad program but that you make the right decision for you and you alone!
Need help with your grad school application? Learn about the most common grad school requirements and get tips on how to write a grad school CV or resume !
Is your GPA good enough for grad school ? Read our in-depth guide to learn how you can make up for a less-than-stellar GPA and ultimately raise your chances of getting into the school of your dreams.
Do you have to take the GRE for grad school ? When are grad school deadlines ? Check out our guides for answers to these questions and more.
Hannah graduated summa cum laude from the University of Southern California with a bachelor’s degree in English and East Asian languages and cultures. After graduation, she taught English in Japan for two years via the JET Program. She is passionate about education, writing, and travel. View all posts by Hannah Muniz
This subreddit is for anyone who is going through the process of getting into graduate school, and for those who've been there and have advice to give.
Does anyone know the accept rate for Penn and for Columbia’s CS PhD programs for recent years (particularly for the past cycle)?
By continuing, you agree to our User Agreement and acknowledge that you understand the Privacy Policy .
You’ve set up two-factor authentication for this account.
Create your username and password.
Reddit is anonymous, so your username is what you’ll go by here. Choose wisely—because once you get a name, you can’t change it.
Enter your email address or username and we’ll send you a link to reset your password
An email with a link to reset your password was sent to the email address associated with your account
Getting accepted into an Ivy League graduate program like Columbia is highly competitive, but not impossible with proper planning. If you’re short on time, here’s a quick answer to your question: Columbia’s overall graduate school acceptance rate is around 6%, but rates vary by program from 3% to 14% .
In this comprehensive guide, we will dig into the acceptance rates for all of Columbia’s graduate and professional degree programs. You’ll find data on acceptance rates over time, factors that impact admission success, and tips to strengthen your Columbia application.
List of all graduate schools and programs.
Columbia University offers a wide range of graduate programs across various disciplines. Some of the notable graduate schools at Columbia University include the School of Engineering and Applied Science, the Mailman School of Public Health, the Graduate School of Arts and Sciences, and the Columbia Business School.
These schools offer programs in fields such as engineering, public health, arts and sciences, business, law, and many more. The university prides itself on its diverse and comprehensive selection of graduate programs, catering to the interests and career aspirations of students from different academic backgrounds.
View this post on Instagram A post shared by Columbia University (@columbia)
When applying to Columbia University’s graduate programs, there are certain requirements and deadlines that prospective students should be aware of. While specific requirements and deadlines may vary depending on the program, most applications typically require a completed online application form, letters of recommendation, a statement of purpose, official transcripts, and standardized test scores (such as the GRE or GMAT).
It is important for applicants to carefully review the requirements for their desired program and ensure that all materials are submitted by the specified deadlines. Missing a deadline can significantly impact the chances of acceptance.
As one of the most prestigious universities in the world, Columbia University attracts highly competitive applicants to its graduate programs . While there is no specific cutoff for GPA or test scores, the average GPA and test scores of accepted students provide insight into the level of academic achievement expected by the university.
For example, the average undergraduate GPA of admitted students to Columbia Business School is around 3.6 , and the average GMAT score is 729 , but it ranges from 550 to 780. However, it’s important to note that these averages can vary depending on the specific program and the applicant pool for a given year.
It is worth mentioning that the admissions process at Columbia University takes into account various factors beyond just GPA and test scores. The university also considers an applicant’s work experience, extracurricular involvement, letters of recommendation, and personal statement.
Admissions committees aim to create a diverse and well-rounded cohort of students, with a range of backgrounds and experiences.
For more detailed information on specific graduate programs and their acceptance rates, it is advisable to visit the official websites of the respective schools or programs at Columbia University. These websites provide comprehensive information on the application process, program requirements, and contact information for further inquiries.
Lowest acceptance rates – medicine, law, business.
Columbia University is renowned for its rigorous and highly competitive graduate programs. Among the most competitive programs are those in medicine, law, and business. These programs have the lowest acceptance rates due to their high demand and limited number of available spots.
In the field of medicine, Columbia University’s College of Physicians and Surgeons receives thousands of applications each year, but only a small percentage of applicants are accepted . The program’s selectivity ensures that the best and brightest students are admitted, as they will go on to become future leaders in the medical profession.
The law school at Columbia is also highly selective, accepting only a fraction of applicants. With its prestigious faculty and comprehensive curriculum, the Columbia Law School attracts top candidates from around the world.
The competitive nature of the program ensures that students receive a world-class legal education.
Similarly, the Columbia Business School is highly competitive, accepting only a small number of applicants. With its emphasis on leadership and innovation, the business school attracts talented individuals who are looking to excel in the corporate world.
Columbia University’s graduate programs in arts, sciences, and engineering have moderate acceptance rates compared to the highly competitive programs mentioned above. These programs still attract a large number of applicants, but the acceptance rates are relatively higher due to a larger number of available spots.
The graduate program in arts at Columbia University offers a wide range of disciplines, including visual arts, performing arts, and creative writing. Although the program is competitive, it provides aspiring artists with a nurturing and stimulating environment to develop their skills and creativity.
In the field of sciences , Columbia University offers graduate programs in various disciplines such as biology, chemistry, physics, and computer science . These programs attract talented individuals who are passionate about advancing scientific knowledge and making groundbreaking discoveries.
Similarly, the engineering programs at Columbia University are highly regarded and attract students from around the world. The Department of Mechanical Engineering , for example, offers cutting-edge research opportunities and prepares students for careers in industries such as aerospace, automotive, and energy.
Columbia University ‘s graduate programs in education, public health, and social work have the highest acceptance rates among its graduate programs. These programs aim to train professionals who can make a positive impact on society and address the pressing needs of communities.
The graduate program in education at Columbia University prepares future educators, administrators, and policy makers to excel in the field of education. With a focus on research-based teaching practices and innovative approaches to learning, the program equips students with the knowledge and skills needed to shape the future of education.
The Mailman School of Public Health at Columbia University offers a range of graduate programs that address critical issues in public health. These programs attract individuals who are passionate about improving population health and reducing health disparities.
Columbia University’s School of Social Work is dedicated to training professionals who can address social and economic challenges faced by individuals, families, and communities. The program emphasizes social justice and provides students with the skills to advocate for vulnerable populations.
When applying to graduate school, understanding the acceptance rates can be crucial in determining your chances of admission. In the case of Columbia University’s Graduate School, it is important to interpret these rates accurately and find ways to improve your odds.
By considering factors such as selectivity rates, test scores, GPA, personal statement, and experience, you can take proactive steps towards increasing your chances of acceptance.
Over the years, Columbia University’s Graduate School has become increasingly competitive. It is essential to understand the changes in selectivity rates to gauge the level of competition you will be facing.
By analyzing historical data, you can gain insights into the trends and make informed decisions. Websites like collegefactual.com provide comprehensive data on acceptance rates for various programs at Columbia and other universities, allowing you to compare and contrast the selectivity rates over time.
While selectivity rates provide a general overview, it is important to assess your individual circumstances. Your test scores, such as GRE or GMAT, and GPA play a significant role in the application process.
By researching the average scores of admitted students in your desired program, you can gauge where you stand and identify areas for improvement. Admission committees often consider these scores as a measure of your academic potential , so it is crucial to aim for scores that align with or exceed the averages.
Aside from academic achievements, your personal statement and experience can make a significant impact on your application. Use your personal statement to showcase your unique qualities, experiences, and aspirations that make you a standout candidate.
Emphasize how your background aligns with the program and highlight any relevant research or projects you have undertaken. Additionally, your professional experience, internships, and extracurricular activities can demonstrate your dedication, leadership skills, and passion for your chosen field.
Remember, Columbia University’s Graduate School seeks well-rounded individuals who can contribute to their academic community . By understanding the changing selectivity rates, evaluating your test scores and GPA, and highlighting your personal statement and experience, you can increase your chances of being accepted into your desired program.
Stay focused, work hard, and don’t be discouraged by the competitive nature of the admissions process. With the right preparation and determination, you can maximize your chances of success!
Applying to graduate school can be a daunting process, but with the right strategies and preparation, you can increase your chances of getting accepted into Columbia University. Here are some application tips to help you stand out from the competition:
When selecting recommenders, it’s important to choose individuals who can speak to your strengths and abilities. Consider professors, mentors, or employers who have a good understanding of your academic or professional achievements.
It’s also helpful to choose recommenders who can provide specific examples of your work or contributions . This will give the admissions committee a better understanding of your potential and suitability for the program.
It’s also a good idea to meet with your recommenders beforehand to discuss your goals and aspirations . This will help them write a more personalized and impactful letter of recommendation. Providing them with your resume, transcript, and any relevant work samples can also help them craft a stronger recommendation.
Your application materials, including your statement of purpose and resume, should tell a compelling story about your academic and professional journey. It’s important to highlight your unique experiences, skills, and achievements that align with the program you are applying to.
This will help the admissions committee understand why you are a good fit for Columbia University.
Take the time to reflect on your experiences and think about how they have shaped your goals and aspirations. Be sure to clearly articulate your motivations for pursuing graduate study and how Columbia University can help you achieve those goals.
Additionally, ensure that your narrative is cohesive and flows logically from one point to another. This will make it easier for the admissions committee to follow your story and understand your potential.
When writing your essays, it’s important to avoid common pitfalls and errors that can weaken your application. One common mistake is not answering the prompt directly or failing to address all aspects of the question.
It’s crucial to carefully read and understand the essay prompt and ensure that your response is on point.
Another common pitfall is not proofreading your essays thoroughly. Spelling and grammar errors can detract from the overall quality of your application. Take the time to review and edit your essays multiple times, or consider asking someone else to proofread them for you.
This will help you catch any mistakes or areas that need improvement.
Additionally, be cautious about using clichés or generic language in your essays . The admissions committee wants to see your unique perspective and voice, so try to avoid using overly common phrases or ideas. Be authentic and let your personality shine through in your writing.
By strategically choosing recommenders, crafting a compelling narrative, and avoiding common essay pitfalls, you can increase your chances of getting accepted into Columbia University’s Graduate School .
Remember to start early, give yourself enough time to prepare your application materials, and showcase your unique qualities and experiences. Good luck!
Getting into an Ivy League graduate program is highly competitive, but taking the time to understand Columbia’s admissions by program can help you craft a stronger application. Focus on showing a match between Columbia’s offerings and your academic and professional goals and highlight the unique experiences you’ll bring to campus.
Maria Sanchez is the founder of the Save Our Schools March blog. As a former teacher and parent, she is passionate about equitable access to quality public education. Maria created the blog to build awareness around education issues and solutions after organizing a local march for public schools.
With a Master's in Education, Maria taught high school English before leaving her career to raise a family. As a parent, she became concerned about underfunded schools and over-testing. These experiences drove Maria to become an education advocate.
On the blog, Maria provides resources and policy insights from the dual perspective of an informed parent and former teacher. She aims to inspire others to join the movement for quality, equitable public education. Maria lives with her family in [city, state].
If you’re an aspiring teacher trying to decide between teaching middle school or high school, this is understandably a difficult decision….
Eager to begin a career in law but don’t have a bachelor’s degree yet? You’re in luck – there are several…
If you’ve ever eaten a school lunch, you probably know exactly what we mean when we say they’re bad. From mystery…
Trying to access blocked websites or applications on a school computer? We’ve all been there. Schools often restrict access to certain…
Getting into a physical fight at school can have serious consequences for students. Fist fights, shouting matches that turn physical, or…
Deciding on the most difficult school subject is not straightforward, as different students struggle with different topics based on their skills,…
Business/finance, architecture, social science.
United kingdom, netherlands, switzerland, new zealand.
Download the YMGrad App today!
Login or Sign Up
The Master of Science (MS) program is intended for people who wish to broaden and deepen their understanding of Computer Science. Columbia University and the New York City environment provide excellent career opportunities in multiple industries.
The program provides a unique opportunity to develop leading-edge in-depth knowledge of specific computer science disciplines. The department currently offers concentration tracks covering eight such disciplines. MS students are encouraged to participate in state-of-the-art research with our research groups and labs.
Choose one of the tracks below, view each track webpage for details on requirements.
Cs ms faculty track advisors.
CS Faculty Advisors will be assigned after you select a track in Mice. If you do not yet have a Mice account but are a CS MS student, please contact [email protected] . Contact your Track Advisor to get special permission for any course not specifically approved on your CS track websites .
Students should keep an updated copy of their Degree Progress Checklist on hand for any academic progress reviews with their Faculty and/or Admin advisor. This form will also be requested a few weeks before graduation to verify your program requirements are met.
If you are interested in applying a specialized Topics in Computer Science courses (COMS 4995 or COMS 6998) to your Track electives, please view Topics Courses by Track Approval .
Students may take multiple sections of COMS 4995 and/or COMS 6998, as each topic title will vary by content each semester. If you aren’t sure if a course is the same, please email your MS Faculty Track Advisor.
No approval is required for the course to count as a General Elective.
A list of current and recent Topics Course Descriptions can be found here .
In addition to the Computer Science MS Program, we offer the Computer Engineering MS Program jointly with the Electrical Engineering Department. More information about the program can be found in the Computer Engineering section of the SEAS bulletin and on the Computer Engineering website .
Admitted students will enroll for a total of four semesters. In addition to taking classes already offered at the Journalism and Engineering schools, students will attend a seminar and workshop designed specifically for the dual degree program. The seminar will teach students about the impact of digital techniques on journalism; the emerging role of citizens in the news process; the influence of social media; and the changing business models that will support news gathering. In the workshop, students will use a hands-on approach to delve deeply into information design, focusing on how to build a site, section, or application from concept to development, ensuring the editorial goals are kept uppermost in mind. For more information, please visit the program website .
Find open faculty positions here .
Upcoming events, fall 2024 research fair.
Thursday 12:00 pm
Friday 12:00 pm
Friday 3:00 pm
, CS Careers
Tuesday 1:00 pm
Press mentions, dean boyce's statement on amicus brief filed by president bollinger.
President Bollinger announced that Columbia University along with many other academic institutions (sixteen, including all Ivy League universities) filed an amicus brief in the U.S. District Court for the Eastern District of New York challenging the Executive Order regarding immigrants from seven designated countries and refugees. Among other things, the brief asserts that “safety and security concerns can be addressed in a manner that is consistent with the values America has always stood for, including the free flow of ideas and people across borders and the welcoming of immigrants to our universities.”
This recent action provides a moment for us to collectively reflect on our community within Columbia Engineering and the importance of our commitment to maintaining an open and welcoming community for all students, faculty, researchers and administrative staff. As a School of Engineering and Applied Science, we are fortunate to attract students and faculty from diverse backgrounds, from across the country, and from around the world. It is a great benefit to be able to gather engineers and scientists of so many different perspectives and talents – all with a commitment to learning, a focus on pushing the frontiers of knowledge and discovery, and with a passion for translating our work to impact humanity.
I am proud of our community, and wish to take this opportunity to reinforce our collective commitment to maintaining an open and collegial environment. We are fortunate to have the privilege to learn from one another, and to study, work, and live together in such a dynamic and vibrant place as Columbia.
Mary C. Boyce Dean of Engineering Morris A. and Alma Schapiro Professor
Computer science.
The Doctor of Philosophy, the highest degree offered by the University, is conferred in recognition of marked scholarship in a broad field of knowledge as well as distinguished critical or creative achievement within a special area of the general field (the special area being the subject of the doctoral dissertation). The Doctor of Philosophy (PhD) in Computer Science program in the College of Engineering and Applied Science (CEAS) is designed to meet the traditional high standards for such programs. The PhD in Computer Science is administered by the division of Computer Science in the department of Electrical Engineering and Computer Science. Some aspects of the program are delegated to the CEAS Graduate Office.
The program is flexible, allowing the student to develop a plan of studies tailored to meet individual needs. Evaluation of the study plan is based on its appropriateness as a computer science program, the availability within the University of appropriate course offerings, and the availability within the division of Computer Science of a faculty member who is qualified to serve as the student’s major professor.
The PhD degree requires a minimum of 66 credits beyond the baccalaureate, including a dissertation. The student must also satisfy a residence requirement.
Many of the courses leading toward graduate degrees in CEAS are offered in the late afternoon or evening. So, students can complete much of their coursework on a part-time basis.
Credits and courses, additional requirements, application deadlines.
Application deadlines vary by program, please review the application deadline chart for specific programs. Other important dates and deadlines can be found by using the One Stop calendars .
An applicant must meet Graduate School requirements plus these program requirements to be considered for admission to the program:
A student who receives a master’s degree at UWM must formally apply for admission to the Graduate School as a doctoral student before continuing studies that will be credited toward the Doctor of Philosophy in Computer Science.
The minimum degree requirement is 66 graduate credits beyond the bachelor’s degree. The minimum credit distribution of coursework to be undertaken must be as follows depending on the option selected.
Code | Title | Credits |
---|---|---|
Select 21 credits in the major area of concentration | 21 | |
Select 9 credits in an approved minor area | 9 | |
Select 6 credits in mathematics and/or quantitative methods | 6 | |
Take for total of 18 credits: | 18 | |
Doctoral Thesis | ||
Select 9 credits of electives | 9 | |
Effective Academic Writing | 1 | |
Preparing Future Engineering Faculty & Professionals | 2 | |
Total Credits | 66 |
The 6-credit requirement in mathematics and/or quantitative methods may be met by satisfactorily completing certain courses specified by the Department or by taking the minor in mathematics. When such courses also count for either the major or the minor area, the remaining credits may be taken as approved electives.
The student must achieve a 3.0 GPA separately in each of the following areas: the major area, the minor area, and the quantitative methods area.
The minor is normally in another area offered in the College or in the physical sciences or mathematics or in management sciences. Consideration of any other area as a minor requires the prior approval of the Department.
A minimum of 26 credits, excluding doctoral thesis, must be at the 700 level or higher.
The Graduate School requires that the student must have a major professor to advise, supervise, and approve the program of study before registering for courses. The incoming student will be assigned to an initial Program Advisor at the time of admission. Prior to the completion of 12 credits (9 credits for part-time students), the student must select a major professor who will be the student’s thesis advisor. The student, in consultation with the major professor, develops a proposed program of studies which is submitted for approval. For subsequent changes, the student must file a revised program of study for approval.
There is no foreign language requirement for the degree.
The program residence requirement is satisfied either by completing 8 or more graduate credits in two consecutive semesters, exclusive of summer sessions, or by completing 6 or more graduate credits in each of three consecutive semesters, exclusive of summer sessions.
Each student in the program must take and pass a Qualifying Examination to demonstrate that the student is qualified for doctoral-level work. The Qualifying Examination is a written exam and is structured in two parts: Part 1 and Part 2. The examination is offered twice a year during the regular academic year.
Students entering with only a bachelor’s degree or with a master’s degree in an area unrelated to their major may take the Qualifying Examination for the first time after earning 12 credits of graduate work at UWM and must successfully pass the exam before earning 30 credits of graduate work at UWM.
Students admitted after completing an appropriate master’s degree must take this examination no later than the semester immediately after 18 credits of graduate work have been earned at UWM.
A student may take the Qualifying Examination twice. On the first attempt, the student must attempt both Part 1 and Part 2 of the examination.
A student who fails the qualifying exam twice is subject to dismissal from the PhD in Computer Science program. A student may appeal the failure and dismissal within 30 days of being notified of the failure. If the student does not appeal or the appeal is not granted, the College will recommend to the Graduate School that the student be dismissed. A student who is dismissed from the PhD in Computer Science program because of failing the qualifying exam may not be enrolled in the PhD in Computer Science program for a complete calendar year. This does not preclude the student from being enrolled in any other degree program offered by the University. A student who wishes to re-enroll in the program after a calendar year has passed must apply as any other student would, including payment of fees. A student readmitted after having failed the qualifying exam twice must take the qualifying exam in the first semester of matriculation and this will count as the student’s first attempt at the exam. The student may appeal this requirement prior to the first scheduled day of classes. If the student fails the qualifying exam on this first attempt, the student is permitted the customary second attempt as described above. All appeals must be in writing and directed to the CEAS Associate Dean for Academic Affairs.
The Doctoral Program Committee is proposed by the major professor in consultation with the student and the department. The Committee must include at least five graduate faculty (three from major area, one from minor area, and one from any area, including the major and minor areas). The last member may be a person from outside the University (such as another university, a research laboratory, or a relevant industrial partner), provided that person meets Graduate School requirements. The Committee may have more than five members, provided that the majority of the Committee members are from the student’s major field.
A student is admitted to candidacy only after successful completion of the doctoral preliminary examination conducted by the Doctoral Program Committee. This examination, which normally is oral, must be taken before the completion of 48 credits of graduate work toward the Doctor of Philosophy degree in Computer Science and should be taken within the first seven years in the program. Prior to the examination, the student must present a proposal for a doctoral dissertation project. The examination may cover both graduate course material and items related to the proposed dissertation project.
The student must carry out a creative effort in the major area under the supervision of the major professor and report the results in an acceptable dissertation. The effort of the student and the major professor to produce the dissertation is reflected in the PhD in Computer Science program requirement that the student complete at least 18 credits of doctoral thesis.
After the student has successfully completed all degree requirements except the dissertation, the student may enter Dissertator Status. Achieving Dissertator Status requires successful completion of the Doctoral Preliminary Examination and prior approval of the student’s advisor, the Doctoral Program Committee, and the Computer Science GPR of a dissertation proposal that outlines the scope of the project, the research method, and the goals to be achieved. Any proposal that may involve a financial commitment by the University also must be approved by the Office of the Dean. After having achieved Dissertator Status, the student must continue to register for 3 credits of doctoral thesis per semester during the academic year until the dissertation is completed.
The final examination, which is oral, consists of a defense of the dissertation project. The doctoral defense examination may only be taken after all coursework and other requirements have been completed. The student must have Dissertator Status at the time of the defense.
All degree requirements must be completed within ten years from the date of initial enrollment in the doctoral program.
Print this page.
The PDF will include all information unique to this page.
All pages in the 2024-2025 Catalog.
Skip to Content
Current Students
Interested in more? Search Courses
Computer science - phd, admission requirements.
Terms and Deadlines
Degree and GPA Requirements
Additional standards for non-native english speakers, additional standards for international applicants.
For the 2025-2026 academic year
See 2024-2025 requirements instead
Priority deadline: February 14, 2025
Final submission deadline: June 16, 2025
International submission deadline: May 5, 2025
Final submission deadline: November 4, 2025
International submission deadline: September 8, 2025
Final submission deadline: February 3, 2026
International submission deadline: December 8, 2025
Final submission deadline: May 4, 2026
International submission deadline: February 23, 2026
Priority deadline: Applications will be considered after the Priority deadline provided space is available.
Final submission deadline: Applicants cannot submit applications after the final submission deadline.
Bachelors degree: All graduate applicants must hold an earned baccalaureate from a regionally accredited college or university or the recognized equivalent from an international institution.
University GPA requirement: The minimum grade point average for admission consideration for graduate study at the University of Denver must meet one of the following criteria:
A cumulative 2.5 on a 4.0 scale for the baccalaureate degree.
A cumulative 2.5 on a 4.0 scale for the last 60 semester credits or 90 quarter credits (approximately two years of work) for the baccalaureate degree.
An earned master’s degree or higher from a regionally accredited institution or the recognized equivalent from an international institution supersedes the minimum GPA requirement for the baccalaureate.
A cumulative GPA of 3.0 on a 4.0 scale for all graduate coursework completed for applicants who have not earned a master’s degree or higher.
Prerequisite courses for the PhD include: COMP 1671 Introduction to Computer Science I, COMP 1672 Introduction to Computer Science II, COMP 2673 Introduction to Computer Science III, COMP 2300 Discrete Structures in Computer Science, COMP 2370 Introduction to Algorithms & Data Structures, and COMP 2691 Introduction to Computer Organization (or equivalent).
Official scores from the Test of English as a Foreign Language (TOEFL), International English Language Testing System (IELTS), C1 Advanced or Duolingo English Test are required of all graduate applicants, regardless of citizenship status, whose native language is not English or who have been educated in countries where English is not the native language. Your TOEFL/IELTS/C1 Advanced/Duolingo English Test scores are valid for two years from the test date.
The minimum TOEFL/IELTS/C1 Advanced/Duolingo English Test score requirements for this degree program are:
Minimum TOEFL Score (Internet-based test): 80
Minimum IELTS Score: 6.5
Minimum C1 Advanced Score: 176
Minimum Duolingo English Test Score: 115
Additional Information:
Read the English Language Proficiency policy for more details.
Read the Required Tests for GTA Eligibility policy for more details.
Per Student & Exchange Visitor Program (SEVP) regulation, international applicants must meet all standards for admission before an I-20 or DS-2019 is issued, [per U.S. Federal Register: 8 CFR § 214.3(k)] or is academically eligible for admission and is admitted [per 22 C.F.R. §62]. Read the Additional Standards For International Applicants policy for more details.
Transcripts, letters of recommendation.
Required Essays and Statements
We require a scanned copy of your transcripts from every college or university you have attended. Scanned copies must be clearly legible and sized to print on standard 8½-by-11-inch paper. Transcripts that do not show degrees awarded must also be accompanied by a scanned copy of the diploma or degree certificate. If your academic transcripts were issued in a language other than English, both the original documents and certified English translations are required.
Transcripts and proof of degree documents for postsecondary degrees earned from institutions outside of the United States will be released to a third-party international credential evaluator to assess U.S. education system equivalencies. Beginning July 2023, a non-refundable fee for this service will be required before the application is processed.
Upon admission to the University of Denver, official transcripts will be required from each institution attended.
Three (3) letters of recommendation are required. Letters should be submitted by recommenders through the online application.
Personal statement instructions.
A personal statement of at least 300 words is required. Your statement should include information concerning your life, education, experiences, interests and reason for applying to DU.
The résumé (or C.V.) should include work experience, research, and/or volunteer work.
Online Application
Start your application.
Your submitted materials will be reviewed once all materials and application fees have been received.
Our program can only consider your application for admission if our Office of Graduate Education has received all your online materials and supplemental materials by our application deadline.
Application Fee: $65.00 Application Fee
International Degree Evaluation Fee: $50.00 Evaluation Fee for degrees (bachelor's or higher) earned from institutions outside the United States.
Applicants should complete their Free Application for Federal Student Aid (FAFSA) by February 15. Visit the Office of Financial Aid for additional information.
COMMENTS
A small number of highly qualified students are admitted each year to the PhD Program in Computer Science. Admission is very competitive, based primarily on research-oriented reference letters, academic grades, and overall experience and record. Applicants need not already hold a master's degree; bachelor's degree-level applicants are also ...
Computer Science Department 500 West 120 Street, Room 450 MC0401 New York, New York 10027 Main Office: +1-212-853-8400 Directions Map Directory
All doctoral students are expected to complete an acceptable lecture course (graduate or upper-level undergraduate) in Analysis of Algorithms, with grade B+ or higher, prior to entering the program. Sometimes new doctoral students are admitted without a prior Analysis of Algorithms course. Those students are required to complete CSOR W4231 ...
Graduate School Rankings. # 12. in Best Business Schools (tie) in Accounting. # 6. in Business Analytics. in Entrepreneurship. # 4. in Executive MBA.
Introduction to GSAS Admissions. Thank you for your interest in applying to the Graduate School of Arts and Sciences of Columbia University. One of the nation's oldest and most distinguished graduate schools, GSAS confers graduate degrees in the humanities, natural sciences, and social sciences. Our renowned faculty works with students to ...
The Fu Foundation School of Engineering and Applied Science at Columbia University (Fu Foundation) has 214 full-time faculty on staff. ... At-a-Glance. Acceptance Rate (master's) 24.7%. Tuition ...
Computer Science; Earth and Environmental Engineering; ... Columbia Engineering's PhD and EngScD programs immerse you in the highest levels of engineering practice and research. You'll have opportunities to work in our many interdisciplinary institutes, centers, and laboratories with top researchers. ... Admissions (212) 854-4688 | ...
450 Computer Science Building , New York, NY 10027-7003 (212) 939-7000. [email protected]. Website. Earth Sciences. Program and Specialty rankings #4. in Earth Sciences (tie) #2.
Students who pass the Computer Science Advanced Placement Exam A with a 4 or 5 will receive 3 points and an exemption from COMS W1004. The Computer Science Minor consists of 6 courses as follows: 1. COMS W1004: Intro to computer science and programming in Java (3) or COMS W1007: Honors intro to comp sci (3) 2.
Admissions; MA Programs; PhD Programs; Dual-Degree & Certificate Programs; ... In the first year of the program at Columbia, students will be charged the tuition rates listed above in the "All Other Master's Programs" section. ... Graduate School of Arts and Sciences 109 Low Memorial Library, MC 4306, 535 West 116th Street · New York, NY 10027 ...
My first question has to do with the acceptance rates of various CS Masters degree programs. I found that it was very difficult to search for the acceptance rates for various schools that I am interested in. ... graduate-admissions; masters; computer-science; Share. Improve this question. Follow edited Oct 25, 2014 at 19:53. enthu. 7,568 ...
STEP 1: Complete and submit an online application: Refer to the. After you submit the application, reference requests are sent to your recommendation providers. Your application will be assigned to the faculty on the MS Admissions committee and pass through several stages of review. Official decision notifications will be sent out via email.
WWW Home Page Address: www.columbia.edu. Admissions Phone Number: 212-854-2522. Admissions Toll-free Number: Admissions Ofice Mailing Address: 212 Hamilton Hall MC2807, 1130 Amsterdam Ave; New York, NY 10027. Admissions Fax Number: 212-854-1209. Admissions E-mail Address: [email protected].
Search up-to-date admission results to more than 250 graduate schools. With over 840,000 admission results submitted, TheGradCafe helps millions of grad students each year with their admissions journey. ... ETH Zurich - Swiss Federal Institute Of Technology Computer Science. 7. Columbia University Computer Science. 8.
The unofficial subreddit of Columbia University and the Morningside Heights community in New York, NY. Acceptance Rate of MS Computer Science? I know that Columbia has one of the lowest acceptance rates in the US (between 5-7%) -- However, that seems to represent the undergraduate acceptance rate, and not postgraduate.
This 4.8 percent acceptance rate is not the acceptance rate for Stanford's grad programs (what I searched for) but rather the acceptance rate for undergrads. So always cross-check any statistics Google gives you. You can also consult grad school data websites such as Peterson's and StartClass.
Explore the graduate programs and degrees offered by Columbia University at US News. Learn about admissions, tuition, and student life at this prestigious institution.
Most T20 CS PhD have ~10% acceptance rate. T10s have slightly lower rate (5~10%). But these "acceptance rate" for CS PhDs are really meaningless because there are just too many variances and factors. Especially, the acceptance rate the school post online is representing that of ALL CS domains averaged out, so if you are applying to AI/ML/CV/NLP ...
A student who holds an appropriate bachelor's degree in engineering may apply for admission to either the MS only or MS leading to PhD program. A student who has not already earned an MS degree and is looking to pursue a doctoral degree should apply for admission to the MS/PhD track program, with the exception of the Computer Science PhD program.
If you're short on time, here's a quick answer to your question: Columbia's overall graduate school acceptance rate is around 6%, but rates vary by program from 3% to 14%. In this comprehensive guide, we will dig into the acceptance rates for all of Columbia's graduate and professional degree programs. You'll find data on acceptance ...
Computer Science Department 500 West 120 Street, Room 450 MC0401 New York, New York 10027 Main Office: +1-212-853-8400 Directions Map Directory
The Doctoral program in Computer Science at the Massachusetts Institute of Technology is highly competitive, with an acceptance rate of 4% out of 33,240 applicants. The total cost of the program was $71,000 in 2019 and $62,280 in 2020, with 100% of students receiving financial aid.
Average admission statistics for Columbia University. Average GPA, GRE, GMAT, LSAT, MCAT, TOEFL, IELTS scores along with average salaries, enrollment details, scholarships, and more! ... Rate My Chances considers your YMGrad profile and estimates a percent chance of your admit with profile building advice. ... Computer Science. Data Science ...
The program provides a unique opportunity to develop leading-edge in-depth knowledge of specific computer science disciplines. The department currently offers concentration tracks covering eight such disciplines. MS students are encouraged to participate in state-of-the-art research with our research groups and labs. overall GPA.
The PhD in Computer Science is administered by the division of Computer Science in the department of Electrical Engineering and Computer Science. Some aspects of the program are delegated to the CEAS Graduate Office. ... Admission. An applicant must meet Graduate School requirements plus these program requirements to be considered for admission ...
Prerequisite courses for the PhD include: COMP 1671 Introduction to Computer Science I, COMP 1672 Introduction to Computer Science II, COMP 2673 Introduction to Computer Science III, COMP 2300 Discrete Structures in Computer Science, COMP 2370 Introduction to Algorithms & Data Structures, and COMP 2691 Introduction to Computer Organization (or ...