Differences

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

--- faq [2021/03/17 14:17] – jxu
+++ faq [2021/03/17 14:23] – jxu
@@ Line 178: / Line 178: @@
 **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 //**only executes once on the CPU**// before terminating;
-  - 	Each process //**never does any I/O**// on any I/O device;
+  * 	Each process //**never does any I/O**// on any I/O device;
-  - 	All processes have the //**same single CPU Computation Time**//;
+  * 	All processes have the //**same single CPU Computation Time**//;
-  - 	Only the simplest //**C1. Nonpreemptive First-Come, First-Served (FCFS) CPU Scheduling**// Algorithm is used.
+  * 	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 194: / 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.