BITS Pilani, Hyderabad Campus CSF212, Database Systems : (2M) (2M) (2M) (2M) (2M)

*
BITS Pilani, Hyderabad Campus

*CSF212, Database Systems*
Quiz- 4 (Open Book) Dt. 27/04/2019 Marks: /20
Name: __________________ ID #: _____________
Answers
1.(2M ) 2.(2M ) 3.(2M ) 4.(2M ) 5.(2M )
B B C B C
6.(2M ) 7.(2M ) 8.(2M ) 9.(2M ) 10.(2M )

D B C 49 20000
Note 1: Write your answers in the space above. Note 2: Please turn over for remaining questions
Q1: Consider the following instance:
Id Name Cgpa
a1 ABHISHEK 9.1
a1 ABHISHEK 9.2
a2 ABHISHEK 9.1
a2 ABHISHEK 9.3
What is the number of functional dependencies in the canonical cover of the instance?
A. 1 B. 2 C. 3 D. 4
Q2: We want to construct a B-Tree of order 4 for the following search key value 2,3,5,11,19,23,29,31.
Search key value 31 will be placed at what level (Root= 1 level)
A. 1 B. 2 C. 3 D. 4
Q3: Consider a multi index with 1024 rst level entries and blocking factor is 10. Then how
many level are there?
A. 2 B. 3 C. 4 D. None of These
Q4: Let r(R) be a relation on schema R and s(S) a relation on schema S. To perform the
operation s/r. The attribute set of R and S must satisfy.
A. R ⊆S B. R ⊂S C. R ∩S=φ D. R −S=φ
Q5: Following dependencies are given: A → B, B → D, A → C, BC → A. Find the highest

normal form.
A. 1 NF B. 2 NF C. 3 NF D. BCNF
Q6: Consider the relation schema: Project (pno, pname,budget,city)
SQL Query: select pname from project where not(budget<=(select budget from proj
where city='HYD')).
Above SQL query:
A. Name of the projects whose budgets is less than at-least one project in HYD.
B. Name of the projects whose budgets is greater than at-least some project in HYD.
C. Name of the projects whose budgets is less than all projects in HYD.
D. Name of the projects whose budgets is greater than all projects in HYD.
Q7: Consider the following ER diagram.
A4 E2 R E1
A5
A7 A8 A9
A3
A91 A92
minimum number of tables needed to represent E1, E2, and R is
A. 3 B. 4 C. 6 D. 5
Q8: Consider two sets of functional dependencies as: FD1={P → Q, PQ → R, R → P }

FD2={QR → P, P → R, R → Q }
A. FD1 covers FD2 B. FD2 covers FD1
C. FD1 and FD2 are equivalent D. None of These
Q9: In a B+ tree, if the search-key value is 15 bytes long, the block size is 1024 bytes and
the block pointer is 6 bytes, record pointer is 8 bytes then the maximum number of tree
pointer that can be accommodated in each non-leaf node of the tree is :
Q10: Consider a disk with block size B = 1048 bytes, block pointer is P = 8 bytes, record
pointer is Pr = 9 bytes, and two ordered les R1 = 200 records of xed-size 200 bytes
and R2= 300 record of xed-size 100 bytes. Both les are un-spanned then how many
blocks do we need to hold the resultant table of R1×R2?
Page 2
*

$CSF212, Database Systems$
Name: __________________ ID #: _____________
Answers
1.(2M ) 2.(2M ) 3.(2M ) 4.(2M ) 5.(2M )
C B B A C
6.(2M ) 7.(2M ) 8.(2M ) 9.(2M ) 10.(2M )

C D A 44 30000
Id Name Cgpa
a1 ABHISHEK 9.1
a1 ABHISHEK 9.1
a2 ABHISHEK 9.2
a2 ABHISHEK 9.3
A. 1 B. 2 C. 3 D. 4
Q2: We want to construct a B-Tree of order 4 for the following search key value 2,3,5,31,11,19,23,29.
A. 1 B. 2 C. 3 D. 4
may level are there?
A. R ⊂S B. R ⊆S C. R ∩S=φ D. R −S=φ
Q5: Following dependencies are given: A → B, B → D, A → D, BC → A. Find the highest

normal form.
SQL Query: select pname from project where not(budget>=(select budget from proj
where city='HYD')).
Above SQL query:
A4 E2 R E1
A5
A7 A8 A9
A3
A91 A92
A. 3 B. 4 C. 6 D. 5

FD2={QR → P, P → R, R → P }
Q9: In a B+ tree, if the search-key value is 15 bytes long, the block size is 1024 bytes and the
block pointer is 6 bytes, record pointer is 8 bytes then the maximum number of record
pointer that can be accommodated in each leaf node of the tree is :
Page 2
*

#CSF212, Database Systems#
Name: __________________ ID #: _____________
Answers
1.(2M ) 2.(2M ) 3.(2M ) 4.(2M ) 5.(2M )
D A B B B
6.(2M ) 7.(2M ) 8.(2M ) 9.(2M ) 10.(2M )

