Question

Assuming the OS has a dedicated queue for suspended processes. Processes in the suspended queue could be suspended_ready or s

0 0
Add a comment Improve this question Transcribed image text
Answer #1

The answer is the process state should change to ready

when a suspended process becomes available it will be moved to ready state

Add a comment
Know the answer?
Add Answer to:
Assuming the OS has a dedicated queue for suspended processes. Processes in the suspended queue could...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Q.6. Consider a preemptive operating system where processes have priorities and a running process gets preempted...

    Q.6. Consider a preemptive operating system where processes have priorities and a running process gets preempted (i.e., forced to leave the CPU) as soon as a higher priority process is ready to run. The life cycle of a process, other than the very first process, begins with a "spawn" by another process and ends with either a regular "exit" by the process or a "terminate (process_id)" command by another process of equal or higher priority. COMP 346 – Fall 2019...

  • State transition diagram used for operating system management of the Process Control Block has the following...

    State transition diagram used for operating system management of the Process Control Block has the following states A New (Create)– In this step, process is about to be created but not yet created, it is the program which is present in secondary memory that will be picked up by OS to create the process. Ready -> Ready to run. After creation of a process, the process enters the ready state i.e. the process is loaded into the main memory. The...

  • You are to simulate a dispatcher using a priority queue system. New processes are to be...

    You are to simulate a dispatcher using a priority queue system. New processes are to be entered using a GUI with priority included (numbering should be automatic). Processes are also to be terminated by GUI command. Context switches are to be by command with the cause of the switch being immaterial. Assume only one CPU. Priorities and numbers of processes can be kept small, just big enough to demonstrate the below listed functionality. You may pre-populate the queues initially from...

  • Implement a First Come First Serve (FCFS) non-preemptive OS scheduling simulation with multiple processes, in python...

    Implement a First Come First Serve (FCFS) non-preemptive OS scheduling simulation with multiple processes, in python or c++. The simulation takes the 3 processes(listed below) and they all arrive at time 0. A single process consists of {CPU BURST, I/O BURST, CPU BURST, I/O BURST, etc…} The simulation accounts for all 3 processes, and does not run one process at a time. Process1 {4,24,5,73,3,31,5,27,4,33,6,43,4,64,5,19,2} Process2 {18,31,19,35,11,42,18,43,19,47,18,43,17,51,19,32,10} Process3 {6,18,4,21,7,19,4,16,5,29,7,21,8,22,6,24,5} For example at time 0, Process1 arrives and enters running state, Process2...

  • 2. Consider an operating system that has the fllowing process states, new, ready, waiting (or blocking), running, and terminated. Answer the following questions (a) Draw a process state transitio...

    2. Consider an operating system that has the fllowing process states, new, ready, waiting (or blocking), running, and terminated. Answer the following questions (a) Draw a process state transition diagram (b) Explain what may cause a process to enter the waiting state from the running state. (c) Do we need a queue for the processes in the running state? Justify your answer (d) Describe the actions taken by a kernel to context-switch between processes 2. Consider an operating system that...

  • Write a C program for: One technique for dealing with deadlock is called “detect and recover.” In...

    Write a C program for: One technique for dealing with deadlock is called “detect and recover.” In this scheme, some procedure is used to identify when a deadlock occurs, and then another procedure is used to deal with the blocked processes. One technique to identify a deadlock is to maintain a resource graph that identifies all processes, all resources, and the relationships between them (that is, which processes exclusively own which resources, and which processes are blocked waiting for which...

  • In the example of producer-and-consumer problem (slide-31), which semaphore is used to implement a critical section...

    In the example of producer-and-consumer problem (slide-31), which semaphore is used to implement a critical section for the shared variable, buffer? s n e all of them None of tem Deadlock may happen due to User consumes too much resource User holds some resources and waits for more System does not have shared resources There are no mutual exclusions of user processes Users hate each other Which of the following OS scheduling policy has the worst performance (response time)? Shortest...

  • I have done the a and b, but i'm so confuse with other questions, could someone help me to fix these questions, thanks so much. 4 Directed graphs Directed graphs are sometimes used operating syst...

    I have done the a and b, but i'm so confuse with other questions, could someone help me to fix these questions, thanks so much. 4 Directed graphs Directed graphs are sometimes used operating systems when trying to avoid deadlock, which is a condition when several processes are waiting for a resource to become available, but this wil never happen because Page 2 p2 T2 Figure 1: Minimal example of a resource allocation graph with deadlock other processes are holding...

  • A system consists of 1 CPU, 1 Disk, and 1 Network Interface. A web server running...

    A system consists of 1 CPU, 1 Disk, and 1 Network Interface. A web server running on this system consists of a process that waits for an HTTP request. Once the request is received, the process services it by fetching the requested file from disk (an I/O operation) and then by sending the file content to the client. Assume that serving a request consists of the following phases: i. Process uses the CPU for 2 msec (parse request) // CPU...

  • EMULATE A PROCESS CONTROL BLOCK In this assignment you will use Java, Python or C++ to...

    EMULATE A PROCESS CONTROL BLOCK In this assignment you will use Java, Python or C++ to create a process control block. All objects described aren’t provided, you will create them. You can divide up this code into separate files or put all code in one file. Proper documentation is essential, if there are no comments 5% of the total grade will be deducted. The process control block object PCB should have the following fields: ID: a unique ID for this...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT