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

Spring 2019 Computer Science W3261 section 002
COMPUTER SCIENCE THEORY

Call Number 64141
Day & Time
Location
MW 7:10pm-8:25pm
To be announced
Points 3
Grading Mode Standard
Approvals Required None
Instructor Allison Bishop
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 102 students (110 max) as of 11:51PM Monday, June 24, 2019
Final Exam Day/Time
M 7:10pm-10:00pm
Final Location 451 Computer Science Building
Subject Computer Science
Number W3261
Section 002
Division Interfaculty
Open To Architecture, Planning, and Preservation, School of the Arts, Barnard, Columbia College, Engineering and Applied Science: Undergraduate, Engineering and Applied Science: Graduate, Graduate School of Arts and Science, General Studies, Global Programs
Campus Morningside
Section key 20191COMS3261W002

Home      About This Directory      Online Bulletins      ColumbiaWeb      SSOL
SIS update 06/24/19 23:51    web update 06/25/19 08:19