Solution-Design a greedy algorithm using pseudocode

Design a greedy algorithm using pseudocode

Assignment Help Business Management

Reference no: EM131195246

Part 1: Design a greedy algorithm using pseudocode that solves this optimization problem of transferring files to disk while minimizing unused storage. The inputs to this algorithm are the number of files n, corresponding sizes (in MBs) s1, ... sn, m the number of disks, and corresponding storages amounts t1, ..., tm. The algorithm should return an array map[i] which contains the disk index of which the ith media file should be stored.

Comment your pseudocode for increased readability.

Part 2: Discuss the optimality of your algorithm. Is it guaranteed to return an optimal result? What is the Big-O time complexity of this algorithm in terms of m and n? Justify your answer.

Part 3: If you were to solve this problem using a brute force or exhaustive search method, what would be the time complexity? Justify your response.

Reference no: EM131195246

Questions Cloud

How large a wozac plant the company should build : Determine how large a Wozac plant the company should build to maximize its expected profit over the next 10 years.

Estimate the maximum compaction attainable in the landfill : A landfill operation uses a tractor to compact the waste. The tractor weighs 8 tons and has two tracks, each 2 ft 10 ft. Estimate the maximum compaction attainable in the landfill.

Explain and analysis the routing process of three routers : Configure the backup route through the Serial 0/1/0 interface with 25 AD. Explain and analysis the routing process of three routers in the case of ping from PC-A to Outside Host.

How does the feds monetary policy affect economic conditions : How does the Fed's monetary policy affect economic conditions?- Trade-offs of Monetary Policy Describe the economic trade-off faced by the Fed in achieving its economic goals.

Design a greedy algorithm using pseudocode : Design a greedy algorithm using pseudocode that solves this optimization problem of transferring files to disk while minimizing unused storage. The inputs to this algorithm are the number of files n, corresponding sizes (in MBs) s1, ... sn, m the ..

Assumed to increase at annual compound rate : How much money would have to be placed in a sinking fund each year to replace machine B at the end of 25 years if the fund yields 10% annual compound interest and if the first cost of the machine is assumed to increase at a 6% annual compound rate?

How much sooner will the town need a new landfill : how much more will this cost the town. How much sooner will the town need a new landfill?

Discuss the origins of the therapy : Select one of the therapeutic interventions listed below. Discuss the origins of the therapy, the implications for use, and the benefits and limitations. Additionally, address any concerns about the therapy as viewed from one of the religious be..

Present worth of the annual disbursement is most nearly : The maintenance cost for an investment is $2000 per year for the first 10 years and $1000 per year thereafter. The investment has infinite life. With a 10% interest rate, the present worth of the annual disbursement is most nearly

User Account

All Pages

Design a greedy algorithm using pseudocode

Reference no: EM131195246

Reference no: EM131195246

Questions Cloud

Reviews

Write a Review

Business Management Questions & Answers

Explain corporate social responsibility efforts

Number of warehouses closer to the end customer

Semantic-lexical ambiguity

Describe the political and legal systems

Contribution of knowledge

Explain what are the benefits of globally standardized goods

Explain tenants in common and joint tenancy

Differentiate between value-adding service delivery

Problem regarding the self-development plan

The internet and modern business technology

Critique the trends and issues in union membership

Evaluate the pros and cons of process

Assured A++ Grade

Academics

Major Subjects

Majors

Get In Touch

TERMS & POLICIES

HELP & SUPPORT