CS代考 CS570 – cscodehelp代写
CS570
Analysis of Algorithms Spring 2015
Exam III
Name: _____________________ Student ID: _________________
Email Address:_______________
_____Check if DEN Student
Maximum Problem 1 20
Problem 2 16 Problem 3 16 Problem 4 16 Problem 5 16 Problem 6 16 Total 100
Received
Instructions:
1. This is a 2-hr exam. Closed book and notes
2. If a description to an algorithm or a proof is required please limit your description or
proof to within 150 words, preferably not exceeding the space allotted for that
question.
3. No space other than the pages in the exam booklet will be scanned for grading.
4. If you require an additional page for a question, you can use the extra page provided
within this booklet. However please indicate clearly that you are continuing the solution on the additional page.
µÚ 1 Ò³£¬¹² 8 Ò³
1) 20 pts
Mark the following statements as TRUE or FALSE. No need to provide any justification.
[ TRUE/FALSE ]
If SAT ¡ÜP A, then A is NP-hard.
[ TRUE/FALSE ]
If a problem X can be reduced to a known NP-hard problem, then X must be NP- hard.
[ TRUE/FALSE ]
If P equals NP, then NP equals NP-complete.
[ TRUE/FALSE ]
Let X be a decision problem. If we prove that X is in the class NP and give a poly- time reduction from X to Hamiltonian Cycle, we can conclude that X is NP-complete.
[ TRUE/FALSE ]
The recurrence , has solution
[ TRUE/FALSE ]
On a connected, directed graph with only positive edge weights, Bellman-Ford runs asymptotically as fast as Dijkstra.
[ TRUE/FALSE ]
Linear programming is at least as hard as the problem in a flow network.
[ TRUE/FALSE ]
If you are given a maximum s-t flow in a graph then you can find a minimum s-t cut in time O(m) where m is the number of the edges in the graph.
[ TRUE/FALSE ]
Fibonacci heaps can be used to make Dijkstra¡¯s algorithm run in O( |E| + |V| log|V| ) time on a graph G=(V,E)
[ TRUE/FALSE ]
A graph with non-unique edge weights will have at least two minimum spanning trees
µÚ 2 Ò³£¬¹² 8 Ò³
2) 16pts
Given a graph G=(V, E) with an even number of vertices as the input, the HALF-IS problem is to decide if G has an independent set of size |V|/2. Prove that HALF-IS is in NP-Complete.
µÚ 3 Ò³£¬¹² 8 Ò³
3) 16pts
A variant on the decision version of the subset sum problem is as follows: Given a set of n integer numbers A = {a1, a2, …, an} and a target number t. Determine if there is a subset of numbers in A whose product is precisely t. That is, the output is yes or no. Describe an algorithm (and provide pseudo-code) to solve this problem, and analyze its complexity.
µÚ 4 Ò³£¬¹² 8 Ò³
4) 16pts
We’ve been put in charge of a phone hotline. We need to make sure that it’s staffed by at least one volunteer at all times. Suppose we need to design a schedule that makes sure the hotline is staffed in the time interval [ ]. Each volunteer gives us an interval during which he or she is willing to work. We’d like to design an algorithm which determines the minimum number of volunteers needed to keep the hotline running. Design an efficient greedy algorithm for this problem that runs in time if there are student volunteers. Prove that your algorithm is correct.
You may assume that any time instance has at least one student who is willing to work for that time.
µÚ 5 Ò³£¬¹² 8 Ò³
5) 16pts
A software house has to handle 3 projects, P1, P2, P3, over the next 4 months. P1 can only begin after month 1, and must be completed within month 3. P2 and P3 can begin at month 1, and must be completed, respectively, within month 4 and 2. The projects require, respectively, 8, 10, and 12 man-months. For each month, 8 engineers are available. Due to the internal structure of the company, at most 6 engineers can be working, at the same time, on the same project. Determine whether it is possible to complete the projects within the time constraints. Describe how to reduce this problem to the problem of finding a maximum flow in a flow network and justify your reduction.
µÚ 6 Ò³£¬¹² 8 Ò³
6) 16pts
There are n people and n jobs. You are given a cost matrix, C, where C[i][j] represents the cost of assigning person i to do job j. You want to assign all the jobs to people and also only one job to a person. You also need to minimize the total cost of your assignment. Can this problem be formulated as a linear program? If yes, give the linear programming formulation. If no, describe why it cannot be formulated as an LP
and show how it can be reduced to an integer program.
µÚ 7 Ò³£¬¹² 8 Ò³
Additional Space
µÚ 8 Ò³£¬¹² 8 Ò³
