|
NOTE: Course information changes frequently, including Methods of Instruction. Please revisit these pages periodically for the most recent and up-to-date course information. | |
Spring 2023 Computer Science W3261 section 002 COMPUTER SCIENCE THEORY | |
| Call Number | 12407 |
| Day & Time Location |
MW 10:10am-11:25am 451 Computer Science 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 | 99 students (110 max) as of 3:07PM Wednesday, May 31, 2023 |
| Subject | Computer Science |
| Number | W3261 |
| Section | 002 |
| Division | Interfaculty |
| Open To | Barnard College, Columbia College, Engineering:Undergraduate, Engineering:Graduate, GSAS, Global Programs, General Studies, Journalism |
| Campus | Morningside |
| Section key | 20231COMS3261W002 |
Home About This Directory Online Bulletins ColumbiaWeb SSOL | |