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

Mar 17, 2023 •130 likes •242 views

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

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 Instructor: Rajesh Rao (rao@cs.washington.edu) F TAs: Jason Ganzhorn (ganzhj@cs) Michael Ayzenberg (mickayz@cs) R. Rao, CSE 311 Lecture 1 2
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 6 th Ed. (2007) By Kenneth Rosen R. Rao, CSE 311 Lecture 1 3
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 R. Rao, CSE 311 Lecture 1 4
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) R. Rao, CSE 311 Lecture 1 5
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! R. Rao, CSE 311 Lecture 1 6
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 R. Rao, CSE 311 Lecture 1 7
Okay, time to wake up… R. Rao, CSE 311 Lecture 1 8
Let’s begin with some logic… F Introduction to Propositional Logic: Propositions “It’s now  never” Logical Notation and Truth Tables Conditional Statements Translating English into Logical Expressions and vice versa R. Rao, CSE 311 Lecture 1 9
Next Class: Equivalences & Predicate Logic … F Things to do: Visit course website Read Chapter 1 R. Rao, CSE 311 Lecture 1 10

Download Presentation

Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

1. Introduction Autumn 2013 W.L. Ruzzo CSE 312, Au '13: Foundations of Computing II CSE Home

CSE 312 Foundations II 1. Introduction Autumn 2013 W.L. Ruzzo CSE 312, Au '13: Foundations of Computing II CSE Home About Us Search Contact Info Administrative Lecture: MGH 241 (schematic) MWF 1:30- 2:20 Schedule & Reading

232 views • 7 slides

Foundations of Distributed Computing in the 2020s Jukka Suomela What are the theoretical

Foundations of Distributed Computing in the 2020s Jukka Suomela What are the theoretical foundations of the modern society? Modern world large-scale communication networks Physical side: practice: computers, network equipment,

548 views • 53 slides

CSE 311 Foundations of 4.3 7 th Edition Computing I 3.5, 3.6 6 th Edition 2.5, 2.6 up

Announcements Reading assignments Today and Monday: CSE 311 Foundations of 4.3 7 th Edition Computing I 3.5, 3.6 6 th Edition 2.5, 2.6 up to p. 191 5 th Edition Lecture 11 Wednesday Modular Exponentiation and Primes

345 views • 5 slides

Foundations of Computing II Lecture 1: Welcome & Introduction Stefano Tessaro

CSE 312 Foundations of Computing II Lecture 1: Welcome & Introduction Stefano Tessaro tessaro@cs.washington.edu 1 Foundations of Computing II = Introduction to Probability & Statistics for computer scientists What is probability??

395 views • 28 slides

Foundations of Computer Science Lecture 23 Languages: What is Computing? A Formal Model of a

Foundations of Computer Science Lecture 23 Languages: What is Computing? A Formal Model of a Computing Problem Decision Problems and Languages Describing a Language: Regular Expressions Complexity of a Computing Problem Last Time 1 Comparing

405 views • 17 slides

Foundations of Distributed Computing in the 2020s Jukka Suomela Aalto University, Finland What

Foundations of Distributed Computing in the 2020s Jukka Suomela Aalto University, Finland What are the theoretical foundations of the modern society? Modern world large-scale communication networks Physical side: practice:

723 views • 51 slides

CSE 311 Foundations of Computing I Fall 2014 Remember, the site is

CSE 311 Foundations of Computing I Fall 2014 Remember, the site is http://tinyurl.com/ynlecture Get started on the green handout! Negations of Quantifiers x PurpleFruit(x) Domain: Fruit All fruits are

680 views • 21 slides

CSE 311 Foundations of 12.1 12.3 7 th Edition Computing I 11.1 11.3 6 th Edition

Announcements Reading assignments Boolean Algebra CSE 311 Foundations of 12.1 12.3 7 th Edition Computing I 11.1 11.3 6 th Edition 10.1 10.3 5 th Edition Lecture 4, Boolean Logic Predicates and Quantifiers

360 views • 5 slides

CSE 311: Foundations of Computing Lecture 6: More Predicate Logic Administrative Homework 2

CSE 311: Foundations of Computing Lecture 6: More Predicate Logic Administrative Homework 2 is now posted Make sure your submissions are readable! Monday: Martin Luther King Day holiday Tuesday: Extra office hours Jason

650 views • 36 slides

CSE 311: Foundations of Computing Lecture 2: More Logic, Equivalence & Digital Circuits If

CSE 311: Foundations of Computing Lecture 2: More Logic, Equivalence & Digital Circuits If you are worried about Mathy aspects of 311 Associated 1-credit CR/NC workshop CSE 390Z Extra collaborative practice on 311 concepts, study

1.19k views • 39 slides

CSE 311 Foundations of Administrative Computing I Course web:

