lec3 - MIT OpenCourseWare http://ocw.mit.edu 6.006...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: MIT OpenCourseWare http://ocw.mit.edu 6.006 Introduction to Algorithms Spring 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms . Lecture 3 Ver 2.0 Scheduling and Binary Search Trees 6.006 Spring 2008 Lecture 3: Scheduling and Binary Search Trees Lecture Overview • Runway reservation system – Definition – How to solve with lists • Binary Search Trees – Operations Readings CLRS Chapter 10, 12. 1-3 Runway Reservation System Airport with single (very busy) runway (Boston 6 1) • → • “Reservations” for future landings • When plane lands, it is removed from set of pending events • Reserve req specify “requested landing time” t • Add t to the set of no other landings are scheduled within < 3 minutes either way. – else error, don’t schedule Example 37 41 46 49 56 time (mins) now x x x x Figure 1: Runway Reservation System Example Let R denote the reserved landing times: R = (41 , 46 , 49 , 56) Request for time:...
View Full Document

This note was uploaded on 09/24/2010 for the course CS 6.006 taught by Professor Erikdemaine during the Spring '08 term at MIT.

Page1 / 6

lec3 - MIT OpenCourseWare http://ocw.mit.edu 6.006...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online