Question 1
The critical-path algorithm is
◦ an optimal and efficient algorithm.
◦ an optimal and inefficient algorithm.
◦ an approximate and efficient algorithm.
◦ an approximate and inefficient algorithm.
◦ none of these
Question 2
Which of the following always produces an optimal schedule to the general scheduling problem?
◦ The decreasing-time algorithm.
◦ The brute-force algorithm.
◦ The critical-path algorithm.
◦ The backflow algorithm.
◦ none of these