Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

1. When solving the activity scheduling problem (unweighted interval scheduling)

ID: 3743965 • Letter: 1

Question

1. When solving the activity scheduling problem (unweighted interval scheduling), the intervals are processed in the following order.

a. Ascending order of start time.

b. Descending order of start time.

c. Ascending order of start time.

d. Descending order of start time.

2. Which of the following dymaic problems maximizes its function?

a. Optimal Matrix optimization

b. Parking permits

c. Shuttle-to-airport

d. Weight Interval scheduling

3. The fractional knapsacl problem may be solved optimally by a greedy method by taking a fraction of more than this number of items.

a. 0. b. 1. c. 2. d. 3

4. Which of the following is not true for the activity scheduling problem?

a. The activities may have different solutions.

b. The greedy solution is optimal.

c. There may be several optimal solutions.

d. The goal is to minimize the number of activities choosen.

5. The algorithm for the activity scheduling problem sorts the input by:

a. Ascending order of start time.

b. Ascending order of start time.

c. Descending order of finish time.

d. Descending order of start time.

6. Which of the following initially processes its input by sorting?

a. Bottom-up heap construction

b. Huffman coding

c. Optimal Matrix Multiplication

d. Unweighted interval scheduling

7. What is n, the number of elements, for the largest, for the largest table that can be processed. by Binary Search using no more than 6 probes?

a. 31. b. 63. c. 64. d. 127

8. What is n, the number of elements, for the largest, for the largest table that can be processed. by Binary Search using no more than 5 probes?

a. 31. b. 63. c. 64. d. 127

Explanation / Answer

Answer)

1) It works as ascending order of finish time which is descending order of start time so option can be any of B) or D)

2) D) Weight interval scheduling maximises its functions.

3) This should be between zero to 1 , so it can either be 0 or 1 hence option A) or B)

4) D) The goal is to minimize the number of activities choosen

5) D)Descending order of start time.

Please note as per chegg a minimum of 1 question or 4 subparts of the first question is to be attempted. If you wish to get all the answers please post the same in a separate question instead of down voting this answer. We gave you 5 answers to this questions.

Hit like if you find this answer helpful. :)

Hope this answer is useful. Thanks