2. When a process is “listed” in a queue, what information is actually stored in the...

Question

Question

2. When a process is “listed” in a queue, what information is actually stored in the...

2. When a process is “listed” in a queue, what information is actually stored in the list in memory?

engineering Computer-Science

Add a comment Improve this question Transcribed image text

Answer 1

Answer #1

Solution:

The information is stored in the list in memory:

Process State
Process Privileges
Process ID
Pointer
Program Counter
CPU Registers
CPU Scheduling Information
Memory Management Information
Accounting Information
IO Status Information

Note:I think the above things are stored because the process control block is also one of the memory:

Add a comment

Answer 2

Similar Homework Help Questions

(C++) I need to write a priority queue(where the processes inside are listed as example: P25:2...

(C++) I need to write a priority queue(where the processes inside are listed as example: P25:2 , 25 being a randomly assigned ID(1-50) and 2 being a randomly assigned priority number(1-10). Once the priority queue is full(10 max), it will transfer the highest priority process to a waiting queue. Once the waiting queue is full(7 max), one process(highest priority) will transfer to a ready queue where the system would perform the process in a round robin style. Once 25 processes...
Round Robin Simulation in C++ using queue Description: Write a program that utilizes STL queue that...

Round Robin Simulation in C++ using queue Description: Write a program that utilizes STL queue that simulates the round robin process scheduling algorithm. Requirement: - write a class Process that holds following integer information: id, arrival_time, time_needed, finished_time. - read and initiate 5 Process objects from associated file (round_robin.txt) - file format: id, arrival_time, time_needed - once a process is finished, mark its finished_time accordingly. - CPU time frame: 4. - utilize a queue for process scheduling. - store finished...
C++ -- Event processing simulation using a transaction queue Hi! it is queue simulation please read...

C++ -- Event processing simulation using a transaction queue Hi! it is queue simulation please read the instructions, write codes, and explain the code with comments. Thank you Transactions enter the system and are stored in a queue. Each transaction represents some work that needs to be accomplished. Servers exist which process transactions. Servers take transactions off the queue and process them. you’re building the simulation framework. The idea is that somebody would take your framework, and add the specifics...

Question 2 1 pts Concluding a process is out of control when it is actually in...

Question 2 1 pts Concluding a process is out of control when it is actually in control is known as a Type Il error. O True O False Question 3 1 pts In the weighted moving average forecasting model the sum of weights must be less than 1. True False Question 4 1 pts In order for a process to be capable, it should have a capability index of at least 2.5. True O False Question 5 1 pts The...
Where does top point, when implementing a stack with a LLL? Queue ADT: 1· 2. Where...

Where does top point, when implementing a stack with a LLL? Queue ADT: 1· 2. Where does front point, when implementing a queue with a LLL? Where does rear point, when implementing a queue with a LLL? Where does rear point, when implementing a queue with a CLL? a. b. c. 3. If you were to enqueue 10, 20, and 30 onto a queue in this order and then dequeue them off, in what order will they be removed from...
What is the principle difference in behavior between a stack and a queue? a stack preserves...

What is the principle difference in behavior between a stack and a queue? a stack preserves the order in which items are added whereas a queue reverses order there is no difference a stack reverses the order in which items are added whereas a queue preserves order xa stack does nothing whereas a queue can preserve and reverse the order that items are added to it Fill in the blank in the following sentence with one of the answers listed....

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...
Hi! it is c++ queue simulation please read the instructions, write codes, and explain the code...

Hi! it is c++ queue simulation please read the instructions, write codes, and explain the code with comments. Thank you Transactions enter the system and are stored in a queue. Each transaction represents some work that needs to be accomplished. Servers exist which process transactions. Servers take transactions off the queue and process them. you’re building the simulation framework. The idea is that somebody would take your framework, and add the specifics for whatever type of system it was going...
3/3 pts Question 11 What does the queue q contain after the following sequence of operations?...

3/3 pts Question 11 What does the queue q contain after the following sequence of operations? Note that the front of queue q is the left-most element listed and the rear of queue q is the right-most element listed. q. enqueue (1): q. enqueue (2):1.enqueue (3) q enqueue (q. dequeue) q. dequeueO q enqueue (4): q enqueue(5) q. dequeue O А.front l 1, 2, 4 l Tear B. front | 1, 4, 5 | rear C. front | 5, 4,...

Consider a situation when there is enough free memory to accommodate a single process, but no...

Consider a situation when there is enough free memory to accommodate a single process, but no single free memory area is big enough for it. What can be done to load this process in the memory? What are drawback(s) of this solution?

2. When a process is “listed” in a queue, what information is actually stored in the...

Homework Answers

Add Answer to:
2. When a process is “listed” in a queue, what information is actually stored in the...

Post as a guest

Earn Coins

(C++) I need to write a priority queue(where the processes inside are listed as example: P25:2...

Round Robin Simulation in C++ using queue Description: Write a program that utilizes STL queue that...

C++ -- Event processing simulation using a transaction queue Hi! it is queue simulation please read...

Question 2 1 pts Concluding a process is out of control when it is actually in...

Where does top point, when implementing a stack with a LLL? Queue ADT: 1· 2. Where...

What is the principle difference in behavior between a stack and a queue? a stack preserves...

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

Hi! it is c++ queue simulation please read the instructions, write codes, and explain the code...

3/3 pts Question 11 What does the queue q contain after the following sequence of operations?...

Consider a situation when there is enough free memory to accommodate a single process, but no...

2. When a process is “listed” in a queue, what information is actually stored in the...

Homework Answers

Add Answer to: 2. When a process is “listed” in a queue, what information is actually stored in the...

Post as a guest

Earn Coins

Add Answer to:
2. When a process is “listed” in a queue, what information is actually stored in the...