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

Spring 2014 Computer Science W3261 section 001
COMPUTER SCIENCE THEORY

Call Number 26862
Day & Time
Location
TR 2:40pm-3:55pm
833 Seeley W. Mudd Building
Points 3
Approvals Required None
Instructor Allison Lewko
Type LECTURE
Course Description Prerequisites: COMS W3203 Corequisites: COMS W3134, W3136, or 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 CourseWorks
Department Computer Science
Enrollment 112 students (120 max) as of 7:28PM Sunday, July 27, 2014
Final Exam Day/Time May 15
R 1:10pm-4:00pm
Final Location 833 Seeley W. Mudd Building
Subject Computer Science
Number W3261
Section 001
Division Interfaculty
Open To Columbia College, Engineering and Applied Science: Undergraduate, General Studies, School of Continuing Education, Global Programs, Graduate School of Arts and Science, School of the Arts, International and Public Affairs, Barnard, Engineering and Applied Science: Graduate
Campus Morningside
Section key 20141COMS3261W001

Home      About This Directory      Online Bulletins      ColumbiaWeb
SIS update 07/27/14 19:28    web update 07/28/14 15:02