CSC 341Auto, Frm Lng, Cmp Cmplxty

Grinnell College · 4 credits · UGRD

Catalog

A formal study of computational devices, their related languages, and the possibility and difficulty of computations. Examples are pushdown automata and Turing machines, context-free languages and recursively enumerable sets, and the halting problem and NP-completeness. Prerequisite: Computer Science 207 and either Mathematics 218 or Computer Science/Mathematics 208, with grades S, C, or better. AUTRY, EIKMEIER OSERA.

Recent sections

Fall 2026 · 1 section

Aug 27 – Dec 18

Section	Days & time	Location	Instructor
01Class #98524-CSC-341-01	Tuesday, Thursday 1:10 PM - 2:30 PM Noyce Science Ctr 3820 (Lecture)	Noyce Science Ctr 3820	Shawn Ong