User Tools

Site Tools


faq

Differences

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

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision
Previous revision
Next revisionBoth sides next revision
faq [2021/02/25 15:46] jxufaq [2021/03/16 15:04] jxu
Line 109: Line 109:
 **Answer to Question 14**: You may perform a Google Search on the term "software", to learn about what the term "software" could mean. **Answer to Question 14**: You may perform a Google Search on the term "software", to learn about what the term "software" could mean.
  
 +**Question 15:**
 +If we use a text book to reference multiple materiel for our essay do we reference it once or multiple times including the pages?
  
 +
 +example 1:
 +
 + 
 +
 +[1] Poo, Danny C. C., Derek Beng Kee Kiong, and Swarnalatha. Ashok. Object-Oriented Programming and Java. 2nd ed. London: Springer, 2008.
 +
 + 
 +
 +example 2:
 +
 + 
 +
 +[1] Poo, Danny C. C., Derek Beng Kee Kiong, and Swarnalatha. Ashok. Object-Oriented Programming and Java. 2nd ed. London: Springer, 2008. Pages 111-115
 +
 + 
 +
 +[2] Poo, Danny C. C., Derek Beng Kee Kiong, and Swarnalatha. Ashok. Object-Oriented Programming and Java. 2nd ed. London: Springer, 2008. Pages 60-65
 +
 +**Answer to Question 15:**
 +Take a look at the References or Bibliography section of //**any**// article among the **hundreds of millions** of  scholarly literature in Google Scholar https://scholar.google.com/, and the answer to your question should quickly become very apparent.
 +
 +**Question 16**: How should we submit the academic honesty statement for Assignment 1? 
 +Should it be added in a page before the title page or would it be all right
 +to upload both our report PDF and academic honesty statement PDF as two
 +different files in the submission?
 +
 +**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/O_time  and once done they execute?
 +
 +**Answer to Question 17**: In the EECS2011N W21 Assignment 2 specification, it is stated that: 
 +“...
 +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, testing, and documentation choices concerning the unspecified details of the System for Deterministic Modeling of CPU Scheduling Algorithms, and justify those decisions in your report.
 +...”
 +
 +**Question 18**: I am not quite sure what we have to code in java, is it the 6 scheduling
 +algorithms from section 5.3? If yes then what should be the processes, arrival time and
 +their priority process? There is no data set available on the assignment 2 pdf.
 +
 +**Answer to Question 18**: You need to not only carefully read and study the 2011N W21 Assignment 2 specification on eClass, but also need to carefully read and study all of the following which are posted on eClass:
 +
 +(1) The copy of Sections 5.1, 5.2, 5.3, and 5.8.1, of Chapter 5 of Silberschatz, Galvin, and
 +Gagne’s book above can be found in the 2011N W21 eClass file
 +Operating_System_Concepts_CPU_Scheduling.pdf;
 +
 +(2) The example provided in the file “2011N_W21_Assignment_2_Example.pdf”
 +which is posted on 2011N W21 eClass.
 +
 +(3) The Wednesday March 3 Lecture 14 video recording which explains the 2011N W21 Assignment 2 Example posted on eClass.  
 +
 +**Question 19**: We are having extreme difficulties
 +implementing the preemptive algorithms. Implementing these algorithms to work in parallel with the IOScheduler FCFS
 +algorithm is a greater challenge than we have the tools to solve.
 +
 +**Answer to Question 19**: You need to carefully read and study all the material listed
 +in the Answer to Question 18 above. As shown in the Wednesday March 3 Lecture 14 video recording which explains the 2011N W21 Assignment 2 Example posted on eClass, the performance of each algorithm for any workload, that is, the Average Waiting Time, and the Average Turnaround Time can all be calculated with pen and paper step-by-step. 
 +
 +Note that, ANYTHING THAT CAN BE CALCULATED WITH PEN AND PAPER STEP-BY-STEP, CAN ALSO BE DONE BY a COMPUTER PROGRAM WRITTEN IN JAVA STEP-BY-STEP (in the same way that the Average Waiting Time, and the Average Turnaround Time was calculated with pen and paper step-by-step in the Wednesday March 3 Lecture 14). In other words,
 +there is no need to get anything "to work in parallel", and there is no need to use any 
 +parallel programming tools such as "threads".  
faq.txt · Last modified: 2021/04/26 22:20 by jxu