Quiz2 - the 2-bins at the time the first object is entered...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Algorithms CSE 5211 Fall 2008 Quiz 2 Points: Time: 30 min Q1. Write the multi-processor greedy scheduling algorithm Q2. Prove that First fit online bin packing algorithm will not take more than 2M bins, where M is the optimum bins Q3. For First fit offline bin-packing prove that first M bins will have first all 1-bins and
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: the 2-bins, at the time the first object is entered at the M+1-th bin, where that object is >1/3 that ensures there will be no x-bin with x>3 within the previous set of bins....
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online