checkout
view
Your Cart: item(s)
Computer Science, Data Structures and Algorithms
Year 3
Minimum amount of Base Stations
Let's consider a long, quiet country road with houses scattered very sparsely along it.
(Picture the road as a long line segment with an eastern endpoint and a western endpoint.)
Further lets suppose that despite the country setting, the residents of all these houses are
avid cell phone users. You want to place cell phone base stations at certain points along
the road, so that every house is within four miles of one of the base stations. Give an
efficient algorithm that achieves this goal using as few base stations as possible.
By OTA: Mike Mikailov, PhD
OTA Rating: 4.8/5
What's included:
- Plain text response
- Attachment(s):
- MinimumAmountBaseStations.pdf
Scheduling Activities - Your friend is working as a camp counselor at a camp. He needs to organize activities for the kids. One of his plans is the following marathon: each contestant must swim 20 laps of a pool, then bike 10 miles, and then run 3 miles. The plan is to send the contestants out in a staggered fashion via the following rule: the contestants must use the pool one at a time. In other ...
Median Finding Algorithm for Joint Databases - You are interested in analyzing some hard to obtain data from two
separate databases. Each database contains n numerical values - so
there are 2n values total- and you may assume that no two values are
the same. You'd like to determine the median of this set of 2n values,
which we will define here to be the nth smallest value.
However, the only w...
Significant inversions algorithm - You are given a sequence of n distinct numbers A1, ... , An. An inversion is a pair i < j such that Ai > Aj. Call a piar (i, j) a significant inversion if i < j and Ai > 2*Aj. Give an O(n*log(n)) algorithm to count the number of significant inversions in the input sequence.
Page generated in 0.0143 seconds