1 / 5

Lecture 3.5: Mid-Term 2 Review

Lecture 3.5: Mid-Term 2 Review. CS 250, Discrete Structures, Fall 2011 Nitesh Saxena. Course Admin. HW2 has been graded Scores posted on BB Pick up today after the lecture HW3 has been posted Due 11am, Monday Oct 24 Covers “Induction and Recursion” (Chapter 5)

trevet
Download Presentation

Lecture 3.5: Mid-Term 2 Review

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Lecture 3.5: Mid-Term 2 Review CS 250, Discrete Structures, Fall 2011 Nitesh Saxena

  2. Course Admin • HW2 has been graded • Scores posted on BB • Pick up today after the lecture • HW3 has been posted • Due 11am, Monday Oct 24 • Covers “Induction and Recursion” (Chapter 5) • Please start working on it right away, as this will serve as a good practice for the exam Lecture 3.4 -- Recursive Algorithms

  3. Course Admin • Mid-Term 2 Exam • Thu, Oct 20, in class, 11-12:15 • Covers Chapter 5 (lecture 3.1 – 3.5) • Similar set of rules as Mid-Term 1 • Closes book/notes/any reference • No calculators or computing devices are allowed • No class on Oct 13 – Fall Break  • No class on Oct 18 • I am traveling to attend and present a paper at the ACM Conference on Computer and Communications Security, Chicago, from Oct 16 -- 19 • This will not affect our overall material coverage. • Please utilize this time for studying for the exam Lecture 3.4 -- Recursive Algorithms

  4. Outline Review of: • Weak Mathematical Induction • Strong Mathematical Induction • Recursion and Recursive Algorithms • Let’s take notes – whiteboard lecture Lecture 3.4 -- Recursive Algorithms

  5. Today’s Reading • Rosen 5.1 to 5.4 Lecture 3.4 -- Recursive Algorithms

More Related