Scribd
Upload
17 views8 pages

Database Management System Homework Help

Uploaded by

Database Homework Help
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
17 views8 pages

Database Management System Homework Help

Uploaded by

Database Homework Help
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 8

For any help with Homework Help related queries Call us at- +1 678 648 4277

You can mail us at- [email protected]


reach us at:- www.databasehomeworkhelp.com/

Database Management System Homework Help


Ql. Choose the correct statement about indexing from the
following options.

a) A database file can have multiple clustered indexes


b) A database file can have only one clustered index with
multiple secondary indexes
c) A database file can have multiple primary indexes
d) A database file can have both a primary index and a
clustered index

Answer: b)

Q2. Choose the incorrect statement(s) from the following


options.

e) Sequential scan using a primary index is inefficient.


f) Sequential scan using a secondary index is expensive.
g) Secondary indices must be dense index.
h) In Multilevel indexing, a sparse index of the primary index
will be created in the inner index.

Answer: a), d)
Q3. A database file is indexed by hashing with bucket size
100. The hash function is: H(key) - (key/11)%100. Compute
the location, where the key k = 17193 will be placed.

a) 15
b) 54
c) 63
d) 93

Answer: c)

Q4. Consider the extendable hashing on a file that contains


records with the search-key values:
13, 18, 19, 23, 27, 39, 45, 47, 51, 57
Choose the Incorrect statement(s) based on the above
hash structure.

a) The bucket can be removed if we delete key 18.


b) h(x) x mod 8, where h(x) Is a hash function.
c) In extendable hashing, performance will not degrade
with the growth of the file.
d) For Inserting key 26, a new bucket needs to be
allocated.

Answer: d)
Q5. Which of the following option(s) is/are true for 2-3-4
trees?

Answer: a), c)
Q5. Consider the following 2 — 3 — 4 tree, in which each
data item is inserted in the alphabetical order of letters.

If we insert A into the above tree, what will be the total


number of leaf nodes in the resultant tree.

a) 6
b) 5
c) 4
d) 3

Answer: a)
Q7. Which of the following options is correct for a B'' tree of
order n?

a) A leaf node has between [n/2] and [(n-1)/2] keys.


b) A leaf node has between [n/2-1] and n keys.
c) A leaf node has between [(n-1)/2] and n-1 keys.
d) A leaf node has between n and n-1 keys.

Answer: c)

Q8. The order of an internal node in a 13* tree index is the


maximum number of children it can have. Suppose that a
child pointer takes 8 bytes, the search key field value takes 10
bytes, and the block size is 512 bytes. Identify the order of
the internal node.

e) 29
f) 30
g) 51
h) 64

Answer: a)
Q9. Consider the following Customer relation.

Consider the bitmap ndex for Age, with A1, A2, A3 and A4
representing the bitmaps for Age intervals.

Answer: a)
Choose the incorrect option(s) based on the above.

a) An is a bitmap Index for Age below 40.


b) A2 is a bitmap Index for Age 40 to below 60.
c) A3 Is a bitmap index for Age 25 to below 50.
d) A4 Is a bitmap Index for Age 30 and above.

Answer: a), b)

Q10. Consider there is a relational table Product(pID,


pName, type price). There is a bitmap index file on type
of the Product. The size of the index file is 1 KB. If there
are 512 rows in the Product table, how many different
types of Products are there?

e) 16
f) 8
g) 4
h) 2

Answer: a)

You might also like