1
GATE CSE 2003
+1
-0.3
Which of the following scenarios may lead to an irrecoverable error in a database system?
A
A transaction writes a data item after it is read by an uncommitted transaction
B
A transaction reads a data item after it is read by an uncommitted transaction
C
A transaction reads a data item after it is written by a committed transaction
D
A transaction reads a data item after it is written by an uncommitted transaction
2
GATE CSE 2003
+2
-0.6
Consider three data items D1, D2, and D3, and the following execution schedule of transactions T1, T2, and T3. In the diagram, R(D) and W(D) denote the actions reading and writing the data item D respectively. Which of the following statements is correct?

A
The schedule is serializable as T2; T3; T1
B
The schedule is serializable as T2; T1; T3
C
The schedule is serializable as T3; T2; T1
D
The schedule is not serializable
3
GATE CSE 2003
+1
-0.3
Assuming all numbers are in $$2's$$ complement representation, which of the following numbers is divisible by $$11111011?$$
A
$$11100111$$
B
$$11100100$$
C
$$11010111$$
D
$$11011011$$
4
GATE CSE 2003
+2
-0.6
The literal count of a Boolean expression is the sum of the number of times each literal appears in the expression. For example, the literal count of $$(xy + xz)$$ is $$4.$$ What are the minimum possible literal counts of the product -of -sum and sum -of-product representations respectively of the function given by the following Karnaugh map? Here, $$X$$ denotes “don’t care” A
$$(11, 9)$$
B
$$(9,13)$$
C
$$(9,10)$$
D
$$(11, 11)$$
GATE CSE Papers
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
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
Joint Entrance Examination