Question

In: Computer Science

True or false 1) OS uses multiple queues in process scheduling. At any time instance, the...

True or false

1) OS uses multiple queues in process scheduling. At any time instance, the PCB of a process can only belong to one queue.

2)OS uses the \proc pseudo-file system to store the statistical information of a process. Even if a process is terminated, we can still find the statistical information on of this process from the \proc pseudo-file system.

3) When a process successfully calls an exec*() function to run a program, the executed program will inherit the PID of the calling process.

4) Since asynchronous I/O will not block the calling process, the processes that calls asynchronous I/O will never transit from the running state to the wait state during asynchronous I/O.

Solutions

Expert Solution

1) OS can have multiple queues for scheduling examples: multi level queue, multi level feedback queue scheduling.

A process can be moved from one queue to another by moving its PCB but, it can be in one PCB at a time. Hence the statement is TRUE

2) In a linux OS, you can go to /proc/<pid>/ directory to find information about the process(also information recorded since it started executing). Linux calls its processes and threads as task, so its appropriate to say /proc/<task-id>/ directory. Hence TRUE

3) A child process once created can call execute() to replace its address space with a new process's address space. But it won't inherit its parent's process id. Hence FALSE

4) If a process has started an asynchronous I/O(and later it will invoke the completion handler), it can also start a synchronous IO(to implement this we will have to invoke the completion handler for async IO after completion of synchronous I/O), now the process can enter into blocked state. Hence FALSE

Edit: In case of asynchronous IO, lets say an async IO operation is initiated and the process continues with operations not dependent on the data that will be generated by the async IO operation. After all the non dependent operations have been finished and the IO operation is still not finished, the process can still go to a wait state(as now it has to wait anyways for the IO operation to finish),


Related Solutions

For Multiple-Level Queues Scheduling, What is the arrival time, completion time, burst time, turnaround time, and...
For Multiple-Level Queues Scheduling, What is the arrival time, completion time, burst time, turnaround time, and the waiting time? discuss these terms further as they pertain to the efficiency of the algorithm as well as properties such as starvation. Pros and Cons of Multiple-Level Queues Scheduling
does a zombie process use CPU time true or false and is it true or false...
does a zombie process use CPU time true or false and is it true or false that a orphan process will find a new parent and will not use CPU time.
Answer: 1. List the short term (CPU) scheduling algorithms implemented in the OS.
Answer: 1. List the short term (CPU) scheduling algorithms implemented in the OS.
true or false all of them 6. The four components managed by an OS are Main...
true or false all of them 6. The four components managed by an OS are Main Memory, System Bus, Processor (CPU), and I/O Modules. 7.Every (Unix or Linux) process has its own unique PID (process ID). 8. Two different (Unix or Linux) processes can have the same PID. 9. Two different (Unix or Linux) processes can have the same PPID (parent process ID). 10. Process management code in the kernel is always executed in kernel mode.
True or False? -for any process the enthalpy of the universe must increase or remain unchanged....
True or False? -for any process the enthalpy of the universe must increase or remain unchanged. -and endothermic reaction results in heat being absorbed from the surroundings and a decrease in temperature of the surroundings.
What is the waiting time and Turnaround time of each process for each of the scheduling...
What is the waiting time and Turnaround time of each process for each of the scheduling algorithms? [12 Marks] Job Arrival Time Burst(msec) Priority A 0 6 3 (Silver) B 1 2 1 (Diamond) C 3 5 3 (Silver) D 5 3 4 (Bronze) E 7 2 2 (Gold) (a) First-Come-First-Served (FCFS) scheduling [2 Marks] (b) Preemptive PRIORITY scheduling [2 Marks] (c) Highest Response Ratio Next (HRRN) scheduling [2 Marks] (d) Round Robin (RR) (quantum = 4) scheduling [2 Marks]...
What is the waiting time and Turnaround time of each process for each of the scheduling...
What is the waiting time and Turnaround time of each process for each of the scheduling algorithms? [12 Marks] Job Arrival Time Burst(msec) Priority A 0 6 3 (Silver) B 1 2 1 (Diamond) C 3 5 3 (Silver) D 5 3 4 (Bronze) E 7 2 2 (Gold) (a) First-Come-First-Served (FCFS) scheduling [2 Marks] (b) Preemptive PRIORITY scheduling [2 Marks] (c) Highest Response Ratio Next (HRRN) scheduling [2 Marks] (d) Round Robin (RR) (quantum = 4) scheduling [2 Marks]...
What is the waiting time and Turnaround time of each process for each of the scheduling...
What is the waiting time and Turnaround time of each process for each of the scheduling algorithms? [12 Marks] Job Arrival Time Burst(msec) Priority A 0 6 3 (Silver) B 1 2 1 (Diamond) C 3 5 3 (Silver) D 5 3 4 (Bronze) E 7 2 2 (Gold) (a) First-Come-First-Served (FCFS) scheduling [2 Marks] (b) Preemptive PRIORITY scheduling [2 Marks] (c) Highest Response Ratio Next (HRRN) scheduling [2 Marks] (d) Round Robin (RR) (quantum = 4) scheduling [2 Marks]...
What is the waiting time and Turnaround time of each process for each of the scheduling...
What is the waiting time and Turnaround time of each process for each of the scheduling algorithms? Job Arrival Time Burst(msec) Priority A 0 6 3 (Silver) B 1 2 1 (Diamond) C 3 5 3 (Silver) D 5 3 4 (Bronze) E 7 2 2 (Gold) (a) First-Come-First-Served (FCFS) scheduling. (b) Preemptive PRIORITY scheduling . (c) Highest Response Ratio Next (HRRN) scheduling. (d) Round Robin (RR) (quantum = 4) scheduling. (e) Which of the foregoing scheduling policies provides the...
What is the waiting time and Turnaround time of each process for each of the scheduling...
What is the waiting time and Turnaround time of each process for each of the scheduling algorithms? [12 Marks] Job Arrival Time Burst(msec) Priority A 0 6 3 (Silver) B 1 2 1 (Diamond) C 3 5 3 (Silver) D 5 3 4 (Bronze) E 7 2 2 (Gold) (a) First-Come-First-Served (FCFS) scheduling [2 Marks] (b) Preemptive PRIORITY scheduling [2 Marks] (c) Highest Response Ratio Next (HRRN) scheduling [2 Marks] (d) Round Robin (RR) (quantum = 4) scheduling [2 Marks]...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT