NOTE: Course information changes frequently, including Methods of Instruction. Please revisit these pages periodically for the most recent and up-to-date course information. | |
Fall 2021 Computer Science W3261 section 001 COMPUTER SCIENCE THEORY | |
Call Number | 13344 |
Day & Time Location |
MW 2:40pm-3:55pm 501 Northwest Corner Building |
Points | 3 |
Grading Mode | Standard |
Approvals Required | None |
Instructor | Xi Chen |
Type | LECTURE |
Method of Instruction | In-Person |
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 | 150 students (164 max) as of 4:48PM Thursday, May 26, 2022 |
Subject | Computer Science |
Number | W3261 |
Section | 001 |
Division | Interfaculty |
Open To | Barnard College, Columbia College, Engineering:Undergraduate, Engineering:Graduate, GSAS, Global Programs, General Studies, Journalism |
Campus | Morningside |
Section key | 20213COMS3261W001 |
Home About This Directory Online Bulletins ColumbiaWeb SSOL |