Question: Creating multiple processes can be time consuming and computationally expensive ting the traditional fork system call. Briefly discuss some other better approaches to this Is

 Creating multiple processes can be time consuming and computationally expensive ting
the traditional fork" system call. Briefly discuss some other better approaches to

Creating multiple processes can be time consuming and computationally expensive ting the traditional fork" system call. Briefly discuss some other better approaches to this Is marks . Compare and contrast any two ways in which Os can be structured. Be sure to point out how one addresses the flaws in others 15 marks c. There are five processes A co to run. Their arrival times are 0, 1, 3, 12 seconds respectively. Their CPU but are 3.5. 2.5 and 5 seconds, respectively. What is the average turnaround time using First come first served, Shortest-job-first and round robin (with 1 second quantum) [6 mural What quantum time will you support in a round-robin) for a better performance Chigh response time, low waiting me etc.) 12 marlo d. Often time, Round Robin outperforms 'CFS algorithm. Can these two algorithms ever have the same tumaround time? When? c. Abdullah Grocery store has an application that generates the monthly sales report. The app generates a file named "items.txt" and have the following fields: ItemId, Item Name, ItemAmount, ItemPrice, Purchase Date in this order. Perform the following operation on the file. 1. List the top ten most expensive item and 10 least expensive items ii. Create a new file"extra.txt" that will contain only the Item Name, Item Price and Purchase Date [6 marks] QUESTION THREE 1. Creating multiple processes can be time consuming and computationally expensive ting the traditional fort system call. Briefly discuss some other better approaches to this I marks! 1. Compare and contrast any ewo ways in which OS can be structured. Be sure to point out how one address the flaws in others 15 marks ci. There are five processes to to run. Their arrival times are 0.1.3.9.12 seconde respectively. Their CPU burstare 3. 5. 2.5 and 5 seconds, respectively. What is the average turnaround time using First come first served. Shortest-posts-fint and round robin (with 1 second quantum) 16 marks 4. What quantum time will you suggest in a round-colin) for a better performance (high response time, low waiting time etc.) 12 marks! 1. Often times, Round Robin outperforms CS algorithm. Can these two algorithms ever have the same turnaround (2 marks c. Abdullah Grocery store has an application that generates the monthly sales report. The app generates a file namcu "items.txt", and have the following fields; ItemId, Item Name, ItemAmount, Item Price. Purchase Date in this order Perform the following operation on the file. i. List the top ten most expensive item and 10 least expensive items ii. Create a new file"extra.txt" that will contain only the Item Name, ItemI'rice and Purchase Date (6 marks] time? When? Creating multiple processes can be time consuming and computationally expensive ting the traditional fork" system call. Briefly discuss some other better approaches to this Is marks . Compare and contrast any two ways in which Os can be structured. Be sure to point out how one addresses the flaws in others 15 marks c. There are five processes A co to run. Their arrival times are 0, 1, 3, 12 seconds respectively. Their CPU but are 3.5. 2.5 and 5 seconds, respectively. What is the average turnaround time using First come first served, Shortest-job-first and round robin (with 1 second quantum) [6 mural What quantum time will you support in a round-robin) for a better performance Chigh response time, low waiting me etc.) 12 marlo d. Often time, Round Robin outperforms 'CFS algorithm. Can these two algorithms ever have the same tumaround time? When? c. Abdullah Grocery store has an application that generates the monthly sales report. The app generates a file named "items.txt" and have the following fields: ItemId, Item Name, ItemAmount, ItemPrice, Purchase Date in this order. Perform the following operation on the file. 1. List the top ten most expensive item and 10 least expensive items ii. Create a new file"extra.txt" that will contain only the Item Name, Item Price and Purchase Date [6 marks] QUESTION THREE 1. Creating multiple processes can be time consuming and computationally expensive ting the traditional fort system call. Briefly discuss some other better approaches to this I marks! 1. Compare and contrast any ewo ways in which OS can be structured. Be sure to point out how one address the flaws in others 15 marks ci. There are five processes to to run. Their arrival times are 0.1.3.9.12 seconde respectively. Their CPU burstare 3. 5. 2.5 and 5 seconds, respectively. What is the average turnaround time using First come first served. Shortest-posts-fint and round robin (with 1 second quantum) 16 marks 4. What quantum time will you suggest in a round-colin) for a better performance (high response time, low waiting time etc.) 12 marks! 1. Often times, Round Robin outperforms CS algorithm. Can these two algorithms ever have the same turnaround (2 marks c. Abdullah Grocery store has an application that generates the monthly sales report. The app generates a file namcu "items.txt", and have the following fields; ItemId, Item Name, ItemAmount, Item Price. Purchase Date in this order Perform the following operation on the file. i. List the top ten most expensive item and 10 least expensive items ii. Create a new file"extra.txt" that will contain only the Item Name, ItemI'rice and Purchase Date (6 marks] time? When

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!