CS 252 - Introduction to Computational Theory - Winter 2016
General Information
Instructor:
Dennis Ng
Office: 3322 TMCB
Phone: 2-2835
E-mail: ng@compsci.byu.edu
Office Hours: See TA/Instructor Schedule (in
PDF
Format)
TAs
: Joel, Humphrey, Isaac, Brad, and Jarek
Office: 1154 TMCB
E-mail:
Office Hours: See TA/Instructor Schedule (in
PDF
Format)
Lecture Time & Location:
T TH 1:35 - 2:50 p.m. (Section 1) & 3:00 p.m. - 4:15 p.m. (Section 2) @ 130 MARB
Prerequisite:
CS236
Text:
Thomas A. Sudkamp, ``Languages and Machines: An Introduction to Theory of Computer Science, Third Edition," 2005, Addison Wesley (required).
Lecture Notes for CS 252
Objectives:
understand the fundamental concepts in theory of computation
know the traditional topics of formal languages, automata, computability, and computational complexity
distinguish problems that are decidable and undecidable (tractable and intractable, respectively)
Grading:
The final grade will be calculated as follows:
Homework Assignments: 25%
Team Assignments: 10%
Midterm Exams (2): 40%
Final Exam: 25%
Final letter grades will be given according to University (Grading) Policies.
Policy
(in
Postscript
or
PDF
format)
Class Information
Course Syllabus (in
Postscript
or
PDF
format)
Class Schedule (in
Postscript
or
PDF
format)
Lecture Notes
Homework Assignments
Honor Code
Final Exam Review
Created May 2, 2006
Modified April 7, 2016