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