Part 1. [ Use Video-1 under Scheduling heading. ]

Question 1. Consider a queuing system with a single queue and two servers in series.

How many statements are true? (A) 0 (B) 1 (C) 2 (D) 3 (E) 4

Statement 1. Johnsons rule is a sequencing rule that generates a schedule to minimize the total processing time.

Statement 2. Johnsons rule concept is to schedule jobs with smaller times on first server late in the schedule.

Statement 3. A Gantt chart is a time plot of a schedule.

Statement 4. Queue time of the last job in a schedule is always zero.

Part 2. [ Use Video-2 under Scheduling heading. ]

Question 2. Consider a queuing system with a single queue and a single server.

How many statements are true? (A) 0 (B) 1 (C) 2 (D) 3 (E) 4

Statement 1. The MPT rule minimizes the total flow of a schedule.

Statement 2. The flow time of a job in a schedule equals the queue time minus the processing time.

Statement 3. The flow time of a schedule will always be less than the processing time of a schedule.

Statement 4. The flow time of a job in a schedule is the queue time of the preceding job.