21/06/2021 2/4 B.

Tech (CSE) 4th Semester, AAT-3 DBMS(18CS403)

2/4 B.Tech (CSE) 4th Semester, AAT-3

DBMS(18CS403)
Course: B.Tech (CSE)

2nd Year, IV Semester

Subject: DBMS

Code: 18CS403

AAT-3

1. In a ____________, as index entity appear for only some of the search key values.
(0.5 Points)

sparse

dense

primary

none

2. B-tree of order n is a order-n multiway tree in which each non-root node contains
__________
(0.5 Points)

at most (n – 1)/2 keys

exact (n – 1)/2 keys

at least 2n keys

at least (n – 1)/2 keys

https://forms.office.com/Pages/ResponsePage.aspx?id=pDcHlUcpzkacU0co8B_VmCfuwFkTU4lMucVup2iPI0RUOTlRUUE5Nko4VkQ0UDlRWDBJOU… 1/8
21/06/2021 2/4 B.Tech (CSE) 4th Semester, AAT-3 DBMS(18CS403)

3. which of the following is designed to cope with 4NF.

(0.5 Points)

multi value dependency

join dependency

Transitive dependency

none of these

4. In which normal form conversion of composite attribute to individual attribute

happens
(0.5 Points)

first

second

third

four

5. An index is clustered, if
(0.5 Points)

it is on a set of fields that form a candidate key.

it is on a set of fields that include the primary key.

the data records of the file are organized in the same order as the data entries of the
index.

the data records of the file are organized not in the same order as the data entries of the
index.

https://forms.office.com/Pages/ResponsePage.aspx?id=pDcHlUcpzkacU0co8B_VmCfuwFkTU4lMucVup2iPI0RUOTlRUUE5Nko4VkQ0UDlRWDBJOU… 2/8
21/06/2021 2/4 B.Tech (CSE) 4th Semester, AAT-3 DBMS(18CS403)

6. Suppose relation R(A,B,C,D,E) has the following functional dependencies:

A -> B

B -> C
BC -> A

A -> D

E -> A

D -> E

Which of the following is not a key?

(0.5 Points)

7. A file is organized so that the ordering of data records is the same as or close to
the ordering of data entries in some index. Then that index is called
(0.5 Points)

Dense

Sparse

Clustered

Unclustered

8. attribute in a relation is a foreign key if the _______ key from one relation is used
as

an attribute in that relation .

(0.5 Points)

Candidate

Primary

Super

https://forms.office.com/Pages/ResponsePage.aspx?id=pDcHlUcpzkacU0co8B_VmCfuwFkTU4lMucVup2iPI0RUOTlRUUE5Nko4VkQ0UDlRWDBJOU… 3/8
21/06/2021 2/4 B.Tech (CSE) 4th Semester, AAT-3 DBMS(18CS403)

Sub

9. In a B+ tree, both the internal nodes and the leaves have keys.
(0.5 Points)

True

False

10. Relation R is decomposed using a set of functional dependencies, F and relation S

is decomposed using another set of functional dependencies G. One
decomposition is definitely BCNF, the other is definitely 3NF, but it is not known
which is which. To make a guaranteed identification, which one of the following
tests should be used on the decompositions? (Assume that the closures of F and G
are available).
(0.5 Points)

Dependency-preservation

Lossless-join

BCNF definition

3NF definition

11. Mimimal super keys are called

(0.5 Points)

Candidate key

Primary key

Super key

unique key

https://forms.office.com/Pages/ResponsePage.aspx?id=pDcHlUcpzkacU0co8B_VmCfuwFkTU4lMucVup2iPI0RUOTlRUUE5Nko4VkQ0UDlRWDBJOU… 4/8
21/06/2021 2/4 B.Tech (CSE) 4th Semester, AAT-3 DBMS(18CS403)

12. Consider a B+-tree in which the maximum number of keys in a node is 5.

What is the minimum number of keys in any non-root node?

(0.5 Points)

13. In which index, the index record contain search key value and pointer to the first
data record with that search key value?
(0.5 Points)

Sparse

Cluster

Dense

Primary

14. Which of the following is TRUE?

(0.5 Points)

Every relation in 3NF is also in BCNF

A relation R is in 3NF if every non-prime attribute of R is fully functionally dependent on

every key of R

Every relation in BCNF is also in 3NF

No relation can be in both BCNF and 3NF

https://forms.office.com/Pages/ResponsePage.aspx?id=pDcHlUcpzkacU0co8B_VmCfuwFkTU4lMucVup2iPI0RUOTlRUUE5Nko4VkQ0UDlRWDBJOU… 5/8
21/06/2021 2/4 B.Tech (CSE) 4th Semester, AAT-3 DBMS(18CS403)

15. There are two functional dependencies with the same set of attributes on the left

side of the arrow:

A->BC

A->B

This can be combined as

(0.5 Points)

A->BC

A->B

B->C

None of the mentioned

16. A BCNF is :
(0.5 Points)

loss less join and dependency preserving

loss less join but not dependency preserving

not loss less join but dependency preserving

none of these

17. Relation R with an associated set of functional dependencies, F is decomposed

into BCNF. The redundancy (arising out of functional dependencies) in the
resulting set relations is.
(0.5 Points)

Zero

More than zero but less than that of an equivalent 3NF decomposition

Proportional to the size of F+

Indeterminate

https://forms.office.com/Pages/ResponsePage.aspx?id=pDcHlUcpzkacU0co8B_VmCfuwFkTU4lMucVup2iPI0RUOTlRUUE5Nko4VkQ0UDlRWDBJOU… 6/8
21/06/2021 2/4 B.Tech (CSE) 4th Semester, AAT-3 DBMS(18CS403)

18. In Terms of B-Trees

Statement 1: When a node is split during insertion, the middle key is promoted to
the parent as well as retained in right half-node.

Statement 2: When a key is deleted from the leaf, it is also deleted from the non-
leaf nodes of the tree.
(0.5 Points)

Statement 1 is true but statement 2 is false

Statement 2 is true but statement 1 is false

Both the statements are true

Both the statements are false

19. Which of the following is NOT a super key in a relational schema with attributes V,
W, X, Y, Z and candidate key V Y ?
(0.5 Points)

VXYZ

VWXZ

VWXY

VWXYZ

20. Which of the following is correct?

(0.5 Points)

B-trees are for storing data on disk and B+ trees are for main memory.

Range queries are faster on B+ trees.

B-trees are for primary indexes and B+ trees are for secondary indexes.

The height of a B+ tree is independent of the number of records.

https://forms.office.com/Pages/ResponsePage.aspx?id=pDcHlUcpzkacU0co8B_VmCfuwFkTU4lMucVup2iPI0RUOTlRUUE5Nko4VkQ0UDlRWDBJOU… 7/8
21/06/2021 2/4 B.Tech (CSE) 4th Semester, AAT-3 DBMS(18CS403)

This content is created by the owner of the form. The data you submit will be sent to the form owner. Microsoft is not
responsible for the privacy or security practices of its customers, including those of this form owner. Never give out your
password.

Powered by Microsoft Forms | Privacy and cookies | Terms of use

https://forms.office.com/Pages/ResponsePage.aspx?id=pDcHlUcpzkacU0co8B_VmCfuwFkTU4lMucVup2iPI0RUOTlRUUE5Nko4VkQ0UDlRWDBJOU… 8/8