A A B 37 30000
Id Name Cgpa
a1 ABHISHEK 9.1
a1 ABHISHEK 9.1
a2 ABHISHEK 9.2
a2 ABHISHEK 9.2
A. 5 B. 2 C. 3 D. 4
Q2: We want to construct a B-Tree of order 4 for the following search key value 2,31,35,37,19,23,29.
A. 1 B. 2 C. 3 D. 4
A. R −S=φ B. R ⊂S C. R ∩S=φ D. R ⊆S
Q5: Following dependencies are given: A → B, B → D, D → C, BC → A. Find the highest

normal form.
SQL Query: select pname from project where not(budget<=(select budget from proj
where city='HYD')).
Above SQL query:
A. Name of the projects whose budgets is greater than all projects in HYD.
B. Name of the projects whose budgets is less than at-least one project in HYD.
A4 E2 R E1
A5
A7 A8 A9
A3
A91 A92
A. 3 B. 4 C. 6 D. 5
Q8: Consider two sets of functional dependencies as: FD1={P → Q, PQ → R, R → Q }

FD2={QR → P, P → R, R → Q }
block pointer is 12 bytes, record pointer is 14 bytes then the minimum number of key
that can be accommodated in each non-leaf node of the tree is :
Page 2
*

+CSF212, Database Systems+
Name: __________________ ID #: _____________
Answers
1.(2M ) 2.(2M ) 3.(2M ) 4.(2M ) 5.(2M )
B FULL MARKS B B D
6.(2M ) 7.(2M ) 8.(2M ) 9.(2M ) 10.(2M )

C B C 38 30000
Id Name Cgpa
a1 ABHISHEK 9.1
a1 ABHISHEK 9.2
a2 ABHISHEK1 9.1
a2 ABHISHEK1 9.3
A. 1 B. 2 C. 3 D. 4
Q2: We want to construct a B-Tree of order 4 for the following search key value 32,27,25,41,19,23,29.
A. 1 B. 2 C. 3 D. 4
A. R ∩S=φ B. R ⊂S C. R ⊆S D. R −S=φ
Q5: Following dependencies are given: A → B, B → C, A → C, BC → A. Find the highest

normal form.
SQL Query: select pname from project where not(budget>=(select budget from proj
where city='HYD')).
Above SQL query:
A4 E2 R E1
A5
A7 A8 A9
A3
A91 A92
A. 3 B. 4 C. 6 D. 5

FD2={QR → P, P → R, R → Q }
block pointer is 12 bytes, record pointer is 16 bytes then the minimum number of tree
pointer that can be accommodated in each non-leaf node of the tree is :
Page 2

BITS Pilani, Hyderabad Campus CSF212, Database Systems : (2M) (2M) (2M) (2M) (2M)

Uploaded by

Copyright:

Available Formats

BITS Pilani, Hyderabad Campus CSF212, Database Systems : (2M) (2M) (2M) (2M) (2M)

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

BITS Pilani, Hyderabad Campus CSF212, Database Systems : (2M) (2M) (2M) (2M) (2M)

Uploaded by

Copyright:

Available Formats

*

BITS Pilani, Hyderabad Campus

6.(2M ) 7.(2M ) 8.(2M ) 9.(2M ) 10.(2M )

Q1: Consider the following instance:

Q5: Following dependencies are given: A → B, B → D, A → C, BC → A. Find the highest

Q7: Consider the following ER diagram.

minimum number of tables needed to represent E1, E2, and R is

Q8: Consider two sets of functional dependencies as: FD1={P → Q, PQ → R, R → P }

BITS Pilani, Hyderabad Campus

6.(2M ) 7.(2M ) 8.(2M ) 9.(2M ) 10.(2M )

Q1: Consider the following instance:

Q5: Following dependencies are given: A → B, B → D, A → D, BC → A. Find the highest

Q7: Consider the following ER diagram.

minimum number of tables needed to represent E1, E2, and R is

Q8: Consider two sets of functional dependencies as: FD1={P → Q, PQ → R, R → P }

BITS Pilani, Hyderabad Campus

6.(2M ) 7.(2M ) 8.(2M ) 9.(2M ) 10.(2M )

Q1: Consider the following instance:

Q5: Following dependencies are given: A → B, B → D, D → C, BC → A. Find the highest

Q7: Consider the following ER diagram.

minimum number of tables needed to represent E1, E2, and R is

Q8: Consider two sets of functional dependencies as: FD1={P → Q, PQ → R, R → Q }

BITS Pilani, Hyderabad Campus

6.(2M ) 7.(2M ) 8.(2M ) 9.(2M ) 10.(2M )

Q1: Consider the following instance:

Q5: Following dependencies are given: A → B, B → C, A → C, BC → A. Find the highest

Q7: Consider the following ER diagram.

minimum number of tables needed to represent E1, E2, and R is

Q8: Consider two sets of functional dependencies as: FD1={P → Q, PQ → R, R → P }

You might also like