1
GATE CSE 2014 Set 2
+2
-0.6
Consider a join (relation algebra) between relations r(R)and s(S) using the nested loop method. There are 3 buffers each of size equal to disk block size, out of which one buffer is reserved for intermediate results. Assuming size(r(R)) < size(s(S)), the join will have fewer number of disk block accesses if
A
relation r(R) is in the outer loop.
B
relation s(S) is in the outer loop.
C
join selection factor between r(R) and s(S) is more than 0.5.
D
join selection factor between r(R) and s(S) is less than 0.5.
2
GATE CSE 2014 Set 2
+2
-0.6
Consider the following schedule S of transactions T1, T2, T3, T4:
A
S is conflict-serializable but not recoverable
B
S is not conflict-serializable but is recoverable
C
S is both conflict-serializable and recoverable
D
S is neither conflict-serializable not is it recoverable
3
GATE CSE 2014 Set 2
Numerical
+1
-0
Consider the equation $${\left( {123} \right)_5} = {\left( {x8} \right)_y}$$ with $$x$$ and $$y$$ as unknown. The number of possible solutions is _________.
4
GATE CSE 2014 Set 2
+1
-0.3
The dual of a Boolean function $$F\left( {{x_1},{x_2},\,....,\,{x_n},\, + , \cdot ,'} \right),$$ written as $${F^D}$$, is the same expression as that of $$F$$ with $$+$$ and $$\cdot$$ swapped. $$F$$ is said to be self-dual if $$F = {F^D} \cdot$$. The number of self-dual functions with $$n$$ Boolean variables is
A
$${2^n}$$
B
$${2^{n - 1}}$$
C
$${2^{{2^n}}}$$
D
$${2^{{2^{n - 1}}}}$$
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