CS310 Theoretical Computer Science

 

Course Syllabus

Fall 2014

 

Introduction

 

   This course is an introduction to the mathematical foundations of the theory of computation. We will study automata theory, formal languages, the theory of computability and undecidability, and computational complexity.  This material is central to many branches of computer science; it underlies the basic theory of compiler design, the efficiency of algorithms, and the limitations of computing. 

 

Aim

 

Have a basic understanding of complexity theory, computability theory, and automata theory.

 

Objectives

 

 

Topics 


  • Mathematical notation
  • Proof by Induction
  • (Non) Deterministic Finite Automata
  • Regular Expressions
  • Context Free Grammars
  • Decidability
  • The Halting Problem
  • Pumping Lemma
  • Pushdown Automata
  • Parsing
  • Turing Machines
  • Big O Notation
  • Reducibility
  • P/NP/NP-complete/P vs NP

The above topics are from the ACM Computing Curricula recommendations,
 
Instructor Details

 

Professor: Chadd Williams

Email: chadd@pacificu.edu

Office: Strain 202

Phone: (503) 352-3041

Office Hours:   M,W,Th 2-4pm

or by appointment

 

Course Basics

 

Course Title: CS310 Introduction to Theoretical Computer Science

Prerequisite: CS250

 

Meeting Times: MWF 4:45pm - 5:50pm

 

Location:        Marsh LL 15

Textbook:      Introduction to the Theory of Computation by Michael Sipser, PWS Publishing Company, ISBN 0321129474 (Second Edition)

From this text we will cover Chapters 0, 1, 2, most of 3, part of 4, 5, and most of 7.

Errata: http://www-math.mit.edu/~sipser/book.html

 

Software:       JFLAP -- http://www.jflap.org/

Course Website: http://zeus.cs.pacificu.edu/chadd2/cs310f14/

 

Course Assessment

 

 

Grade Distribution
Homework 20%
Unannounced Quizzes
  5%
Exam 1 25%
Exam 2 25%
Final 25%
Percent Breakdown


  92-100 A   90-92 A-
88-90 B+   82-88 B   80-82 B-
78-80 C+   72-78 C   70-72 C-
68-70 D+   60-68 D      
0-60 F            

 

 

 

Important Dates

 

(Tentative) Dates for Midterms

Date of Final


Other Dates

1 September Labor day holiday (no classes)

3 October No classes (Arts & Sciences)

26-28 November Thanksgiving break 

3 December Reading day


Class will be held on November 24!

 

Course Policies