SUBJECT: SOFTWARE ENGINEERING Read the following code carefully and perform the following tasks: Draw Control Flow Graph for the given code Highlight all regions in the flow graph separately Using...

SUBJECT:
SOFTWARE ENGINEERING

Read the following code carefully and perform the following tasks:

1. Draw Control Flow Graph for the given code


2. Highlight all regions in the flow graph separately


3. Using cyclometic complexity formula, calculate number of basis path


4. Show path of each basis path test

wait (NULL); printf (" PARENT: value } 0) {/* child process * / == %d",value); /* LINE C */ 0) {/* parent process * / %d", value); /* LINE P * / void *runner (void *param) { value = 5; pthread exit (0); "/>
Extracted text: #include #include int value 0; void *runner (void *param); /* the thread * / int main (int argc, char *argv[]) { int pid; pthread.t tid; pthread attr.t attr; pid fork (); if (pid pthread attr.init (&attr); pthread.create (&tid, &attr,runner,NULL); pthread.join(tid,NULL); printf(" CHILD: value } else if (pid > wait (NULL); printf (" PARENT: value } 0) {/* child process * / == %d",value); /* LINE C */ 0) {/* parent process * / %d", value); /* LINE P * / void *runner (void *param) { value = 5; pthread exit (0);