03+Slides--Introduction - CS103 HO#3 Introduction CS103...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
CS103 HO#3 Introduction 3/28/11 1 CS103 Mathematical Foundations of Computing Robert Plummer 3/28/11 Logic Induction Sets, Relations, and Functions Automata and Formal Languages Computability Theory Complexity Theory CS103 Mathematical Foundations of Computing Why Is CS103 Important? Proof skills Way of Thinking Foundations of CS Applications Programming Languages Compilers Circuit Design AI Cryptography Intellectually and Philosophically Interesting Course Details Instructor: Bob Plummer Gates 178 Office hours M TBA, W 3:45 – 5:30 or by appointment TAs: Mingyu Kim Kevin Leung Neel Murthy Hrysoula Papadakis Evan Rosen Conal Sathi Ryan Thompson Karl Uhlig "Working Office Hours" to be announced Online Course Support This quarter we will be using CourseWork to report grades, and as our repository for handouts, announcements, etc. Only lecture slides will be delivered in hard copy form. All other handouts (including assignments) will be on CourseWork. The website is http://coursework.stanford.edu We also have an email hotline that is closely monitored by course staff: [email protected] Textbooks 1. Custom book for Logic portion of the class Introduction to Theory of Computation, CS103. Instructor: Robert Plummer. Available at the Bookstore only 2. Text for the second part of the course Sipser, Introduction to the Theory of Computation, 2 nd Ed. Some course notes will also be distributed
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
CS103 HO#3 Introduction 3/28/11 2 Midterm Thursday, April 21, 7 – 9 pm Final Monday, June 6, 12:15 – 3:15 pm The Final covers only material in Sections III – VII of the Syllabus. Locations to be announced Alternate exams are given on an individual basis and and only for emergencies or official university business. Exams 9 written problem sets, counted equally Due in class 3 free late days (max. 1 on any assignment) Not accepted more than one class period late Late without a late day: -10% You may work with others in the class, but you must write up your problem sets individually and give the names of those you work with. Revealing an answer denies the other person the opportunity for the "Aha!" experience Homework Policy Midterm 20% Final 35% Homework 45% Grading A proposition is a declarative statement that is either true or false (but not both). Bob is teaching this class. 3 > 2 It is snowing outside. This program sorts any list of positive integers into non-decreasing order. Propositional Calculus The first thing we will study is how to combine propositions into larger propositions and how to determine the truth value of the results.
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 06/01/2011 for the course EE 103 taught by Professor Plummer during the Spring '11 term at Stanford.

Page1 / 8

03+Slides--Introduction - CS103 HO#3 Introduction CS103...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online