Reference no: EM132141257
Suppose you are a manager in the IT department for the government of a corrupt dictator, who has a collection of computers that need to be connected together to create a communication network for his spies.
You are given a weighted graph, G, such that each vertex in G is one of these computers and each edge in G is a pair of computers that could be connected with a communication line.
It is your job to decide how to connect the computers. Suppose now that the CIA has approached you and is willing to pay you various amounts of money for you to choose some of these edges to belong to this network (presumably so that they can spy on the dictator).
Thus, for you, the weight of each edge in G is the amount of money, in U.S. dollars, that the CIA will pay you for using that edge in the communication network. Implement an efficient algorithm, therefore, for finding a maximum spanning tree in G, which would maximize the money you can get from the CIA for connecting the dictator's computers in a spanning tree.
What is the running time of your algorithm? Your program will take as input a file with edge information.
Each line in the file contains from, to and weight. You may assume the vertices arc numbered from 0 to N. The weights are unique and non-negative.
It will construct the Graph and print the edges in the maximum spanning tree. Write java program that reads in from text file and creates maximum spanning tree graph.
|
What is the mirr
: A) If the firm's WACC is 12.1%, and the project costs $850,000, what is the NPV? B) What is the MIRR?
|
|
Implement an efficient algorithm
: Your program will take as input a file with edge information. Each line in the file contains from, to and weight. You may assume the vertices are numbered .
|
|
Compare the time for a query and response
: Compare the time for a query and response for a complete DNS query and response (to all required nameservers) if M=1, M=2, and M=3.
|
|
How many 2 gb hard disks do you need if the hard disk
: How many 2 GB hard disks do you need if the hard disk should store up to 70% of their capacity using RAID 0, RAID 1, RAID 3, or RAID 5.
|
|
What is the running time of your algorithm
: What is the running time of your algorithm? Your program will take as input a file with edge information.
|
|
Write a program in c that shows the coach
: Write a program in C that shows the coach, the total number of different pairs he can choose in the team.
|
|
How will you choose so that the modified algorithm
: How will you choose so that the modified algorithm will have O(n log n) running time? Show your work.
|
|
How can we quickly test if k is even
: We say that k is even if and only if |k| mod 2 = 0. How can we quickly test if k is even without using arithmetic operations, and without using mod?
|
|
Describe the ways in which this is an example of attacks
: Suppose you are doing some online banking using your bank's website. An attacker has set up an active wiretap between your computer and your bank's server.
|