The following C program is executed on a Unix/Linux system:
#include < unistd.h >
int main ()
{
int i ;
for (i=0; i<10; i++)
if (i%2 == 0) fork ( ) ;
return 0 ;
}
The total number of child processes created is _____.
Your input ____
2
GATE CSE 2019
MCQ (Single Correct Answer)
+2
-0.67
Assume that in a certain computer, the virtual addresses are 64 bits long and the physical addresses are 48 bits long. The memory is word addressable. The page size is 8 kB and the word size is 4 bytes. The Translation Look-aside Buffer (TLB) in the address translation path has 128 valid entries. At most how many distinct virtual addresses can be translated without any TLB miss?
A
16 × 210
B
8 × 220
C
4 × 220
D
256 × 210
3
GATE CSE 2019
Numerical
+2
-0
Consider the following four processes with arrival times (in milliseconds) and their length of CPU bursts (in milliseconds) as shown below :
These processes are run on a single processor using preemptive Shortest Remaining Time First scheduling algorithm. If the average waiting time of the processes is 1 millisecond, then the value of Z is _____.
Your input ____
4
GATE CSE 2019
Numerical
+1
-0
Consider three concurrent processes P1, P2 and P3 as shown below, which access a shared variable D that has been initialized to 100.
The processes are executed on a uniprocessor system running a time-shared operating system. If the minimum and maximum possible values of D after the three processes have completed execution are X and Y respectively, then the value of Y–X is _________.
