Time Left - 15:00 mins
GATE CS 2022 : Database-1 (App update required to attempt this test)
Attempt now to get your rank among 267 students!
Question 1
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 2
Consider the following relation R(A, B, C, D, E, F, G) and set of functional dependencies.
F = {BCD → A, BC → E, A → F, F → G, C → D, A → G}
Which of the following is minimal cover of F?
Question 3
Given the basic ER and relational models, which of the following is INCORRECT?
Question 4
A primary key is combined with a foreign key creates
Question 5
Number of concurrent schedules that can be formed over 4 transactions having 1,3,2,2 operations respectively are
Question 6
Two transactions T1 and T2 are given as follows
T1: R1(B),R1(A),W1(A),W1(B)
T2: R2(A),W2(A)
Find the number of concurrent schedules
T1: R1(B),R1(A),W1(A),W1(B)
T2: R2(A),W2(A)
Find the number of concurrent schedules
- 267 attempts
- 0 upvotes
- 1 comment
Tags :
GATE & PSU CSDatabasesMay 25GATE & PSU CS
