GATE CSE 2020 National Champion Quiz:Databases
Attempt now to get your rank among 985 students!
Question 1
(i) If relation R is in 3 NF and every key is simple then R is in BCNF
(ii) If relation R is in 3 NF and R has only one key then R is in BCNF
Which of the following is correct?
Question 2
Which cardinality best describes relationship runs where all team has drag experiment to runs?
Question 3
Suppose that we have an ordered file with one million records, stored on a disk. The block size is 2048B, Records are of fixed size and are unspanned. Record length is 256B.,then what is the number of blocks required for data file?
Question 4
Question 5
Question 6
S: r1(a); r2(b); w2(a); w2(b); w3(a); r3(c); w3(b); r1(c); w4(b); w3(c); r4(a); r4(c); w4(c); commit1; commit2;
commit3; commit4;
Question 7
Select T1.deptno
From EMPLOYEE T1
Where T1.Gender== ’FEMALE’
GroupBy T1.deptno
Having [Avg (Salary)> (Select Avg (T2.salary)
From EMPLOYEE T2
Where T2.Gender== ‘MALE’
AND T2.deptno== T1.deptno)]
What does this Query return?
Question 8
select distinct a1, a2, ..., an
from r1, r2, ..., rm
where P
For an arbitrary predicate P, this query is equivalent to which of the following relational algebra expressions?
Question 9
The following key values are inserted into an empty B+ tree where each node have two key values.
Find sum of keys present at height one (assume root is present at height 0)
8, 5, 1, 7, 3, 12, 9, 6
Question 10
In a B+ tree, if the search key value is 8 bytes long, the block size is 512 bytes and the block pointer size is 2 bytes, then maximum order of the B+ tree is _____.
Question 11
A) X is functionally dependent on Y.
B) Y is functionally dependent on X.
C) X is not functionally dependent on subset of Y
The set of attribute X will be fully functionally dependent on set of attribute Y if
Question 12
It is given that transaction T1 arrives before transaction T2 in the system.
Which of the following is true regarding the above schedule?
- 985 attempts
- 1 upvote
- 5 comments
Tags :
GATE & PSU CSDatabases