1
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
Consider the following two transactions: T1 and T2.
T1: read (A); T2: read (B);
read (B); read (A);
if A = 0 then B ← B + 1; if B ≠ 0 then A ← A - 1;
write (B); write (A);
Which of the following schemes, using shared and exclusive locks, satisfy the requirements for strict two phase locking for the above transactions?2
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
Consider the B+ tree in the adjoining figure, where each node has at most two keys and three links.
Now the key K 50 is deleted from the B+ tree resulting after the two insertions made earlier. Consider the following statements about the B+ tree resulting after this deletion.
i) The height of the tree remains the same.
ii) The node
(disregarding the links) is present in the tree.
iii) The root node remains unchanged (disregarding the links).
Which one of the following options is true ?3
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
The order of a leaf node in a B+- tree is the maximum number of (value, data record pointer) pairs it can hold. Given that the block size is 1K bytes, data record pointer is 7 bytes long, the value field is 9 bytes long and a block pointer is 6 bytes long, what is the order of the leaf node?
4
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
Consider the B+ tree in the adjoining figure, where each node has at most two keys and three links.
![GATE CSE 2007 Database Management System - File Structures and Indexing Question 12 English 2](https://imagex.cdn.examgoal.net/f25OvysJYD5ESY4XT/VaAmiTl2fyo8ZesuJ3mdDIUZr2EPq/or46wC3jun0NbPejuYVhNg/image.svg)
Keys K 15 and then K 25 are inserted into this tree in that order. Exactly how many of the following nodes (disregarding the links) will be present in the tree after the two insertions?
Paper analysis
Total Questions
Algorithms
12
Compiler Design
5
Computer Networks
10
Computer Organization
5
Data Structures
13
Database Management System
11
Digital Logic
5
Discrete Mathematics
20
Operating Systems
9
Programming Languages
1
Theory of Computation
7
More papers of GATE CSE
GATE CSE 2024 Set 2
GATE CSE 2024 Set 1
GATE CSE 2023
GATE CSE 2022
GATE CSE 2021 Set 2
GATE CSE 2021 Set 1
GATE CSE 2020
GATE CSE 2019
GATE CSE 2018
GATE CSE 2017 Set 2
GATE CSE 2017 Set 1
GATE CSE 2016 Set 2
GATE CSE 2016 Set 1
GATE CSE 2015 Set 3
GATE CSE 2015 Set 2
GATE CSE 2015 Set 1
GATE CSE 2014 Set 2
GATE CSE 2014 Set 3
GATE CSE 2014 Set 1
GATE CSE 2013
GATE CSE 2012
GATE CSE 2011
GATE CSE 2010
GATE CSE 2009
GATE CSE 2008
GATE CSE 2007
GATE CSE 2006
GATE CSE 2005
GATE CSE 2004
GATE CSE 2003
GATE CSE 2002
GATE CSE 2001
GATE CSE 2000
GATE CSE 1999
GATE CSE 1998
GATE CSE 1997
GATE CSE 1996
GATE CSE 1995
GATE CSE 1994
GATE CSE 1993
GATE CSE 1992
GATE CSE 1991
GATE CSE 1990
GATE CSE 1989
GATE CSE 1988
GATE CSE 1987
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