Question: QUESTION THREE Creating multiple processes can be time consuming and computationally expensive using the traditional forl system call. Briefly discuss some other better approaches to

 QUESTION THREE Creating multiple processes can be time consuming and computationally
expensive using the traditional forl" system call. Briefly discuss some other better

QUESTION THREE Creating multiple processes can be time consuming and computationally expensive using the traditional forl" system call. Briefly discuss some other better approaches to this (4 markal b. Compare and contrast any two ways in which OS can be structure. Be sure to point out how one addrentes the flaws in ochen 15 mars ci. There are five process to Et non. Their arrival times are 0.1, 3.9.12 secondi respectively. Their CPU bertan 3.5 2.5 and 5 seconde, respectively. What is the average turnaround time using Pin-comel serw. Shortest.job-fint and round-colin (with 1 second quantum). What quantum time will you suggest in a round-tobin) for a better performance (highresponse time, low waiting time d. Oftentimes, Round Robin outperforms FCFS algorithm. Can these two algorithms over have the same turnaround time! When? [2 marks] e. Abdullahi Grocery store has an application that generates the monthly sales report. The app generates a file named mtu and have the following fields, Itemid. Item Name, ItemAmount Trem Price, Purchase Dars in this order. QUESTION THREE 2. Creating multiple processes can be time consuming and computationally expensive using the traditional "fork" system call. Brietly discuss some other better approaches to this. (4 marks b. Compare and contrast any cwo ways in which OS can be structured. Be sure to point out how one addresses the laws in others. 15 marks ci. There are five processes A to Eto run. Their arrival times are 0, 1, 3, 9, 12 seconds respectively. Their CPU Turst are 3, 5, 25 and 5 seconds, respectively. What is the average turnaround time using First-come-first served, Shortest-jobs-first and round-robin (with 1 second quantum). 16 marks) it. What quantum time will you suggest in a (round-robin) for a better performance (high response time, low walung eine etc.), (2 marks! d. Often cimes, Round Robin outperforms FCFS algorithm. Can these two algorithms ever have the same turnaround time? When? [2 marks c. Abdullahi Grocery store has an application that generates the monthly sales report. The app generates a file named "items txt", and have the following fields: Itemld. Item Name, ItemAmount, ItemPrice, l'urchase Date in this order. QUESTION THREE Creating multiple processes can be time consuming and computationally expensive using the traditional forl" system call. Briefly discuss some other better approaches to this (4 markal b. Compare and contrast any two ways in which OS can be structure. Be sure to point out how one addrentes the flaws in ochen 15 mars ci. There are five process to Et non. Their arrival times are 0.1, 3.9.12 secondi respectively. Their CPU bertan 3.5 2.5 and 5 seconde, respectively. What is the average turnaround time using Pin-comel serw. Shortest.job-fint and round-colin (with 1 second quantum). What quantum time will you suggest in a round-tobin) for a better performance (highresponse time, low waiting time d. Oftentimes, Round Robin outperforms FCFS algorithm. Can these two algorithms over have the same turnaround time! When? [2 marks] e. Abdullahi Grocery store has an application that generates the monthly sales report. The app generates a file named mtu and have the following fields, Itemid. Item Name, ItemAmount Trem Price, Purchase Dars in this order. QUESTION THREE 2. Creating multiple processes can be time consuming and computationally expensive using the traditional "fork" system call. Brietly discuss some other better approaches to this. (4 marks b. Compare and contrast any cwo ways in which OS can be structured. Be sure to point out how one addresses the laws in others. 15 marks ci. There are five processes A to Eto run. Their arrival times are 0, 1, 3, 9, 12 seconds respectively. Their CPU Turst are 3, 5, 25 and 5 seconds, respectively. What is the average turnaround time using First-come-first served, Shortest-jobs-first and round-robin (with 1 second quantum). 16 marks) it. What quantum time will you suggest in a (round-robin) for a better performance (high response time, low walung eine etc.), (2 marks! d. Often cimes, Round Robin outperforms FCFS algorithm. Can these two algorithms ever have the same turnaround time? When? [2 marks c. Abdullahi Grocery store has an application that generates the monthly sales report. The app generates a file named "items txt", and have the following fields: Itemld. Item Name, ItemAmount, ItemPrice, l'urchase Date in this order

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!