CS 250, Discrete Structures, Fall 2015 Nitesh Saxena

Slides:

Advertisements

Similar presentations

Lecture 1.4: Rules of Inference CS 250, Discrete Structures, Fall 2014 Nitesh Saxena Adopted from previous lectures by Cinda Heeren.

Advertisements

Announcements DS-533 Fall Week 1: August 25 Read: –Business Forecasting Chapter 2 Do problems: –3, 5, 7, 9, 12, Hand-in assignments –4, 8, 14.

Lecture 4.5: POSets and Hasse Diagrams CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Cinda Heeren.

9/8/2011Lecture Functions1 Lecture 2.4: Functions CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Cinda.

Lecture 3.1: Mathematical Induction CS 250, Discrete Structures, Fall 2014 Nitesh Saxena Adopted from previous lectures by Cinda Heeren, Zeph Grunschlag.

CS 250, Discrete Structures, Fall 2011 Nitesh Saxena

Lecture 3.4: Recursive Algorithms CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Zeph Grunschlag.

Lecture 2.2: Set Theory* CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Cinda Heeren.

Lecture 4.2: Hash Functions: Design* CS 436/636/736 Spring 2012 Nitesh Saxena * some slides borrowed from Gene Tsudik.

1 Lecture 3.3: Recursion CS 250, Discrete Structures, Fall 2012 Nitesh Saxena Adopted from previous lectures by Cinda Heeren, Zeph Grunschlag.

Lecture 4.3: Closures and Equivalence Relations CS 250, Discrete Structures, Fall 2013 Nitesh Saxena Adopted from previous lectures by Cinda Heeren.

Lecture 2.1: Sets and Set Operations CS 250, Discrete Structures, Fall 2014 Nitesh Saxena Adopted from previous lectures by Cinda Heeren.

Lecture 1.3: Predicate Logic CS 250, Discrete Structures, Fall 2012 Nitesh Saxena Adopted from previous lectures by Cinda Heeren.

Lecture 2.2: Set Theory CS 250, Discrete Structures, Fall 2015 Nitesh Saxena Adopted from previous lectures by Cinda Heeren.

Lecture 2.5: Sequences CS 250, Discrete Structures, Fall 2014 Nitesh Saxena Adopted from previous lectures by Zeph Grunschlag.

Lecture 1.4: Rules of Inference, and Proof Techniques* CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Cinda Heeren.

9/13/2011Lecture Sequences1 Lecture 2.5: Sequences* CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Zeph.

Lecture 1.3: Predicate Logic, and Rules of Inference* CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Cinda Heeren.

Lecture 1.5: Proof Techniques CS 250, Discrete Structures, Fall 2012 Nitesh Saxena Adopted from previous lectures by Cinda Heeren 1.

9/29/2011Lecture Strong Induction1 Lecture 3.2: Strong Induction CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures.

9/27/2011 Lecture Mathematical Induction1 Lecture 3.1: Mathematical Induction* CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from.

Lecture 3.4: Recursive Algorithms CS 250, Discrete Structures, Fall 2015 Nitesh Saxena Adopted from previous lectures by Zeph Grunschlag.

Lecture 1.5: Proof Techniques

Lecture 5.4: Paths and Connectivity

Lecture 1.2: Equivalences, and Predicate Logic

Lecture 5.2: Special Graphs and Matrix Representation

Lecture 1.4: Rules of Inference

Lecture 4.1: Relations Basics

Lecture 1.5: Proof Techniques

Lecture 4.3: Closures and Equivalence Relations

Lecture 3.2: Induction and Strong Induction (contd.)

FINAL EXAM INFORMATION

FINAL EXAM INFORMATION

CSE477 VLSI Digital Circuits Fall 2002 Lecture 14: Midterm Review

Lecture 4.1: Relations Basics

Lecture 3.2: Induction, and Strong Induction

CS 250, Discrete Structures, Fall 2015

CS 250, Discrete Structures, Fall 2011 Nitesh Saxena

CS 250, Discrete Structures, Fall 2014

CS 336/536: Computer Network Security Fall 2015 Nitesh Saxena

Lecture 3.2: Induction, and Strong Induction

CS 250, Discrete Structures, Fall 2013

CS 250, Discrete Structures, Fall 2015

Lecture 4.3: Closures and Equivalence Relations

Lecture 3.2: Induction, and Strong Induction

Lecture 1.6: Proof Techniques (contd)

Lecture 1.3: Predicate Logic

CS 250, Discrete Structures, Fall 2015 Nitesh Saxena

Lecture 2.1: Sets and Set Operations*

CS 250, Discrete Structures, Fall 2013

CS 250, Discrete Structures, Fall 2013

Lecture 10: Usable Security

Lecture 3.1: Mathematical Induction

Lecture 4.1: Relations Basics

CS 336/536: Computer Network Security Fall 2014 Nitesh Saxena

CS 250, Discrete Structures, Fall 2014 Nitesh Saxena

CS 250, Discrete Structures, Fall 2014 Nitesh Saxena

Lecture 1.6: Proof Techniques (contd)

Lecture 5.3: Graph Isomorphism and Paths

CS 250, Discrete Structures, Fall 2014 Nitesh Saxena

Lecture 2.3: Set Theory, and Functions

NOTICE Mid-term Exam on Tuesday, February 9

Lecture 1.4: Rules of Inference

Administrative Issues

CS 336/536: Computer Network Security Fall 2014 Nitesh Saxena

Lecture 3.1: Mathematical Induction

CS 336/536: Computer Network Security Fall 2015 Nitesh Saxena

CS 250, Discrete Structures, Fall 2015 Nitesh Saxena

Lecture 1.3: Predicate Logic

CS 250, Discrete Structures, Fall 2012

Presentation transcript:

CS 250, Discrete Structures, Fall 2015 Nitesh Saxena Mid-Term 1 Review CS 250, Discrete Structures, Fall 2015 Nitesh Saxena

Course Admin HW2 is due Oct 20 (Tues) 7/5/2019 Mid Term 1 Review

Course Admin – Mid-Term Exam Thursday, October 15, 11:00am- 12:15pm, lecture room Coverage: Chapter 1 (lecture 1.*) Chapter 2 (lecture 2.*) A List of Study Topics was provided A Sample Exam will be provided soon No class next Tuesday (Oct 13) Please utilize for exam prep 7/5/2019 Mid Term 1 Review

Outline As time allows: Propositional Logic Discrete Structures 7/5/2019 Mid Term 1 Review

Today’s Reading Lecture 1.* and 2.* Slides Book chapters 1 and 2 List of Study Topics 7/5/2019 Mid Term 1 Review