Directory of Classes
NOTE: Course information changes frequently. Please re-visit these pages periodically for the most recent and up-to-date information.

Spring 2020 Computer Science W3261 section 001
COMPUTER SCIENCE THEORY

Call Number 12622
Day & Time
Location
TR 10:10am-11:25am
To be announced
Points 3
Grading Mode Standard
Approvals Required None
Instructor Mihalis Yannakakis
Type LECTURE
Method of Instruction Classroom
Course Description 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.
Web Site Vergil
Department Computer Science
Enrollment 110 students (110 max) as of 10:04AM Saturday, December 14, 2019
Status Full
Subject Computer Science
Number W3261
Section 001
Division Interfaculty
Open To Barnard College, Columbia College, Engineering:Undergraduate, Engineering:Graduate, GSAS, Global Programs, General Studies
Campus Morningside
Section key 20201COMS3261W001

Home      About This Directory      Online Bulletins      ColumbiaWeb      SSOL
SIS update 12/14/19 10:04    web update 12/14/19 10:20