Time Left - 12:00 mins
Practice Quiz-12:DBMS
Attempt now to get your rank among 700 students!
Question 1
In a relation r, if every attribute is prime but key may not be simple then the relations is in.
Question 2
If a single dashed line is present below the name of the attribute then it symbolizes the ___________ of the _________.
Question 3
An ER model of a database consists of entity types A and B. These are connected by a relationship R which does not have its own attribute. Under which one of the following conditions, can the relational table for R be merged with that of A?
Question 4
Construct a B+-tree for the following set of key values:
(2, 3, 5, 7, 11, 17, 19, 23, 29, 31)
Assume that the tree is initially empty and values are added in ascending order. Construct B+-trees for the cases where the number of pointers is 4 and tell which element is root node of the tree.
(2, 3, 5, 7, 11, 17, 19, 23, 29, 31)
Assume that the tree is initially empty and values are added in ascending order. Construct B+-trees for the cases where the number of pointers is 4 and tell which element is root node of the tree.
Question 5
A file system is said to exhibit data dependence because
Question 6
Consider a B+ tree in which maximum number of keys in a node is 8. What is minimum number of keys present in a non leaf node?
Question 7
The natural join is a binary operation, it allows us to combine certain selections and Cartesian product into one operation. Then which of the following is true for natural join
Question 8
If P and Q are predicates and e is the relational algebra expression, then which of the following equivalence are valid?
Question 9
The five aggregations operators in SQL are
Question 10
Let there be 3 transactions T1, T2, T3 and three shared variables X, Y, Z. Read timestampand write timestamp of variableX by transaction i is denotedas rTS(X) and wTS(X) respectively. Given schedule S: r2(Z), r2(Y), w2(Y), r3(Y), r3(Z), r1(X), w1(X), w3(Y), w3(Z), r2(X), r1(Y), w1(Y), w2(X)
Time stamping algorithm does not allow execution of this schedule.Let p be the operationat which it is rollbacked. When it is rollbacked, the value of wTS(Y) + rTS(X) + wTS(Z) + p is
Time stamping algorithm does not allow execution of this schedule.Let p be the operationat which it is rollbacked. When it is rollbacked, the value of wTS(Y) + rTS(X) + wTS(Z) + p is
- 700 attempts
- 2 upvotes
- 3 comments
Tags :
GATE & PSU CSDatabasesApr 1GATE & PSU CS