This preview shows page 1. Sign up to view the full content.
Unformatted text preview: UMass Lowell Computer Science 91.304 91 304 Foundations of Computer Science
Prof. Karen Daniels f i l
Fall, 2011 Lecture 1 Introduction/Overview I t d ti /O i
Friday 9/2/2011 Web W Web Page eb Page
http://www.cs.uml.edu/~kdaniels/courses/304_F11.html p Nature of the Course Core course: required for all CS majors Advanced undergraduate level Graduate students take separate course (91.502) "Pencil-and-paper "Pencil-and-paper" exercises Pencil No programming required Prerequisites Discrete Math I & II (92 321 92 322) (92.321, 92.322) Summations Combinations Proofs MATH
Sets Probability Permutations Logarithms L ih Growth of Functions Recurrences What's it all about?
source: textbook -Three areas below are central to the theory of computation. -They are linked by the common question: -"What are the fundamental capabilities and limitations of computers?" p Automata and Languages Starting point for models of computation Finite automaton used in text processing, compilers, hardware design. Context-free grammar used in programming languages and AI. What is an algorithm? What is computable? What is "decidable?" decidable? Theoretical models led to actual computer construction. Helps to identify useful approaches to real problems. Classify problems as easy or "hard" by creating complexity classes. Cryptography has used computationally hard problems to design codes. Computability Theory Complexity Theory (in textbook but beyond scope of this co rse) Comple it Theor te tbook b t be ond course) Course Structure: 2 Parts
Automata and Languages Regular Languages ContextContext-Free Languages ChurchChurch-Turing Thesis Decidability Reducibility y Computability Theory Textbook Required: Introduction to the Theory of Computation y f p by Michael Sipser gy Thomson Course Technology 2006 0-534-95097 ISBN 0-534-95097-3
2nd Edition see course web site (Related Links) for errata (2nd edition) Ordered for UML bookstore Syllabus (current plan) Syllabus (current plan, continued) Important Dates Chapter 0 Quiz (closed book) Midterm Exam (Chapters 0-2): Midt E Friday, 9/9 Friday, Friday, 10/21 Friday F id , TBA Open book Open book Final Exam (Chapters 0-5): ): Grading Homework Quiz (chapter 0, closed book) Midterm (chapters 0-2, open book & notes) Discretionary (attendance, participation) Final Exam (chapters 0-5, open book & notes) 05 30% 5% 30% 5% 30% ...
View Full Document
- Fall '11
- Computer Science