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/02/28 14:15] – jxu | faq [2021/03/12 14:26] – jxu | ||
---|---|---|---|
Line 140: | Line 140: | ||
**Answer to Question 16**: Both methods are acceptable. | **Answer to Question 16**: Both methods are acceptable. | ||
+ | |||
+ | **Question 17**: : Am I coding the whole system, like a queue for a ready, running and terminated our am I coding the calculation of the CPU. And also for first come first serve I assume every state has an CPU_time, and an I/ | ||
+ | |||
+ | **Answer to Question 17**: In the EECS2011N W21 Assignment 2 specification, | ||
+ | “... | ||
+ | 5. Notes, Please note that the requirements specified in Section 1. Description of the Assignment above, are the minimum requirements that must be satisfied by your assignment. Obviously, there are many other possible details of the System for Deterministic Modeling CPU Scheduling Algorithms that have been left unspecified. It is your responsibility to make appropriate design, analysis, implementation, | ||
+ | ...” | ||
+ | |||
faq.txt · Last modified: 2021/04/26 22:20 by jxu