Search Results

COMS W3261 Computer Science Theory. 3 points.

CC/GS: Partial Fulfillment of Science Requirement

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.

Spring 2018: COMS W3261
Course Number Section/Call Number Times/Location Instructor Points Enrollment
COMS 3261 001/60678 M W 10:10am - 11:25am
207 Mathematics Building
Tal Malkin 3 131/152
COMS 3261 002/66946 M W 8:40am - 9:55am
207 Mathematics Building
Tal Malkin 3 94/152
Fall 2018: COMS W3261
Course Number Section/Call Number Times/Location Instructor Points Enrollment
COMS 3261 001/25322 M W 2:40pm - 3:55pm
Room TBA
Xi Chen 3 109/125
COMS 3261 002/13926 M W 4:10pm - 5:25pm
Room TBA
Xi Chen 3 89/135