Fork System Call in Linux


Write a C program to do the following when executed on a Linux system.

1. The parent process creates two other processes (child processes).

2. The parent prints "PARENT"

3. One child prints "CHILD 1"

4. The other child prints "CHILD 2"



C Code:

#include <stdio.h>

#include <unistd.h>



int main()

{

     if (fork())

  {

     printf("parent\n");

     if(fork()==0)

   {

     printf("child1\n");

   }

  }

     else

  {

     printf("child2\n");

  }

     return 0;

}

Comments

Post a Comment

Popular posts from this blog

Programming Using GNU Octave

Image
  Questions: 1 A small object is projected from a toy gun to travel some distance and land on the ground. 1. Write a function to model the dynamics of the object in Octave called f_trajectory. f_trajectory will accept following arguments in the same order (measured in the given units). Also specify the default values for each parameter as given in brackets. i. h(5) : Initial height of the projectile (m) ii. g(9.81) : acceleration from gravity (m/s/s) iii. v(25) : speed at initial release (m/s) iv. theta(π/4) : angle of release (radians) v. t : a vector representing the points in time For default values of t check if the variable ‘exist’ with name ‘t’ and type ‘var’ if not initialize it as a row vector starting from 0 and goes to 5 with increments of 0.1. If x is distance and y is height, the equations below describe their dependence on time and all the other parameters. 𝑥(𝑡)=𝑣𝑐𝑜𝑠(𝜃)𝑡 ----------------(eq1) 𝑦(𝑡)=ℎ+𝑣𝑠𝑖𝑛(𝜃)𝑡− 12𝑔𝑡2 ---------------(eq2) Convert the abo...
Read more

Stack Implementation

Image
                Stack Implementation in C Language #include<stdio.h> int MAXSIZE =10; // Declaring the maximum size of the stack int stack[10];  int top = -1; int peek(){ // peek function to display the top element of the stack return stack[top]; } int isFull(){ // isFull function to check whether the stack is full or not if(top==MAXSIZE) return 1; else return 0; } int isEmpty(){ // isEmpty function to check whether the stack is empty or not if(top==-1) return 1; else return 0; } int pop(){ //pop function to delete the top element of the stack if(!isEmpty()){ int value; value = stack[top]; top =  top -1; return value; } else printf("Stack is empty, cannot pop elements\n"); } int push(int value){ // push function to insert elements into the stack if(!isFull()){ top = top + 1; stack[top] = value; } else printf("Stack is full, cannot insert mo...
Read more

Implement a malloc

Image
Implement a malloc-like memory allocation library 1. Declare an array of 25000 bytes. 2. You must implement a function that is like malloc(). Call it MyMalloc(). Its signature is similar to malloc(). You should also implement MyFree() which has a signature and functionality that are similar to free(). 3. MyMalloc() allocates memory only from the previously mentioned array of 25000 bytes. 4. All the data structures that are required to manage the memory must also reside within the same array. 5. MyMalloc() and MyFree() must be in a file called mymalloc.c. You should also provide a suitable header file mymalloc.h. 6. Our test program contains the main() and it includes mymalloc.h. Do not include a main() in your mymalloc.c. Sample Code in C: #include <stdio.h> #include <stddef.h> #include "mymalloc.h" struct node *freearray=(void*)array; // to point the first place in array[25000] void *mymalloc(size_t bytes){ // get the value of bytes that...
Read more