Data Base Management System | Week 6

7 months ago

user

4 minutes

Course Name: Data Base Management System

Course Link: Click Here

These are Data Base Management System Week 6 Assignment Answers

Q1. Which of the splitting rule is incorrect in respect of 2-3-4 Trees?

a
b
c
d

Answer: b

These are Data Base Management System Week 6 Assignment Answers

Q2. Consider a file of 48000 records. Each record is 40 bytes long and its key field is of size 4 bytes. Size of the memory is 512 kilobytes. The disk block size is 512 bytes, and the size of a block address is 8 bytes. If we want to order the file on key field, which indexing technique gives better result for accessing a record?
a) Primary indexing
b) Secondary indexing
c) Clustering indexing
d) Multilevel indexing

Answer: c) Clustering indexing

These are Data Base Management System Week 6 Assignment Answers

Q3. Identify the correct properties of a B+ tree of order n.
a) A node that is a root but not a leaf, has at least n/2 children.
b) A leaf node has between 1 and (n — 1) values.
c) A node that is a root and leaf, can have between 0 and (n — 1) values.
d) All paths from root to leaf are of the same length.

Answer: d) All paths from root to leaf are of the same length.

These are Data Base Management System Week 6 Assignment Answers

Q4. A hash table of length 8 uses open addressing with hash function h(x) = x mod 6, and linear probing. The content of the table after inserting the six key values is as follows:

What will be the correct order of insertion of keys?
a) 22, 26, 19, 37, 45, 29
b) 26, 22, 37, 19, 45, 29
c) 45, 26, 22, 37, 19, 29
d) 29, 26, 22, 45, 37, 19

Answer: b) 26, 22, 37, 19, 45, 29

These are Data Base Management System Week 6 Assignment Answers

Q5. Suppose that one block in a disk can store either 6 records or 15 key pointers. If a database contains 1200 records, how many total number of blocks do we need to store the data file and the index file?
a) 280
b) 260
c) 200
d) 90

Answer: a) 280

Q6. In a file system records are arranged with hashing using the hash function H(k) and a hash table of size n = 100. If the key k = 135642 is placed in location 21 of the hash table. Assume that tere was no collision. Which of the following function is used as hash function H(k)?
a) Round(key / 8) % 100
b) (Sum of digits of key) % 70
c) (Product of digits of key) %50
d) (Key * 11) %35

Answer: c) (Product of digits of key) %50

These are Data Base Management System Week 6 Assignment Answers

Q7. There are five records in a CarPolicy table.

Identify the correct SQL query to create composite index on Age and Gender?
a) CREATE composite INDEX cp_age_gen
ON CarPolicy (Gender, Age); }
b) CREATE INDEX cp_gen_age
ON TABLE CarPolicy (Age, Gender);
c) CREATE INDEX cp_age_gen
ON CarPolicy (Gender, Age);
d) CREATE INDEXES cp_age_gen
ON CarPolicy (Gender, Age);

Answer: c) CREATE INDEX cp_age_gen
ON CarPolicy (Gender, Age);

These are Data Base Management System Week 6 Assignment Answers

Q8. Suppose, a system uses B+ tree indexing for storing its records. If the minimum size of one block is 780 bytes, the size of one key is 8 bytes, record pointer is 4 bytes, and one block pointer is 12 bytes long, what will be the order of a leaf node (maximum possible number of key value with record pointer pairs)?
a) 65
b) 64
c) 97
d) 195

Answer: d) 195

These are Data Base Management System Week 6 Assignment Answers

Q9. Consider the HealthPolicy Table.

Consider the bitmap index for the Job field, with J1, J2, J3, and J4 representing different jobs. If the bitmap index value of J1, J2 and J3 are as follows: