How JustAnswer Works:

  • Ask an Expert
    Experts are full of valuable knowledge and are ready to help with any question. Credentials confirmed by a Fortune 500 verification firm.
  • Get a Professional Answer
    Via email, text message, or notification as you wait on our site.
    Ask follow up questions if you need to.
  • 100% Satisfaction Guarantee
    Rate the answer you receive.

Ask Scott Your Own Question

Scott
Scott, MIT Graduate
Category: Homework
Satisfied Customers: 3040
Experience:  MIT Graduate (Math, Programming, Science, and Music)
3546829
Type Your Homework Question Here...
Scott is online now
A new question is answered every 9 seconds

PRO: The multimedia/mobile company you work

Customer Question

FOR LOGIC PRO: The multimedia/mobile company you work for is currently attempting to transfer large media files from older disks to newer disks (on various servers). The task of simply copying over all of these files in any haphazard order is fairly straightforward;
however, you believe that you can improve upon a haphazard approach and hope to improve the efficiency of storage space on the new disks. You have a collection of m disks, but you believe that if you smartly organize the media files onto the disks, you may
not need to use all m disks. You plan to design a greedy algorithm to efficiently transfer media to storage devices. Note that this is an optimization problem. Optimization problems have a general structure and consist of some quantity to be maximized or minimized
under some list of constraints. In this problem, you have n files (f1, ..., fn) with corresponding sizes (in MBs) s1, ... sn. Your goal is to store these files onto m disks, d1, ..., dm, that have corresponding storages amounts t1, ..., tm. Note that one file
cannot be spread across multiple disks. In this problem, the goal is to minimize the amount of storage that is not used on each disk (that is used). This should also minimize the total number of number of disks being used. That is, you would like to fill up
each disk as much as possible while leaving a minimally small amount of unused storage. (In the perfect case, each disk would be perfectly filled, and there would be no unused storage.) If there are any disks left unused, you will be able to return them for
a refund. Assignment 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.
Submitted: 1 year ago.
Category: Homework
Expert:  LogicPro replied 1 year ago.
Hi,
Welcome
Thank you for asking me. Hope you are doing well.
Zip all files; upload the zipped file to http://wikisend.com or http://ge.tt and post download link here.
What is the deadline?
Customer: replied 1 year ago.
Monday Morning/
Expert:  LogicPro replied 1 year ago.
ok, I will check and reply you.
Expert:  LogicPro replied 1 year ago.
My apologies, I tried but lost. I am out of ideas and opting out for other Professionals to answer. Please wait. You will be notified by email as soon as any Professional joins you.
I greatly appreciate the request and would be happy to help you with your other questions though.
Thank you for your patience.
Customer: replied 1 year ago.
still no response from any :)