CS 252 - Introduction to Computational Theory - Winter 2012, All Sections
General Information
Instructor:
Dennis Ng
Office: 3322 TMCB
Phone: 2-2835
E-mail: ng@cs.byu.edu
Office Hours: in
Postscript
or
PDF
format
TA:
Sole Pera, Brennan Smith, and Nathan Wonnacott
Office: 1154 TMCB
Phone: 2-7617
Office Hours: in
Postscript
or
PDF
format
Lecture Time & Location:
T TH 8:00 - 9:15 a.m. (Section 1), 9:30 - 10:45 a.m. (Section 2), 1:35 - 2:50 p.m. (Section 3) @ 373 MARB
Prerequisite:
CS236
or Concurrent Enrollment
Text:
Thomas A. Sudkamp, ``Languages and Machines: An Introduction to Theory of Computer Science, Third Edition," 2006, Addison Wesley (required).
Lecture Notes for CS 252
Objectives:
to study the theory of computation
to learn the traditional topics of formal languages, automata, computability, and computational complexity
to understand the foundations of theoretical computer science
Grading:
The final grade will be calculated as follows:
Homework Assignments: 20%
Projects: 30%
Midterm Exams (2): 30%
Final Exam: 20%
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
Projects
Honor Code
Created May 2, 2006
Modified February 7, 2012