CS 250, Discrete Structures, Fall 2014 Nitesh Saxena

Slides:

Advertisements

Similar presentations

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

Advertisements

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.

Introduction to Discrete Mathematics J. H. Wang Sep. 14, 2010.

CS 250, Discrete Structures, Fall 2011 Nitesh Saxena

Discrete Mathematics CS204 Spring CS204 Discrete Mathematics Instructor: Professor Chin-Wan Chung (Office: Rm 3406, Tel:3537) 1.Lecture 1)Time:

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

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 6.1: Misc. Topics: Number Theory CS 250, Discrete Structures, Fall 2011 Nitesh Saxena.

Lecture 5.4: Paths and Connectivity 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 2015 Nitesh Saxena Adopted from previous lectures by Cinda Heeren.

Lecture 4.2: Relations CS 250, Discrete Structures, Fall 2013 Nitesh Saxena Adopted from previous lectures by Cinda Heeren, Zeph Grunschlag.

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

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

Lecture 4.4: Equivalence Classes and Partially Ordered Sets CS 250, Discrete Structures, Fall 2012 Nitesh Saxena Adopted from previous lectures by Cinda.

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.

Lecture 5.3: Graph Isomorphism and Connectivity CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Zeph Grunschlag.

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 5.2: Special Graphs and Matrix Representation

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

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

Lecture 3.2: Induction and Strong Induction (contd.)

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 2014

CS 250, Discrete Structures, Fall 2013

CS 250, Discrete Structures, Fall 2015

CS 250, Discrete Structures, Fall 2015

Locations for CS 115 Activities

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

Lecture 31 CSE 331 Nov 12, 2010.

Lecture 1.6: Proof Techniques (contd)

Lecture 5.3: Graph Isomorphism and Paths

CS 250, Discrete Structures, Fall 2014 Nitesh Saxena

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

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 2014 Nitesh Saxena Mid-Term 2 Review CS 250, Discrete Structures, Fall 2014 Nitesh Saxena

Course Admin Graded HW2 HW3 Due Covers “Induction and Recursion” (Chapter 5) Due 11am Nov 6 (Thursday) 4/5/2019

Course Admin Mid Term 2 Nov 6 (Thur) Covers “Induction and Recursion” (Chapter 5) Review today Study topics posted Sample practice exam provided 4/5/2019

Traveling Next Week At a conference (Nov 3-7): http://www.sigsac.org/ccs/CCS2014/ Mid-term proctored by TA No class next Tuesday (Nov 4) – prepare for exam Office hrs extended – 3-5pm Thursday. 4/5/2019

Lecture 3.4 -- Recursive Algorithms Outline Review of: Weak Mathematical Induction Strong Mathematical Induction Recursion and Recursive Algorithms Sample exam Let’s take notes – whiteboard lecture 10/06/2011 Lecture 3.4 -- Recursive Algorithms

Lecture 3.4 -- Recursive Algorithms Today’s Reading Rosen 5.1 to 5.4 10/06/2011 Lecture 3.4 -- Recursive Algorithms