When a resource is shared among multiple consumers. Examples include CPU scheduling, Disk Scheduling. In the same way as Operating system executes the programs it performs multitasking, multiprocessing, parallel processing, and so on. You are required to build the data structure to handle the multiple processes coming for the execution. As there are many algorithms to execute the process. You need to build the First Come First Service (FCFS). To solve this problem, implement a data structure that handle the execution of process using FCFS. Create a process class which contain process name and burst time. The following methods are required to be implemented in the structure to organize it.

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

When a resource is shared among multiple consumers. Examples include CPU scheduling, Disk Scheduling. In the same way as Operating system executes the programs it performs multitasking, multiprocessing, parallel processing, and so on. You are required to build the data structure to handle the multiple processes coming for the execution. As there are many algorithms to execute the process. You need to build the First Come First Service (FCFS).

To solve this problem, implement a data structure that handle the execution of process using FCFS. Create a process class which contain process name and burst time. The following methods are required to be implemented in the structure to organize it.

  1. insertBack(Process): This method will add the process at the last location of processes list.
  2. remove (): This method will delete the process from the first location of processes
  3. getSize(): This method will return the total number of processes that the OS is handling currently.
  4. clear (): This method will erase the process
  5. isEmpty(): This method will checks for the processes in the list. If there is no process in the list than return true otherwise
  6. contains(Process): This method will checks presence of the respective processes in the list. If there is respective process in the list than return true otherwise
 
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY