How long will the tournament be in this case

Assignment Help Basic Computer Science

Reference no: EM131245182

Single-elimination tournaments are notorious for their scheduling difficulties. Imagine that you are organizing a tournament for n basketball teams (you may assume that n = 2ⁱ for some integer i). We will further simplify things by assuming that each game takes less than an hour, and that each team can be scheduled for a game every hour if necessary. (Note that everything said here about basketball courts is also true about processors in a parallel algorithm to solve the maximum-finding problem).

(a) How many basketball courts do we need to insure that every team can play whenever we want to minimize the total tournament time?

(b) How long will the tournament be in this case?

(c) What is the total number of "court-hours" available? How many total hours are courts being used? How many total court-hours are unused?

(d) Modify the algorithm in such a way as to reduce the total number of courts needed, by perhaps not letting every team play whenever possible. This will increase the total hours of the tournament, but try to keep the increase as low as possible. For your new algorithm, how long is the tournament, how many courts are needed, how many total court-hours are available, how many court-hours are used, and how many unused?

Reference no: EM131245182

Questions Cloud

Monte carlo simulation model : Lucinda Rameriz has a nice business on the side, selling special events T-shirts for concerts, sporting events, and other occasions. - Justify answer based on your analysis.

Discuss some of the critical urban economic issues : Discuss some of the critical urban economic issues of today. Discuss some of the economic rationales behind business location and the system of cities in New York, their benefits and pitfalls.

Which parts of the definition apply and which do not : Consider the so-called "algorithm for algorithms" in Section 15.1. Is this really an algorithm? Review the definition of an algorithm from Section 1.4. Which parts of the definition apply, and which do not? Is the "algorithm for algorithms" a heur..

What compounded annual increase in the cost : In 1885, first class postage for a one-ounce letter cost $0.02. The same postage in 2015 costs $0.49. What compounded annual increase in the cost of first class postage has been experienced over this period of time?

How long will the tournament be in this case : What is the total number of "court-hours" available? How many total hours are courts being used? How many total court-hours are unused?

Review at least two different occupation descriptions : Examine two ways that companies can recruit qualified job applicants. Determine which method may be most effective and predict how it could benefit the company when hiring new employees.

What is the component cost of these bonds with warrants : What is the value of each warrant attached to the bond issue? - What is the component cost of these bonds with warrants? - What premium is associated with the warrants?

Define and explain foreign direct investment : Define and explain Foreign Direct Investment. What is the difference between a closed and open Economy? How would they obtain the financing for investment?

Finding the median must use at least n - 1 comparisons : Show that any comparison-based algorithm for finding the second-smallest of n values can be extended to find the smallest value also, without requiring any more comparisons to be performed.

User Account

All Pages