This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Lecture 18
CSE 331
Oct 12, 2011 Midterm related stuff
Solutions will not be handed out
Jesse will discuss them in his recitations We will write solution sketches on your graded mid terms Questions? Main Steps in Algorithm Design
Problem Statement Problem Definition Algorithm
n!
“Implementation” Analysis Data Structures Correctness+Runtime Analysis Where do graphs fit in?
Problem Statement A tool to define
problems Problem Definition Algorithm “Implementation” Analysis Data Structures Correctness+Runtime Analysis Rest of the course
Problem Statement Problem Definition
Three
general
techniques Algorithm “Implementation” Analysis Data Structures Correctness+Runtime Analysis Greedy algorithms
Build the final solution piece by piece Being short sighted on each piece Never undo a decision Know when you see it End of Semester blues
Can only do one thing at any day: what is the
maximum number of tasks that you can do? Write up a term paper
Party!
Exam study homework
331 331 HW Project
Monday Tuesday Wednesday Thursday Friday Greedily solve your blues!
Arrange tasks in some order and iteratively pick
nonoverlapping tasks Write up a term paper
Party!
Exam study 331 HW
Project Monday Tuesday Wednesday Thursday Friday Ordering is crucial
Order by starting time Write up a term paper
Party!
Exam study Algo =1
331 HW Project
Monday Tuesday Wednesday Thursday Friday Another attempt
Order by duration Ordering by least
conflicts doesn’t
work Algo =1 Monday Tuesday Wednesday Thursday Friday The final algorithm
Order tasks by their END time Write up a term paper
Party!
Exam study 331 HW
Project Monday Tuesday Wednesday Thursday Friday Questions? Today’s agenda Prove the correctness of the algorithm Formal Algorithm
R: set of requests Set A to be the empty set
While R is not empty
Choose i in R with the earliest finish time
Add i to A
Remove all requests that conflict with i from R
Return A ...
View
Full
Document
This note was uploaded on 12/11/2011 for the course CSE 331 taught by Professor Rudra during the Fall '11 term at SUNY Buffalo.
 Fall '11
 RUDRA

Click to edit the document details