Question 2. Unix process creation a. Consider the following section of the code and assume that all fork system calls are successful and there is one process in the beginning that starts running at main. What is the total number of processes at the end of the execution of the following program? Sketch out the process tree. main() { fork () ; fork () ; fork () ; } b. Consider the following section of the code and assume that all fork system calls are successful. Draw a process tree for the following program. What will be printed? What value is returned if fork system call is not successful? main () { int i = 1; int ret val = 1; while (i <= 2) { if (ret_val > 0) { printf("In parent +d. \n", i); else { printf("In child td. \n", i); } ret val = fork (); i = i + 1; }
Question 2. Unix process creation a. Consider the following section of the code and assume that all fork system calls are successful and there is one process in the beginning that starts running at main. What is the total number of processes at the end of the execution of the following program? Sketch out the process tree. main() { fork () ; fork () ; fork () ; } b. Consider the following section of the code and assume that all fork system calls are successful. Draw a process tree for the following program. What will be printed? What value is returned if fork system call is not successful? main () { int i = 1; int ret val = 1; while (i <= 2) { if (ret_val > 0) { printf("In parent +d. \n", i); else { printf("In child td. \n", i); } ret val = fork (); i = i + 1; }
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Transcribed Image Text:Question 2. Unix process creation
a. Consider the following section of the code and assume that all fork system calls are successful and
there is one process in the beginning that starts running at main. What is the total number of processes
at the end of the execution of the following program? Sketch out the process tree.
main()
{
fork () ;
fork () ;
fork () :
b. Consider the following section of the code and assume that all fork system calls are successful. Draw a
process tree for the following program. What will be printed? What value is returned if fork system
call is not successful?
main()
{
int i = 1;
int ret val = 1;
while (i <= 2)
{
if (ret_val > 0) {
printf("In parent %d. \n", i);
}
else {
printf("In child td. \n", i);
}
ret val = fork () ;
i = i + 1;
}
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 3 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education