Task Scheduling and Completion Analysis

The video tutorial explains how to use the decreasing time algorithm to create a priority list for scheduling tasks in a project with two processors. It details the process of listing tasks by completion time, assigning tasks to processors, and tracking task progress. The tutorial concludes with a Q&A session addressing specific task assignments and the overall project completion time.

What is the primary goal of the decreasing time algorithm?

• To create a priority list based on task completion times

• To minimize the number of tasks

• To increase the number of processors

• To reduce the overall project cost

When two tasks have the same completion time, how is their priority determined?

• By the larger task number

• By the smaller task number

• By the order they appear in the list

• By the alphabetical order of task names

Which task is assigned to processor 1 first?

• Task 4

• Task 1

• Task 2

• Task 3

At what time does Task 3 become complete?

• 12 hours

• 15 hours

• 8 hours

• 19 hours

Which task becomes ready after Task 1 is completed?

• Task 8

• Task 6

• Task 5

• Task 7

What is the next task assigned to processor 2 after Task 2 is completed?

• Task 4

• Task 7

• Task 6

• Task 5

Which task is completed at 23 hours?

• Task 5

• Task 7

• Task 8

• Task 6

What is the total completion time of the project?

• 38 hours

• 37 hours

• 35 hours

• 36 hours

How much idle time does processor 2 have?

• 2 hours

• 1 hour

• 3 hours

• No idle time

Which task is the last to be completed in the project?

• Task 7

• Task 6

• Task 8

• Task 9