The cyclomatic complexity of each of the modules X and Y shown below is 10. What is the cyclomatic complexity of the sequential integration shown on the right hand side?
What is the output of the following program?
int a = 10;
if ((fork ( ) == 0))
”, a );
Given reference to the following pages by a program
0, 9, 0, 1, 8, 1, 8, 7, 8, 7, 1, 2, 8, 2, 7, 8, 2, 3, 8, 3
How many page faults will occur if the program has three page frames available to it and uses an optimal replacement?
In a doubly linked list, the number of pointers affected for an insertion operation will be
<bonus marks awarded>
Consider the following C function
void swap ( int x, int y )
tmp = x;
y = tmp;
In order to exchange the values of two variables a and b: