Exam 2 -Ch. 3& 4

Exam 1- Ch. 1, 2, 6 & 7

We shall consider the general method, employed by an adversary,  to prove that no algorithm can always decide a given problem X using less than M questions. For that purpose, the adversary maintains Q, and R_1 … R_M, such that : 1. X(Q) is true2. X(R_i) is false for all i \in 1 … M and such that after k questions from the algorithm:3. Q is consistent with all k answers from the adversary 4. for all i in 1 … M, except for at most k such, it holds that R_i is consistent with all k answers from the adversary.For each declaration from the algorithm, how should the adversary respond?

For the various knapsack problems, we have considered the greedy strategy G of first picking as much as allowed of the most precious item (the one with highest value/weight ratio), next picking as much as allowed of the second most precious item, etc, etc.  Match each version with the outcome guaranteed:

            Linda’s manager told her to use caution when unpacking supplies on Tuesday mornings. “Make sure to pay attention to certain products and chemicals that are incompatible,” he said. What should Linda make sure she does with these types of products?

A symbolic cloth covering placed on the casket representing both the righteousness of Christ bestowed at one’s baptism and the equality of all men before God is a

What is the bare labor cost for this task? (31 23 16.50 0300) Use the table below to answer question

The _______ bond ensures that if a contractor is awarded the bid within the time specified, the contractor will enter into the contract and provide all other specified bonds. 

Use the table below to answer question:What is the item description for task 31 23 16.50 0300 is: (give full description)    

Which of the following item is NOT included in RSMeans Building Construction Costs Book?