Book edition 7th

Author(s) Kenneth H. Rosen

Pages 808 pages

ISBN 9780073383095

Answers without the blur.

Just sign up for free and you're in.

Short Answer

a) Devise a greedy algorithm that determines the fewest lecture halls needed to accommodate n talks given the starting and ending time for each talk.

It is proved that the greedy algorithm does not always determine the fewest lecture halls needed to accommodate n talks given the starting and ending time for each talk.

See the step by step solution

Step by Step Solution

TABLE OF CONTENTS :

TABLE OF CONTENTS

Step 1:

We know that an algorithm is a finite sequence of precise instructions for performing a computation or for solving a problem.

So, the one way to process is the order the talks by starting time. Then, we number the lecture halls and so on.

Now, we will see the greedy algorithm for scheduling talks:

Step 2:

$e_{1} \leq e_{2} \leq \dots \leq e_{n}$ Procedure schedule

$(s_{1} \leq s_{2} \leq \dots . s_{n} : start times of talks, (e_{1} \leq e_{2} \leq \dots \leq e_{n} : ending times of talks)$

Sorts talk by finish time and reorder so that

For j : = 1

For i := 1 to N ( N is the number of lecture halls)

If talk j is compatible with i then we assign talk j to lecture hall i .

Therefore, it is proved that the greedy algorithm does not always determine the fewest lecture halls needed to accommodate n talks given the starting and ending time for each talk.

Find Study Materials for

Create Study Materials

Select your language

Discrete Mathematics and its Applications

Answers without the blur.

Short Answer

a) Devise a greedy algorithm that determines the fewest lecture halls needed to accommodate n talks given the starting and ending time for each talk.

Step by Step Solution

Step 1:

Step 2:

Most popular questions for Math Textbooks

Want to see more solutions like these?

Recommended explanations on Math Textbooks

Select your language

Discrete Mathematics and its Applications

Answers without the blur.

Short Answer

a) Devise a greedy algorithm that determines the fewest lecture halls needed to accommodate n talks given the starting and ending time for each talk.

Step by Step Solution

Step 1:

Step 2:

Most popular questions for Math Textbooks

Want to see more solutions like these?

Recommended explanations on Math Textbooks

Decision Maths

Calculus

Probability and Statistics

Statistics

Mechanics Maths

Geometry

Pure Maths