CSE 311 Foundations of Administrative Computing I Course web: http://www.cs.washington.edu/311 Spring 2013, Lecture 3 Homework, Lecture slides, Office Hours ... Propositional Logic, Boolean Logic/Boolean Algebra Homework:

417 views • 9 slides

cse 311: foundations of computing Spring 2015 Lecture 27: Infinities and diagonalization

cse 311: foundations of computing Spring 2015 Lecture 27: Infinities and diagonalization [proved on page 86 of Volume II: The above proposition is occasionally useful.] Russells paradox: The set of all sets that do not contain

383 views • 27 slides

CSE 311: Foundations of Computing Lecture 15: Recursion & Strong Induction Applications:

CSE 311: Foundations of Computing Lecture 15: Recursion & Strong Induction Applications: Fibonacci & Euclid More Recursive Definitions Suppose that : . Then we have familiar summation notation: = (0)

599 views • 32 slides

Literature Foundations of parallel algorithms aff: Practical PRAM Programming. [PPP] Keller,

DF21500 Multicore Computing. Lecture on foundations of parallel algorithms. 2 C. Kessler, IDA, Link opings Universitet, 2011. DF21500 Multicore Computing. Lecture on foundations of parallel algorithms. 1 C. Kessler, IDA, Link opings

277 views • 16 slides

CSE 311 Foundations of Computing I Fall 2014 Useful GCD Fact If a and b are

CSE 311 Foundations of Computing I Fall 2014 Useful GCD Fact If a and b are posi-ve integers, then gcd (a,b) = gcd( b, a mod b) Proof: By

823 views • 17 slides

Course Introduction Foundations of Global Networked Computing: Building a Modern Computer From

IWKS 3300: NAND to Tetris Spring 2019 John K. Bennett Course Introduction Foundations of Global Networked Computing: Building a Modern Computer From First Principles This course is based upon the work of Noam Nisan and Shimon Schocken. More

1.03k views • 43 slides

Cybersecurity seen through a chao1c lens What is the problem and why is it important?

Cybersecurity seen through a chao1c lens What is the problem and why is it important? Security cannot be engineered into an interconnected and constantly changing cyberworld without leveraging the social and behavioral sciences We will

307 views • 7 slides

Large deviations of the top eigenvalue of random matrices and applications in statistical physics

Large deviations of the top eigenvalue of random matrices and applications in statistical physics Grgory Schehr LPTMS, CNRS-Universit Paris-Sud XI Analytical Results in Statistical Physics, in memory of Bernard Jancovici Large deviations

1.08k views • 75 slides

Proof of the DOZZ Formula Antti Kupiainen joint work with R. Rhodes, V. Vargas Diablerets

Proof of the DOZZ Formula Antti Kupiainen joint work with R. Rhodes, V. Vargas Diablerets February 12 2018 DOZZ formula Dorn, Otto (1994) and Zamolodchikov, Zamolodchikov (1996): ( 2 4 2 4 ) 2 Q 4 ) ( C ( 1 ,

1.32k views • 25 slides

From normal to anomalous deterministic diffusion Part 1: Normal deterministic diffusion Rainer

Outline Chaotic maps Deterministic diffusion End From normal to anomalous deterministic diffusion Part 1: Normal deterministic diffusion Rainer Klages Queen Mary University of London, School of Mathematical Sciences Sperlonga, 20-24

465 views • 29 slides

Introducing the Tax Credit Fast Track RAD First Component July 22, 2014 A GENDA Review the key

RENTAL ASSISTANCE DEMONSTRATION Introducing the Tax Credit Fast Track RAD First Component July 22, 2014 A GENDA Review the key components and timeline of the Tax 1. Credit Fast Track Learn about the requirement documents and 2. variations

266 views • 7 slides

Machine Learning Fall 2017 Unsupervised Learning (Clustering: k -means, EM, mixture models)

Machine Learning Fall 2017 Unsupervised Learning (Clustering: k -means, EM, mixture models) Professor Liang Huang (Chaps. 15-16 of CIML) Roadmap CIML Chaps. 3, 4,5,7,11,17 ,18 so far: (large-margin) supervised learning online learning:

815 views • 54 slides

Discrete Mathematics & Mathematical Reasoning Basic Structures: Sets, Functions, Relations,

Discrete Mathematics & Mathematical Reasoning Basic Structures: Sets, Functions, Relations, Sequences and Sums Colin Stirling Informatics Colin Stirling (Informatics) Discrete Mathematics (Chaps 2 & 9) Today 1 / 38 Sets A set is an

2.09k views • 179 slides

Welcome to the 2015 CHIPP Plenary First CHIPP Plenary meeting during an SPS annual meeting First

Welcome to the 2015 CHIPP Plenary First CHIPP Plenary meeting during an SPS annual meeting First edition of the PhD/postdoc days In January 2013, the CHIPP board agreed to the format of organizing the PhD student and PostDoc meeting

565 views • 15 slides