Help with Operating Systems conceptual questions
Please help me with the following questions, the answers are misleading:
1. The xv6 OS uses a state called RUNABLE. What does this mean?
A - The process is being admitted into the system.
B - The process is ready to be executed.
C - The process is being executed.
D - The process is waiting an I/O operaton to be completed.
E - The process is terminating.
F - None of these responses are fully correct.
2. If a process is blocked, what does that mean?
A - The process is being admitted into the system.
B - The process is ready to be executed.
C - The process is being executed.
D - The process is waiting an I/O operaton to be completed.
E - The process is terminating.
F - None of these responses are fully correct.
3. Why might a process involuntarily give up the CPU? Assume a non-preemptive environment. Check all that apply.
A - A higher priority process enters the system.
B - The processes requests an I/O operaton.
C - The processes time slice expires.
D - The processes I/O request is completed.
E - The process terminates.
F - None of these responses are fully correct.
4. Why might a process involuntarily give up the CPU? Assume a preemptive environment. Check all that apply.
A - A higher priority process enters the system.
B - The process terminates.
C - The processes requests an I/O operaton.
D - The processes time slice expires.
E - The processes I/O request is completed.
F - None of these responses are fully correct.
5. What is meant by a soft real time system?
A - Scheduling algorithms that execute in a timed, scheduled manner.
B - Guaranteed to meet any scheduling requirements (within certain limits).
C - Refers to the notion that the kernel tries to schedule applications within timing deadlines, but the kernel does not promise to always achieve these goals.
D - None of these responses are fully correct.
6. What is meant by a hard real time system?
A - Scheduling algorithms that execute in a timed, scheduled manner.
B - Guaranteed to meet any scheduling requirements (within certain limits).
C - Refers to the notion that the kernel tries to schedule applications within timing deadlines, but the kernel does not promise to always achieve these goals.
D - None of these responses are fully correct.
Any help would be appreciated!
1. The xv6 OS uses a state called RUNABLE. What does this mean?
A - The process is being admitted into the system.
B - The process is ready to be executed.
C - The process is being executed.
D - The process is waiting an I/O operaton to be completed.
E - The process is terminating.
F - None of these responses are fully correct.
2. If a process is blocked, what does that mean?
A - The process is being admitted into the system.
B - The process is ready to be executed.
C - The process is being executed.
D - The process is waiting an I/O operaton to be completed.
E - The process is terminating.
F - None of these responses are fully correct.
3. Why might a process involuntarily give up the CPU? Assume a non-preemptive environment. Check all that apply.
A - A higher priority process enters the system.
B - The processes requests an I/O operaton.
C - The processes time slice expires.
D - The processes I/O request is completed.
E - The process terminates.
F - None of these responses are fully correct.
4. Why might a process involuntarily give up the CPU? Assume a preemptive environment. Check all that apply.
A - A higher priority process enters the system.
B - The process terminates.
C - The processes requests an I/O operaton.
D - The processes time slice expires.
E - The processes I/O request is completed.
F - None of these responses are fully correct.
5. What is meant by a soft real time system?
A - Scheduling algorithms that execute in a timed, scheduled manner.
B - Guaranteed to meet any scheduling requirements (within certain limits).
C - Refers to the notion that the kernel tries to schedule applications within timing deadlines, but the kernel does not promise to always achieve these goals.
D - None of these responses are fully correct.
6. What is meant by a hard real time system?
A - Scheduling algorithms that execute in a timed, scheduled manner.
B - Guaranteed to meet any scheduling requirements (within certain limits).
C - Refers to the notion that the kernel tries to schedule applications within timing deadlines, but the kernel does not promise to always achieve these goals.
D - None of these responses are fully correct.
Any help would be appreciated!
How about, you provide answers, and we can check if you're correct and explain the wrong ones.
You've not engaged in the questions you've asked to date, so it kinda feels like a waste of our time.
You've not engaged in the questions you've asked to date, so it kinda feels like a waste of our time.
Last edited on
Topic archived. No new replies allowed.