Data Base Management System | NPTEL 2022 | Week 6 Assignment Solutions

This set of MCQ(multiple choice questions) focuses on the Data Base Management System week 6 Solutions.

The course introduces relational data models; entity-relationship modeling, SQL, data normalization, and database design. Further it introduces query coding practices using MySQL (or any other open system) through various assignments. Design of simple multi-tier client / server architectures based and Web-based database applications is also introduced.

Course layout (Answers link)

Answers COMING SOON! Kindly Wait!

NOTE: You can check your answer immediately by clicking show answer button. Data Base Management System week 6 Solutions” contains 10 questions.

Now, start attempting the quiz.

Data Base Management System week 6 Solutions

Q1. Consider the following table. If we create an index on CON_ID column, which type of indexing is preferred?

a) Clustering index
b) Dense index
c) Secondary index
d) Sparse index

Show Answer

Data Base Management System week 6 Solutions

Q2. Consider the following B+ tree:
Which of the following statement(s) is/are not valid for the given tree?

a) Leaf nodes must have between 4 and 7 values
b) Non-leaf nodes other than root must have between 4 and 8 children
c) Root must have at least 2 children
d) Some leaf nodes may be empty

Show Answer

Q3. Consider the following 2-3-4 Tree:
How many comparisons are required to find 10 from the tree?

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

Show Answer

Data Base Management System week 6 Solutions

Q4. Identify the correct hash function used in the following hash table:

a) (ID) % 3
b) (Sum of digits of ID) % 8
c) (Sum of digits of ID) % 4
d) (Product of digits of ID) % 3

Show Answer

Q5. A 2-3-4-tree, can store a maximum 4095 number of keys. What will be the minimum height of the tree? The height of the root node is assumed to be zero.

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

Show Answer

Q6. Consider the following right biased B+ tree.
Inserting 85 into this will result in which of the following trees?

Show Answer

Data Base Management System week 6 Solutions

Q7. Consider the extendable hashing on a file that contains records with the search-key values:
11, 21, 23, 31, 34, 35, 49, 53, 55, 59
Choose the incorrect statement(s) based on the above hash structure.

a) For inserting key 18, a new bucket needs to be allocated
b) h(x) = x mod 8, where h(x) is a hash function
c) The bucket can be removed if we delete key 34
d) In extendable hashing, performance will not degrade with the growth of the file

Show Answer

Q8. Suppose a database management system uses dense indexing. Suppose thawt 128 blocks are required to store a database file and its index file. How many records does the database file contain? Given that one memory block of the disk can store either 48 key pointers or 16 whole records.

a) 1024
b) 1536
c) 2048
d) 4096

Show Answer

Q9. Consider the following table:
What are the Bitmap indices of Paper ‘Data Structure’ and Type ‘Sessional’?

a) 01001 and 11001
b) 01100 and 10011
c) 10011 and 11001
d) 01100 and 00110

Show Answer

Data Base Management System week 6 Solutions

Q10. Identify the correct SQL query to create Bitmap index on attribute Type on the following table Course

a) CREATE BITMAP INDEX CType on Course(Type)
b) CREATE BITMAP INDEX CType on Type(Course)
c) CREATE BITMAP CType on Course(Type)
d) CREATE INDEX CType on Type(Course)

Show Answer

Previous year – Data Base Management System week 6 Solutions

Q1. 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

Show Answer

Data Base Management System week 6 Solutions

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

a) Sequential scan using a primary index is inefficient.
b) Sequential scan using a secondary index is expensive.
c) Secondary indices must be dense index.
d) In Multilevel indexing, a sparse index of the primary index will be created in the inner index.

Show Answer

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

Show Answer

Data Base Management System week 6 Solutions

Q4.

Show Answer

Q5.

Show Answer

Data Base Management System week 6 Solutions

Q6.

Show Answer

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.

Show Answer

Data Base Management System week 6 Solutions

Q8. The order of an internal node in a B⁺ 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.

a) 29
b) 30
c) 51
d) 64

Show Answer

Data Base Management System week 6 Solutions

Q9.

Show Answer

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?

a) 16
b) 8
c) 4
d) 2

Show Answer

Data Base Management System week 6 Solutions

<< Prev- Data Base Management System Week 5 Assignment Solutions

>> Next- Data Base Management System Week 7 Assignment Solutions

---

DISCLAIMER: Use these answers only for the reference purpose. Quizermania doesn't claim these answers to be 100% correct. So, make sure you submit your assignments on the basis of your knowledge.

For discussion about any question, join the below comment section. And get the solution of your query. Also, try to share your thoughts about the topics covered in this particular quiz.