GATE CS 2026 Set 1 — Question 63
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.NAT+2 / -0MediumProcess Creation (fork, exec)Processes & ThreadsOperating SystemControl FlowC ProgrammingProgramming & Data Structures
Operating System → C Programming → Control Flow
Last updated
Question
Consider the following program snippet. Assume that the program compiles and runs successfully. Further, assume that the The total number of times that the
fork() system call is always successful in creating a process.int main () {
int i;
for (i = 0; i < 3; i++){
if (fork() == 0){
continue;
}
break;
}
printf("Hello!");
return 0;
}
printf statement gets executed is ________. (answer in integer)Correct answer
4 to 4
Solution
The program uses a
for loop that iterates for . Inside the loop, a fork() system call is made. 1.Initial State: We start with one process, let's call it .
2.Iteration : calls
fork(), creating a child process .- In the parent ,
fork()returns the PID of (non-zero). Theifcondition is false, so it executesbreak, exits the loop, and prints "Hello!". - In the child ,
fork()returns . Theifcondition is true, so it executescontinueand moves to the next iteration ().
fork(), creating a child process .- In the parent ,
fork()returns non-zero. It executesbreak, exits the loop, and prints "Hello!". - In the child ,
fork()returns . It executescontinueand moves to the next iteration ().
fork(), creating a child process .- In the parent ,
fork()returns non-zero. It executesbreak, exits the loop, and prints "Hello!". - In the child ,
fork()returns . It executescontinueand moves to the next iteration ().
printf statement exactly once. Thus, the total number of executions is .Continue learning with Success Tracker
A step still unclear? Work through it with support
Use Success Tracker to ask about the reasoning, then try another GATE CS question to check your understanding.
AI-powered practice· Unlimited practice on eligible plans
- PYQs with solutions
- Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
- Practice that adapts
- Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
- AI doubt support
- Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.
Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.
This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.
More questions on C Programming
2026 Set 2 Q12The set T represents various traversals over binary tree. The set S represents the order of…2026 Set 2 Q19Consider the following three ANSI-C programs, P1, P2, and P3. P1 [code] P2 [code] **P3**…2026 Set 1 Q23Let be an odd number greater than 100. Consider a binary minheap with elements stored in an…2026 Set 2 Q23Which one of the following CPU scheduling algorithms cannot be preemptive?2026 Set 1 Q24Consider a hash table that is initially empty. The hash table is maintained…