Using the process state diagram, explain why there is no transition:
• From the READY to WAITING.
• From the WAITING to RUNNING.
Instructions:
• Your answers should reach in not less than 300 words.
• Post your answers to your electronic journal.
• Date of submission: May 22, 2011 12:00 midnight
• Once I found out that you have a duplicated answer from a classmate, automatic 50 grade.
Load the following jobs into memory using fixed partition following a certain memory allocation method (a. best-fit, b. first-fit, c. worst-fit).
| Memory Block | Size |
| Block 1 | 50K |
| Block 2 | 200K |
| Block 3 | 70K |
| Block 4 | 115K |
| Block 5 | 15K |
a. Job1 (100k) f. Job6 (6k)
turnaround: 3 turnaround: 1
b. Job2 (10k) g. Job7 (25k)
turnaround: 1 turnaround: 1
c. Job3 (35k) h. Job8 (55k)
turnaround: 2 turnaround: 2
d. Job4 (15k) i. Job9 (88k)
turnaround: 1 turnaround: 3
e. Job5 (23k) j. Job10 (100k)
turnaround: 2 turnaround: 3
*turnaround – how long it will stay in the memory.
Instructions:Computer Architecture Case Study 2 In a multiprogramming and time-sharing environment, several users share the system simultaneously. This situation can result in various security problems. Name at least two of these problems. Can we ensure the same degree of security in a time-share machine as we have in a dedicated machine? Explain your answer Instructions: · Your answers should reach in not less than 500 words. · Post your answers to your electronic journal. · Date of submission: Today (May 8, 2011) · Once I found out that you have a duplicated answer from a classmate, automatic 50 grade.
Computer Architecture Case Study 1
Explain why we need to study Computer Architecture? What is its significance with your field as an IT or CS student? Differentiate Computer Architecture and Computer Organization?
Instructions:
