faq
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revisionNext revisionBoth sides next revision | ||
faq [2021/03/17 14:19] – jxu | faq [2021/03/17 14:26] – 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? | **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**//, | + | **Answer to Question 20**: As a first step, you may try to write the code only for a //**very basic and simple Java program**//, |
- | | + | |
- | | + | |
- | | + | |
- | | + | |
Note that in this very basic and simple system: | Note that in this very basic and simple system: | ||
- | * - There is only one single process queue – the ready queue, which is a FCFS queue; | + | - There is only one single process queue – the ready queue, which is a FCFS queue; |
- Whenever a process arrives, it is entered at the end of the ready queue; | - Whenever a process arrives, it is entered at the end of the ready queue; | ||
- Whenever the CPU becomes available, the Nonpremptive FCFS CPU Scheduler always removes from the ready queue the process which is at the front of the ready queue, and allows that process to start executing on the CPU; | - Whenever the CPU becomes available, the Nonpremptive FCFS CPU Scheduler always removes from the ready queue the process which is at the front of the ready queue, and allows that process to start executing on the CPU; | ||
Line 191: | Line 191: | ||
Write the code so that the program allows the user to enter as input parameters the following: | Write the code so that the program allows the user to enter as input parameters the following: | ||
- | | + | |
- | | + | |
- | | + | |
Line 210: | Line 210: | ||
When adding each additional feature, write the code so that the program allows the user to enter as input parameters the following: | When adding each additional feature, write the code so that the program allows the user to enter as input parameters the following: | ||
- | | + | |
- | | + | |
- | | + | |
- | | + | |
When adding each additional feature, write code which computes the Average Waiting Times and Average Turnaround Times for | When adding each additional feature, write code which computes the Average Waiting Times and Average Turnaround Times for | ||
any set of user input parameters above. | any set of user input parameters above. |
faq.txt · Last modified: 2021/04/26 22:20 by jxu