Search Results

COMS W3261 Computer Science Theory. 3 points.

CC/GS: Partial Fulfillment of Science Requirement

Prerequisites: (COMS W3203) 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.

Fall 2017: COMS W3261
Course Number Section/Call Number Times/Location Instructor Points Enrollment
COMS 3261 001/22794 M W 1:10pm - 2:25pm
428 Pupin Laboratories
Alfred Aho 3 104/147
COMS 3261 002/78449 T Th 11:40am - 12:55pm
516 Hamilton Hall
Nakul Verma 3 45/54
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 130/130
COMS 3261 002/66946 M W 8:40am - 9:55am
207 Mathematics Building
Tal Malkin 3 130/130