{"id":19358,"date":"2023-05-10T16:15:15","date_gmt":"2023-05-10T16:15:15","guid":{"rendered":"https:\/\/www.goodacademic.com\/blog\/questions\/write-a-program-that-demonstrates-various-operating-systems-algorithms-use-any-programming-language-which-is-convenient-for-you-your-program-should-have-a-menu-driven-concept-such-as\/"},"modified":"2023-05-10T16:15:15","modified_gmt":"2023-05-10T16:15:15","slug":"write-a-program-that-demonstrates-various-operating-systems-algorithms-use-any-programming-language-which-is-convenient-for-you-your-program-should-have-a-menu-driven-concept-such-as","status":"publish","type":"questions","link":"https:\/\/www.goodacademic.com\/blog\/questions\/write-a-program-that-demonstrates-various-operating-systems-algorithms-use-any-programming-language-which-is-convenient-for-you-your-program-should-have-a-menu-driven-concept-such-as\/","title":{"rendered":"Write a program that demonstrates various operating systems algorithms. Use any programming language which is convenient for you. Your program should have a menu driven concept such as:"},"content":{"rendered":"<p style=\"cursor: auto; color: inherit;\"><span style=\"font-size: 12pt; line-height: 115%; cursor: auto; color: inherit;\">Write a program that demonstrates various<br \/>\noperating systems algorithms. Use JAVA. Your program should have a menu driven concept such as: <\/span><\/p>\n<p style=\"margin-bottom: 8pt; line-height: 107%; cursor: auto; color: inherit;\"><span style=\"font-size: 12pt; line-height: 107%; cursor: auto; color: inherit;\">Your<br \/>\nmission (should you choose to accept it) is to design and implement five<br \/>\ndifferent algorithms. These include:<\/span><\/p>\n<p style=\"margin-bottom: 8pt; line-height: 107%; cursor: auto; color: inherit;\"><span style=\"font-size: 12pt; line-height: 107%; cursor: auto; color: inherit;\"><span style=\"cursor: auto; color: inherit;\">1.<span style=\"font-size: 7pt; line-height: normal; cursor: auto; color: inherit;\">&nbsp;&nbsp;&nbsp;&nbsp; <\/span><\/span><\/span><span style=\"cursor: auto; color: inherit;\"><\/span><span style=\"font-size: 12pt; line-height: 107%; cursor: auto; color: inherit;\">First Come First Serve (FCFS) Scheduling<br \/>\nalgorithm<\/span><\/p>\n<p style=\"margin-bottom: 8pt; line-height: 107%; cursor: auto; color: inherit;\"><span style=\"font-size: 12pt; line-height: 107%; cursor: auto; color: inherit;\"><span style=\"cursor: auto; color: inherit;\">2.<span style=\"font-size: 7pt; line-height: normal; cursor: auto; color: inherit;\">&nbsp;&nbsp;&nbsp;&nbsp; <\/span><\/span><\/span><span style=\"cursor: auto; color: inherit;\"><\/span><span style=\"font-size: 12pt; line-height: 107%; cursor: auto; color: inherit;\">Shortest Job First Scheduling (SJF)<br \/>\nalgorithm<\/span><\/p>\n<p style=\"margin-bottom: 8pt; line-height: 107%; cursor: auto; color: inherit;\"><span style=\"font-size: 12pt; line-height: 107%; cursor: auto; color: inherit;\"><span style=\"cursor: auto; color: inherit;\">3.<span style=\"font-size: 7pt; line-height: normal; cursor: auto; color: inherit;\">&nbsp;&nbsp;&nbsp;&nbsp; <\/span><\/span><\/span><span style=\"cursor: auto; color: inherit;\"><\/span><span style=\"font-size: 12pt; line-height: 107%; cursor: auto; color: inherit;\">Round Robin Scheduling algorithm<\/span><\/p>\n<p style=\"margin-bottom: 8pt; line-height: 107%; cursor: auto; color: inherit;\"><span style=\"font-size: 12pt; line-height: 107%; cursor: auto; color: inherit;\"><span style=\"cursor: auto; color: inherit;\">4.<span style=\"font-size: 7pt; line-height: normal; cursor: auto; color: inherit;\">&nbsp;&nbsp;&nbsp;&nbsp; <\/span><\/span><\/span><span style=\"cursor: auto; color: inherit;\"><\/span><span style=\"font-size: 12pt; line-height: 107%; cursor: auto; color: inherit;\">Banker algorithm in Dead Lock <\/span><\/p>\n<p style=\"margin-bottom: 8pt; line-height: 107%; cursor: auto; color: inherit;\"><span style=\"font-size: 12pt; line-height: 107%; cursor: auto; color: inherit;\"><span style=\"cursor: auto; color: inherit;\">5.<span style=\"font-size: 7pt; line-height: normal; cursor: auto; color: inherit;\">&nbsp;&nbsp;&nbsp;&nbsp; <\/span><\/span><\/span><span style=\"cursor: auto; color: inherit;\"><\/span><span style=\"font-size: 12pt; line-height: 107%; cursor: auto; color: inherit;\">Page Replacement <\/span><\/p>\n<p style=\"cursor: auto; color: inherit;\"><span style=\"font-size: 12pt; line-height: 115%; cursor: auto; color: inherit;\">In 1 to 3, find the waiting time for each<br \/>\nprocess, turnaround time for each process, the average waiting time, the<br \/>\naverage turnaround time. Also Draw the Gannt Chart. <\/span><\/p>\n<p style=\"cursor: auto; color: inherit;\"><span style=\"font-size: 12pt; line-height: 115%; cursor: auto; color: inherit;\">If the choice is Shortest Job First<br \/>\nScheduling algorithm, then another menu will come up <\/span><\/p>\n<p style=\"margin-bottom: 8pt; line-height: 107%; cursor: auto; color: inherit;\"><span style=\"font-size: 12pt; line-height: 107%; cursor: auto; color: inherit;\"><span style=\"cursor: auto; color: inherit;\">1.<span style=\"font-size: 7pt; line-height: normal; cursor: auto; color: inherit;\">&nbsp;&nbsp;&nbsp;&nbsp; <\/span><\/span><\/span><span style=\"cursor: auto; color: inherit;\"><\/span><span style=\"font-size: 12pt; line-height: 107%; cursor: auto; color: inherit;\">SJF None Preemptive<\/span><\/p>\n<p style=\"margin-bottom: 8pt; line-height: 107%; cursor: auto; color: inherit;\"><span style=\"font-size: 12pt; line-height: 107%; cursor: auto; color: inherit;\"><span style=\"cursor: auto; color: inherit;\">2.<span style=\"font-size: 7pt; line-height: normal; cursor: auto; color: inherit;\">&nbsp;&nbsp;&nbsp;&nbsp; <\/span><\/span><\/span><span style=\"cursor: auto; color: inherit;\"><\/span><span style=\"font-size: 12pt; line-height: 107%; cursor: auto; color: inherit;\">SJF Preemptive<\/span><\/p>\n<p style=\"cursor: auto; color: inherit;\"><span style=\"font-size: 12pt; line-height: 115%; cursor: auto; color: inherit;\">Furthermore, If the choice is Page<br \/>\nReplacement, then another menu will come up <\/span><\/p>\n<p style=\"margin-bottom: 8pt; line-height: 107%; cursor: auto; color: inherit;\"><span style=\"font-size: 12pt; line-height: 107%; cursor: auto; color: inherit;\"><span style=\"cursor: auto; color: inherit;\">1.<span style=\"font-size: 7pt; line-height: normal; cursor: auto; color: inherit;\">&nbsp;&nbsp;&nbsp;&nbsp; <\/span><\/span><\/span><span style=\"cursor: auto; color: inherit;\"><\/span><span style=\"font-size: 12pt; line-height: 107%; cursor: auto; color: inherit;\">First In First Out (FIFO) <\/span><\/p>\n<p style=\"margin-bottom: 8pt; line-height: 107%; cursor: auto; color: inherit;\"><span style=\"font-size: 12pt; line-height: 107%; cursor: auto; color: inherit;\"><span style=\"cursor: auto; color: inherit;\">2.<span style=\"font-size: 7pt; line-height: normal; cursor: auto; color: inherit;\">&nbsp;&nbsp;&nbsp;&nbsp; <\/span><\/span><\/span><span style=\"cursor: auto; color: inherit;\"><\/span><span style=\"font-size: 12pt; line-height: 107%; cursor: auto; color: inherit;\">Optimal (OPT)<\/span><\/p>\n<p style=\"margin-bottom: 8pt; line-height: 107%; cursor: auto; color: inherit;\"><span style=\"font-size: 12pt; line-height: 107%; cursor: auto; color: inherit;\"><span style=\"cursor: auto; color: inherit;\">3.<span style=\"font-size: 7pt; line-height: normal; cursor: auto; color: inherit;\">&nbsp;&nbsp;&nbsp;&nbsp; <\/span><\/span><\/span><span style=\"cursor: auto; color: inherit;\"><\/span><span style=\"font-size: 12pt; line-height: 107%; cursor: auto; color: inherit;\">Least Recent Used (LRU) <\/span><\/p>\n<p style=\"cursor: auto; color: inherit;\"><b style=\"cursor: auto; color: inherit;\"><span style=\"font-size: 12pt; line-height: 115%; cursor: auto; color: inherit;\">Project Report<\/span><\/b><span style=\"font-size: 12pt; line-height: 115%; cursor: auto; color: inherit;\"><br style=\"cursor: auto; color: inherit;\"><br \/>\nFor this project you will be required to write a brief report discussing what<br \/>\nyou have learned about various algorithms.&nbsp;<\/span><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Write a program that demonstrates various operating systems algorithms. Use JAVA. Your program should have a menu driven concept such as: Your mission (should you choose to accept it) is to design and implement five different algorithms. These include: 1.&nbsp;&nbsp;&nbsp;&nbsp; First Come First Serve (FCFS) Scheduling algorithm 2.&nbsp;&nbsp;&nbsp;&nbsp; Shortest Job First Scheduling (SJF) algorithm 3.&nbsp;&nbsp;&nbsp;&nbsp; [&hellip;]<\/p>\n","protected":false},"author":3,"featured_media":0,"comment_status":"open","ping_status":"closed","template":"","meta":[],"disciplines":[654],"paper_types":[],"tagged":[],"aioseo_notices":[],"_links":{"self":[{"href":"https:\/\/www.goodacademic.com\/blog\/wp-json\/wp\/v2\/questions\/19358"}],"collection":[{"href":"https:\/\/www.goodacademic.com\/blog\/wp-json\/wp\/v2\/questions"}],"about":[{"href":"https:\/\/www.goodacademic.com\/blog\/wp-json\/wp\/v2\/types\/questions"}],"author":[{"embeddable":true,"href":"https:\/\/www.goodacademic.com\/blog\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/www.goodacademic.com\/blog\/wp-json\/wp\/v2\/comments?post=19358"}],"version-history":[{"count":0,"href":"https:\/\/www.goodacademic.com\/blog\/wp-json\/wp\/v2\/questions\/19358\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.goodacademic.com\/blog\/wp-json\/wp\/v2\/media?parent=19358"}],"wp:term":[{"taxonomy":"disciplines","embeddable":true,"href":"https:\/\/www.goodacademic.com\/blog\/wp-json\/wp\/v2\/disciplines?post=19358"},{"taxonomy":"paper_types","embeddable":true,"href":"https:\/\/www.goodacademic.com\/blog\/wp-json\/wp\/v2\/paper_types?post=19358"},{"taxonomy":"tagged","embeddable":true,"href":"https:\/\/www.goodacademic.com\/blog\/wp-json\/wp\/v2\/tagged?post=19358"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}