Assuming that the system call fork() never fails, consider the following C programs P1 and P2 executed on a UNIX/Linux system.
P1 P2 int main() {
fork();
fork();
fork();
printf("Happy\n");
} int main() {
fork();
printf("Happy\n");
fork();
printf("Happy\n");
fork();
printf("Happy\n");
}
Statement I: P1 displays "Happy" 8 times.
Statement II: P2 displays "Happy" 12 times.
In light of the above statements, choose the most appropriate answer.
| P1 | P2 |
|---|---|
| int main() { fork(); fork(); fork(); printf("Happy\n"); } | int main() { fork(); printf("Happy\n"); fork(); printf("Happy\n"); fork(); printf("Happy\n"); } |
Statement II: P2 displays "Happy" 12 times.
In light of the above statements, choose the most appropriate answer.
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: C. (C) Statement I is correct but Statement II is false
More System Software and Operating System questions
- Consider the following four processes with the arrival time and length of CPU burst given in milliseconds: Process Arrival Time Burst Time…
- Which module gives control of the CPU to the process selected by the short-term scheduler?
- A fair share scheduler computes the priority of a process based on which of the following? (1) Processor utilization by the individual proc…
- Which of the following CPU scheduling algorithms may cause starvation of a process? (1) First-Come-First-Served (2) Round Robin (3) Priorit…
- A scheduling algorithm assigns a process's priority proportional to how long it has been waiting; every process starts at priority zero (th…
- Which of the following statements are CORRECT? (A) A process always checks the state of the currently executing process to enter its critic…