Lecture 19 CSE 331 Oct 10, 2016.

Slides:



Advertisements
Similar presentations
Lecture 20 CSE 331 Oct 10, HW 5 due today Place Q1, Q2 and Q3 in separate piles I will not accept HWs after 1:15pm.
Advertisements

Merge Sort 4/15/2017 6:09 PM The Greedy Method The Greedy Method.
Lecture 37 CSE 331 Nov 4, Homework stuff (Last!) HW 10 at the end of the lecture Solutions to HW 9 on Monday Graded HW 9 on.
Lecture 28 CSE 331 Nov 9, Flu and HW 6 Graded HW 6 at the END of the lecture If you have the flu, please stay home Contact me BEFORE you miss a.
Lecture 21 CSE 331 Oct 20, Announcements Graded mid-term exams at the END of the lecture Sign up for blog posts/group scribe leader No more than.
Lecture 23 CSE 331 Oct 24, Temp letter grades assigned See the blog post for more details.
CSE 421 Algorithms Richard Anderson Lecture 6 Greedy Algorithms.
Lecture 24 CSE 331 Oct 30, Homework stuff Please turn in your HW 6 Graded HW 5 and HW 7 at the END of the lecture.
Lecture 36 CSE 331 Dec 2, Graded HW 8 END of the lecture.
Lecture 34 CSE 331 Nov 30, Graded HW 8 On Wednesday.
Lecture 37 CSE 331 Dec 1, A new grading proposal Towards your final score in the course MAX ( mid-term as 25%+ finals as 40%, finals as 65%) .
Lecture 24 CSE 331 Oct 27, Online office hours tonight 9:00pm.
Lecture 20 CSE 331 Oct 21, Algorithm for Interval Scheduling R: set of requests Set A to be the empty set While R is not empty Choose i in R with.
Called as the Interval Scheduling Problem. A simpler version of a class of scheduling problems. – Can add weights. – Can add multiple resources – Can ask.
CSCI-256 Data Structures & Algorithm Analysis Lecture Note: Some slides by Kevin Wayne. Copyright © 2005 Pearson-Addison Wesley. All rights reserved. 8.
CSE 331: Review. Main Steps in Algorithm Design Problem Statement Algorithm Real world problem Problem Definition Precise mathematical def “Implementation”
CSCI 256 Data Structures and Algorithm Analysis Lecture 6 Some slides by Kevin Wayne copyright 2005, Pearson Addison Wesley all rights reserved, and some.
Lecture 8 CSE 331. Main Steps in Algorithm Design Problem Statement Algorithm Problem Definition “Implementation” Analysis n! Correctness+Runtime Analysis.
Lecture 18 CSE 331 Oct 12, HW 5 due today Q1, Q2 and Q3 in different piles I will not take any HW after 1:15pm.
Lecture 18 CSE 331 Oct 6, Group/Algo registration deadline BOTH DUE WED by 11:59pm!
Lecture 9 CSE 331 June 18, The “real” end of Semester blues MondayTuesdayWednesdayThursdayFriday Project 331 HW Exam study Party! Write up a term.
Lecture 32 CSE 331 Nov 16, 2016.
Lecture 31 CSE 331 Nov 14, 2016.
Merge Sort 7/29/ :21 PM The Greedy Method The Greedy Method.
Lecture 16 CSE 331 Oct 5, 2016.
Lecture 17 CSE 331 Oct 3, 2014.
Lecture 31 CSE 331 Nov 13, 2017.
Lecture 34 CSE 331 Nov 26, 2012.
Lecture 22 CSE 331 Oct 22, 2010.
Lecture 34 CSE 331 Nov 26, 2012.
Lecture 21 CSE 331 Oct 21, 2016.
Lecture 21 CSE 331 Oct 20, 2017.
Merge Sort 11/28/2018 2:18 AM The Greedy Method The Greedy Method.
Merge Sort 11/28/2018 2:21 AM The Greedy Method The Greedy Method.
Merge Sort 11/28/2018 8:16 AM The Greedy Method The Greedy Method.
Lecture 20 CSE 331 Oct 14, 2016.
Lecture 17 CSE 331 Oct 7, 2016.
Lecture 33 CSE 331 Nov 18, 2016.
Lecture 33 CSE 331 Nov 17, 2017.
Lecture 19 CSE 331 Oct 12, 2016.
Merge Sort 1/17/2019 3:11 AM The Greedy Method The Greedy Method.
Lecture 16 CSE 331 Oct 4, 2017.
Richard Anderson Lecture 6 Greedy Algorithms
Lecture 18 CSE 331 Oct 12, 2011.
Lecture 19 CSE 331 Oct 8, 2014.
Lecture 20 CSE 331 Oct 17, 2011.
Lecture 32 CSE 331 Nov 15, 2017.
Lecture 33 CSE 331 Nov 14, 2014.
Lecture 27 CSE 331 Oct 31, 2014.
Richard Anderson Autumn 2016 Lecture 7
Lecture 33 CSE 331 Nov 15, 2013.
Lecture 34 CSE 331 Nov 18, 2011.
Lecture 27 CSE 331 Nov 2, 2010.
Lecture 22 CSE 331 Oct 15, 2014.
Lecture 18 CSE 331 Oct 9, 2017.
Richard Anderson Lecture 7 Greedy Algorithms
Lecture 31 CSE 331 Nov 12, 2010.
Lecture 20 CSE 331 Oct 13, 2017.
Lecture 19 CSE 331 Oct 14, 2011.
Lecture 21 CSE 331 Oct 19, 2011.
Lecture 21 CSE 331 Oct 22, 2012.
Lecture 36 CSE 331 Nov 30, 2012.
Richard Anderson Winter 2019 Lecture 7
Merge Sort 5/2/2019 7:53 PM The Greedy Method The Greedy Method.
Lecture 25 CSE 331 Oct 28, 2011.
Week 2: Greedy Algorithms
Lecture 32 CSE 331 Nov 12, 2014.
Richard Anderson Autumn 2015 Lecture 7
Lecture 27 CSE 331 Nov 1, 2013.
Richard Anderson Autumn 2019 Lecture 7
Presentation transcript:

Lecture 19 CSE 331 Oct 10, 2016

Quiz starts at 1pm and ends at 1:10pm

In 1(b), IGNORE time taken to initialize data structures

Lecture starts at 1:15pm

Pitch grading half done Please wait for grading rubric before asking grading questions

Interval Scheduling Problem Input: n intervals [s(i), f(i)) for 1≤ i ≤ n Output: A schedule S of the n intervals No two intervals in S conflict |S| is maximized

Analyzing the algorithm R: set of requests S* has no conflicts Set S to be the empty set While R is not empty Choose i in R with the earliest finish time S* is an optimal solution Add i to S Remove all requests that conflict with i from R Return S* = S

Greedy “stays ahead” Greedy OPT

Today’s agenda Analyze run-time of the greedy algorithm Prove the correctness Analyze run-time of the greedy algorithm

Algorithm implementation Go through the intervals in order of their finish time 3 How can you tell in O(1) time if any of 2,3 or 4 conflict with 1? Check if s[i] < f(1) 2 1 4 O(n log n) run time In general, if jth interval is the last one chosen Pick smallest i>j such that s[i] ≥ f(j)

The final algo O(n log n) time sort intervals such that f(i) ≤ f(i+1) O(n) time build array s[1..n] s.t. s[i] = start time for i Add 1 to A and set f = f(1) For i = 2 .. n If s[i] ≥ f Add i to A Set f = f(i) Return A* = A

Reading Assignment Sec 4.1of [KT]

Questions?

The “real” end of Semester blues There are deadlines and durations of tasks Write up a term paper Party! Exam study 331 HW Project Monday Tuesday Wednesday Thursday Friday

The “real” end of Semester blues There are deadlines and durations of tasks Write up a term paper Exam study Party! 331 HW Project Monday Tuesday Wednesday Thursday Friday

The algorithmic task YOU decide when to start each task Write up a term paper Exam study You have to do ALL the tasks Party! 331 HW Project Monday Tuesday Wednesday Thursday Friday

Scheduling to minimize lateness All the tasks have to be scheduled GOAL: minimize maximum lateness Write up a term paper Exam study Party! 331 HW Project Monday Tuesday Wednesday Thursday Friday

One possible schedule All the tasks have to be scheduled GOAL: minimize maximum lateness Lateness = 0 Lateness = 2 331 HW Party! Exam study Write up a term paper Monday Tuesday Wednesday Thursday Friday