Differences

This shows you the differences between two versions of the page.

--- faq [2021/03/17 14:15] – jxu
+++ faq [2021/03/17 14:23] – jxu
@@ Line 176: / Line 176: @@
 **Question 20**: Because my group started working on Assignment 2 rather late, now it looks almost certain that we won’t be able to finish designing, and implementing any working Java program that is able to compute the average waiting times and average turnaround times for any given workload using all of the six scheduling algorithms as specified in Assignment 2. Yet we don’t want to completely give up on Assignment 2. Can you give us some advice on what we might consider doing for the programming part of Assignment 2 to at least get something done for the programming part, taking into consideration that we only have a few days left before the deadline to work on the assignment?
 **Answer to Question 20**: : As a first step, you may try to write the code only for a //**very basic and simple Java program**//, which only needs to handle the following:
-  - 	Each process //**only executes once on the CPU**// before terminating;
-  - 	Each process //**never does any I/O**// on any I/O device;
-  - 	All processes have the //**same single CPU Computation Time**//;
-  - 	Only the simplest //**C1. Nonpreemptive First-Come, First-Served (FCFS) CPU Scheduling**// Algorithm is used.
+  * 	Each process //**only executes once on the CPU**// before terminating;
+  * 	Each process //**never does any I/O**// on any I/O device;
+  * 	All processes have the //**same single CPU Computation Time**//;
+  * 	Only the simplest //**C1. Nonpreemptive First-Come, First-Served (FCFS) CPU Scheduling**// Algorithm is used.
 Note that in this very basic and simple system:
@@ Line 196: / Line 194: @@
   - the Arrival Time of each process;
   - the CPU Computation Time for each process;
 Then try to write code which computes the Average Waiting Times and Average Turnaround Times for any set of user input parameters above.