Welcome to CSE 311: Foundations of Computing I F Instructor: Rajesh - - PowerPoint PPT Presentation

welcome to cse 311 foundations of computing i
SMART_READER_LITE
LIVE PREVIEW

Welcome to CSE 311: Foundations of Computing I F Instructor: Rajesh - - PowerPoint PPT Presentation

Welcome to CSE 311: Foundations of Computing I F Instructor: Rajesh Rao (rao@cs.washington.edu) F TAs: Jason Ganzhorn (ganzhj@cs) Michael Ayzenberg (mickayz@cs) R. Rao, CSE 311 Lecture 1 1 Welcome to CSE 311: Foundations of Computing I F


slide-1
SLIDE 1

1

  • R. Rao, CSE 311 Lecture 1

Welcome to CSE 311: Foundations of Computing I

F Instructor: Rajesh Rao (rao@cs.washington.edu) F TAs:

Jason Ganzhorn (ganzhj@cs) Michael Ayzenberg (mickayz@cs)

slide-2
SLIDE 2

2

  • R. Rao, CSE 311 Lecture 1

Welcome to CSE 311: Foundations of Computing I

F Instructor: Rajesh Rao (rao@cs.washington.edu) F TAs:

Jason Ganzhorn (ganzhj@cs) Michael Ayzenberg (mickayz@cs)

slide-3
SLIDE 3

3

  • R. Rao, CSE 311 Lecture 1

Syllabus and Course Information

F Browse class web page for syllabus and course information:

http://www.cs.washington.edu/cse311/

F Lecture slides will be made available on the website after

class

F Textbook

Discrete Mathematics and Its Applications 6th Ed. (2007) By Kenneth Rosen

slide-4
SLIDE 4

4

  • R. Rao, CSE 311 Lecture 1

Today’s Agenda

F Course Topics and Goals F How do I get an A? F Intro to Propositional Logic Sections 1.1-1.2 in the text

slide-5
SLIDE 5

5

  • R. Rao, CSE 311 Lecture 1

Course Topics

F Logic and Proof s (Chap. 1) F Sets, Functions, and Binary Relations (Chaps. 2, 8) F Number Theory (Chap. 3) F Induction (Chap. 4) F Graphs and Trees (Chaps. 9, 10) F Circuits (Chap. 11) F Finite State Machines and Computability (Chap. 12)

slide-6
SLIDE 6

6

  • R. Rao, CSE 311 Lecture 1

Course Goals

F Learn definitions and basic tools for reasoning

about discrete mathematical objects useful for computer science and engineering

F Learn to mathematically express and analyze a

computational problem

F Learn to rigorously prove statements about

computation

F Hone your analytical skills for your future career!

slide-7
SLIDE 7

7

  • R. Rao, CSE 311 Lecture 1

How do I get an A in this class?

F Answer: Practice, Practice, Practice (solving problems) F Weekly homework assignments (50%)

Total of about 7 assignments Collaborative/group work is encouraged but only after you have tried to solve each problem by yourself first No copying of solutions – explain in your own words!! See Course Policies regarding this on the class website No late submissions: due at the beginning of class on due date

F Midterm exam (20%) Monday, February 7, 2011 in class F Final exam (30%) 2:30-4:20 p.m. Monday, March 14, 2011 in class

slide-8
SLIDE 8

8

  • R. Rao, CSE 311 Lecture 1

Okay, time to wake up…

slide-9
SLIDE 9

9

  • R. Rao, CSE 311 Lecture 1

Let’s begin with some logic…

F Introduction to Propositional Logic:

Propositions Logical Notation and Truth Tables Conditional Statements Translating English into Logical Expressions and vice versa “It’s now  never”

slide-10
SLIDE 10

10

  • R. Rao, CSE 311 Lecture 1

Next Class: Equivalences & Predicate Logic…

F Things to do: Visit course website Read Chapter 1