1
GATE CSE 2014 Set 2
Numerical
+1
-0
A FAT (file allocation table) based file system is being used and the total overhead of each entry in the FAT is $$4$$ bytes in size. Given a $$100\,\, \times \,\,{10^6}$$ bytes disk on which the file system is stored and data block size is $${10^3}$$ bytes, the maximum size of a file that can be stored on this disk in units of $${10^6}$$ bytes is __________.
2
GATE CSE 2014 Set 2
+2
-0.6
Consider the procedure below for the Producer-Consumer problem which uses semaphores:
semaphore n = 0;
semaphore s = 1;
void producer()
{
while(true)
{
produce();
semWait(s);
semSignal(s);
semSignal(n);
}
}
void consumer()
{
while(true)
{
semWait(s);
semWait(n);
removeFromBuffer();
semSignal(s);
consume();
}
}
Which one of the following is TRUE?
A
The producer will be able to add an item to the buffer, but the consumer can never consume it.
B
The consumer will remove no more than one item from the buffer.
C
Deadlock occurs if the consumer succeeds in acquiring semaphore s when the buffer is empty.
D
The starting value for the semaphore n must be 1 and not 0 for deadlock-free operation.
3
GATE CSE 2014 Set 2
Numerical
+1
-0
Consider the function func shown below:
int func(int num)
{
int count = 0;
while(num)
{
count++;
num >>= 1;
}
return (count);
} 

The value returned by func(435) is _________.
4
GATE CSE 2014 Set 2
+1
-0.3
Suppose n and p are unsigned int variables in a C program. We wish to set p to $${}^n{C_3}$$. If n is large, which one of the following statements is most likely to set p correctly?
A
$$p = n*(n - 1)*(n - 2)/6$$
B
$$p = n*(n - 1)/2*(n - 2)/3$$
C
$$p = n*(n - 1)/3*(n - 2)/2$$
D
$$p = n*(n - 1)*(n - 2)/6.0$$
GATE CSE Papers
2023
2022
2020
2019
2018
2013
2012
2011
2010
2009
2008
2007
2006
2005
2004
2003
2002
2001
2000
1999
1998
1997
1996
1995
1994
1993
1992
1991
1990
1989
1988
1987
EXAM MAP
Medical
NEET