Design an efficient algorithm to find post-office location

Assignment Help Computer Engineering

Reference no: EM131984849

Problem

Let x₁ < x₂ < ... < x_n be real numbers representing coordinates of n villages located along a straight road. A post office needs to be built in one of these villages.

a. Design an efficient algorithm to find the post-office location minimizing the average distance between the villages and the post office.

b. Design an efficient algorithm to find the post-office location minimizing the maximum distance from a village to the post office.

Reference no: EM131984849

Questions Cloud

Exploring difference between application and system software : Lets begin class by exploring the differences between application software and system software. A Windows XP VM (Virtual Machine) running on Windows 7 machine.

What are the different page replacement algorithms : ITSA2003 - NETWORK OPERATING SYSTEM & CONFIGURATION - Expand the description to show the use of MAR and MBR

What data structure is used to represent the tree t : Can you do it in O(|V|) time? Please note any assumptions you make about what data structure is used to represent the tree T and the graph G.

What is the engineers duty to her employer : What is the engineer's duty to her employer? What is the engineer's duty to the environment and the public? Which duty is paramount?

Design an efficient algorithm to find post-office location : Design an efficient algorithm to find the post-office location minimizing the average distance between the villages and the post office.

Partner relationship to avoid bankruptcy : Also, I will address what led to there bankruptcy and how they could have created a partner relationship to avoid bankruptcy.

Prove that the distance of c is at least three : Let A be a matrix, and let C be the code consisting of all solution to Ax = 0. If A has neither a column of zeros. Prove that the distance of C is at least 3.

Draw binary search tree obtained by inserting elements of s : Draw the Binary Search Tree obtained by inserting the elements of S in the order they appear in S.

What is the minimum number of states of a dfa : Let Ln be a collection of words over {0, 1} that begin with precisely n zeros. What is the minimum number of states of a DFA that recognizes Ln?

User Account

All Pages