Rakesh Roy
BAN USER
Questions (3)
Reputation 0
- 0of 0 votes
AnswersDescribe an algorithm to solve the following problem. Given an undirected graph G =
- Rakesh Roy in India
(V, E) and a vertex v, compute for each vertex w in the graph G the number of shortest
paths from v to w. Can we do it in O(|V| + |E|) ?| Report Duplicate | Flag | PURGE
Analyst Algorithm - 0of 0 votes
AnswersAn cellphone company provides service on 7 different frequencies. They have fixed the locations of 100 towers for their new service. The company has to ensure that two towers broadcasting on the same frequency are at least 100 km apart, so that there is no interference of signals. Describe an algorithm which will answer “feasible” if it is feasible, otherwise output the minimum
- Rakesh Roy in India
number of frequencies needed to utilise all 100 towers.| Report Duplicate | Flag | PURGE
Analyst Algorithm
Page:
1
Page:
1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.