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

Fall 2019 Computer Science W3261 section 002
COMPUTER SCIENCE THEORY

Call Number 35943
Day & Time
Location
TR 4:10pm-5:25pm
451 Computer Science Building
Points 3
Grading Mode Standard
Approvals Required None
Instructor Omri Weinstein
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 100 students (110 max) as of 8:04AM Saturday, February 22, 2020
Subject Computer Science
Number W3261
Section 002
Division Interfaculty
Campus Morningside
Section key 20193COMS3261W002

Home      About This Directory      Online Bulletins      ColumbiaWeb      SSOL
SIS update 02/22/20 08:04    web update 02/22/20 11:19