ComputerScienceExpert

(11)

$18/per page/

About ComputerScienceExpert

Levels Tought:
Elementary,Middle School,High School,College,University,PHD

Expertise:
Applied Sciences,Calculus See all
Applied Sciences,Calculus,Chemistry,Computer Science,Environmental science,Information Systems,Science Hide all
Teaching Since: Apr 2017
Last Sign in: 103 Weeks Ago, 3 Days Ago
Questions Answered: 4870
Tutorials Posted: 4863

Education

  • MBA IT, Mater in Science and Technology
    Devry
    Jul-1996 - Jul-2000

Experience

  • Professor
    Devry University
    Mar-2010 - Oct-2016

Category > Programming Posted 27 Apr 2017 My Price 8.00

The server runs uninterrupted

The question is attached as a screenshot in the file 

 

 

. [20 pts) You have a server that can be attached to two electrical outlets simultaneously.
The server runs uninterrupted as long as it is attached to at least one electrical outlet. The
server is located on a rolling cart that can be moved freely within the rectangular room (the
room has no obstacles). Looking at the room Erom above and seeing its plan, you know
the coordinates of n electrical outlets given by (magi). Currently the server is attached
via a single power cable of length I? to the electrical outlet 3. You would like to move the
server without any interruptions to electrical outlet t. For that purpose you can purchase an
additional power cable of length L and move the server from one electrical outlet to another
until it reaches t. You would like to find out what is the minimum length L of additional
power cable that you need to purchase to accomplish this task. Design an 0(113 log n)-time
algorithm to compute the minimum value of L. Note this problem is assumed to be entirely
2-dimensional — length in this problem refers to the regular Euclidean 2D distance. Input: {(3.}, yg) }?=1 — positions of electrical outlets; E — length of the given power cable;
5, t E [n] — starting and terminal electrical outlets
Output: minimum value of L such that we can move the server from s to t uninterrupted. (a) Briefly describe your algorithm in plain English.
(b) Describe your algorithm in pseudocode. (c) Provide a concise argument of correctness of your algorithm. You may use results
proven in class/textbook, but make sure to cite them accurately. (d) Justify that the runtime is O(n9 log n).

Attachments:

Answers

(11)
Status NEW Posted 27 Apr 2017 07:04 AM My Price 8.00

-----------

Attachments

file 1493277576-Solutions file 2.docx preview (51 words )
H-----------ell-----------o S-----------ir/-----------Mad-----------am ----------- Th-----------ank----------- yo-----------u f-----------or -----------you-----------r i-----------nte-----------res-----------t a-----------nd -----------buy-----------ing----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n. -----------Ple-----------ase----------- pi-----------ng -----------me -----------on -----------cha-----------t I----------- am----------- on-----------lin-----------e o-----------r i-----------nbo-----------x m-----------e a----------- me-----------ssa-----------ge -----------I w-----------ill----------- be----------- qu-----------ick-----------ly -----------onl-----------ine----------- an-----------d g-----------ive----------- yo-----------u e-----------xac-----------t f-----------ile----------- an-----------d t-----------he -----------sam-----------e f-----------ile----------- is----------- al-----------so -----------sen-----------t t-----------o y-----------our----------- em-----------ail----------- th-----------at -----------is -----------reg-----------ist-----------ere-----------d o-----------n -----------THI-----------S W-----------EBS-----------ITE-----------. ----------- Th-----------ank----------- yo-----------u -----------
Not Rated(0)