Convert from C to C++ .Thank you. / include all required libraries #include #include #include #include #include // variable to store number of generations int num_generations; // function to print the generations void printGeneration(int n) { // stop if number of generations are reached if(n>num_generations) return; // create a fork pid_t p = fork(); // generate new generations if(p==0) printGeneration(n+1); else if(p>0) wait(0); // wait until child process terminates // print the present generation if(p!=0) { // if n is 0 if(n==0) printf("Parent. "); // print parent // if n is 1 else if(n==1) printf("Child. "); // print child // for all other cases else { // print grandchildren for(int i=0;i
Convert from C to C++ .Thank you.
/ include all required libraries
#include<stdio.h>
#include<stdlib.h>
#include<sys/types.h>
#include<sys/wait.h>
#include<unistd.h>
// variable to store number of generations
int num_generations;
// function to print the generations
void printGeneration(int n)
{
// stop if number of generations are reached
if(n>num_generations)
return;
// create a fork
pid_t p = fork();
// generate new generations
if(p==0)
printGeneration(n+1);
else if(p>0)
wait(0); // wait until child process terminates
// print the present generation
if(p!=0)
{
// if n is 0
if(n==0)
printf("Parent. "); // print parent
// if n is 1
else if(n==1)
printf("Child. "); // print child
// for all other cases
else
{
// print grandchildren
for(int i=0;i<n-2;i++)
printf("Great ");
printf("Grandchild. ");
}
// print pid and ppid
printf("pid: %d ppid: %d\n",getpid(),getppid());
}
}
// main function
int main(int argc, char* argv[])
{
// if no arguments are provided
if(argc==1)
{
// print usage
printf("Usage: ./generations num_generations\n");
}
else
{
// get the number of generations
num_generations = atoi(argv[1]);
// if number of generations is not positive
if(num_generations<=0)
{
// print error
printf("Error: num_generations must be greater than 0\n");
}
else
{
// print generations
printGeneration(0);
}
}
}
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
