Nptel Database Management System Assignment 6 Answers
Are you looking for the Nptel Database Management System Assignment 6 Answers? You’ve come to the right place! Our detailed and accurate solutions are designed to assist you in mastering the concepts of DBMS, including SQL queries, database design, normalization, and more.
Nptel Database Management System Assignment 6 Answers
Nptel Database Management System Assignment 6 Answers (July-Dec 2024)
Q1. Identify the incorrect statement(s) from the following. a) In primary index, index entries can be stored in unsorted order of the search key value. b) In a secondary inde file, all the search key values must be presented. c) A clustered index is built by default on any sorted valued columns. d) Sequential scan using a secondary index is expensive.
Answer: a) In primary index, index entries can be stored in unsorted order of the search key value. c) A clustered index is built by default on any sorted valued columns.
Q2.Which of the splitting rule is not correct in respect of 2-3-4 Tree?
These are Nptel Database Management System Assignment 6 Answers
Q3.Consider a system that uses B+ tree for indexing its records. Calculate the order of a non-leaf node, if the block size is 2 kilobytes, size of the search key field is 10 bytes, and the block pointer size is 18 bytes?
a) 44
b) 73
c) 113
d) 204
Answer: b) 73
Q4. A hash table contains 10 (indices 0 to 9) buckets and uses linear probing to resolve collisions. The key values are integers and the hash function used is (key % 10). Given the follow- ing input (543, 432, 741, 330, 471, 351, 170, 245), which of the following statement(s) is/are true?
a) 245 is stored in bucket 5.
b) 741, 471, 351 are stored in buckets 1, 4, and 5.
c) 432, 543 are stored in buckets 2 and 3.
d) 170 is stored in bucket 4.
Answer: b) 741, 471, 351 are stored in buckets 1, 4, and 5.
These are Nptel Database Management System Assignment 6 Answers
Q5.Suppose, there is a DBMS file with size 16 kilobytes. Calculate the size of the index table, if the size of one record is 64 bytes long which includes 10 bytes key field assuming the system uses primary indexing and the record pointer is 48-bit long?
For searching 34, how many comparisons will be required ? a) 11 b) 7 c) 4 d) 3
Answer: d) 3
Q8.See the following B+ tree. Find the minimum number of nodes (including the root node) that must be fetched in order to satisfy the following query: “Find all the records greater than 5 and less than 17”
Q9.Consider a shop maintained a relation Order (Order No, ItemID, Quantity) for storing or- der information. We have created a bitmap index on Order table and the size of the index file is 512 bytes for 256 number of rows. How many different types of items are availble in the shop assuming ItemID as the index column?
a) 16
b) 8
c) 4
d) 2
Answer: a) 16
Q10.Consider the following OrderTable: For the Order Table table, assume that there are 10 salesmen, and each salesman is associated with a minimum of 500 orders. Suppose OrderTable is commonly queried as: SELECT * FROM OrderTable WHERE Orderno = ‘XXXX’ AND salesman.id = Y; For speeding up the execution of queries, it is decided to create an index on the table. Which of the following query will create such an index? a) CREATE INDEX ind Order ON Order(Order.no); b) CREATE INDEX ind Order ON Order(salesman id); c) CREATE INDEX ind Order ON Order(Order.no, salesman.id); d) CREATE MULTI INDEX ind Order ON Order(Order_no, salesman id);
Answer: c) CREATE INDEX ind Order ON Order(Order.no, salesman.id);
For answers or latest updates join our telegram channel: Click here to join
All Weeks of Database Management System: Click here
For answers to additional Nptel courses, please refer to this link: Check here
For answers or latest updates join our telegram channel: Click here to join
These are Data Base Management System Week 6 nptel Answers
Q1. Choose the incorrect option(s) about the indexing. a) There can be many clustering indices. b) There can be at most one secondary index. c) It is preferable to use a dense index when the file is not sorted on the indexed field. d) Dense index is preferred over sparse index when a file is small compared to the size of memory.
Answer: a, b
Q2. Consider the following 2-3-4 tree, in which each data item is inserted in the alphabetical order of letters. If we insert G into the above tree, what will be the total number of nodes in the resultant tree. a) 5 b) 6 c) 7 d) 8
Answer: d) 8
For answers or latest updates join our telegram channel: Click here to join
These are Data Base Management System Week 6 nptel Answers
Q3. Consider the following B+ tree: What will be the correct B+ tree after the insertion of key 56? a) b) c) d)
Answer: d)
Q4. Consider a file of 50000 records. Each record is 40 bytes long and its key field is of size 4 bytes. The size of the memory is 512 KB. 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 results for accessing a record? a) Primary indexing b) Multilevel indexing c) Secondary indexing d) Clustering indexing
Answer: b) Multilevel indexing
For answers or latest updates join our telegram channel: Click here to join
These are Data Base Management System Week 6 nptel Answers
Q5. Consider a hash table with 8 slots. The hash function is h(X) = X mod 8. The collisions are resolved by chaining. Find out the maximum, minimum, and average chain lengths in the hash table. If the keys are inserted in the following order: 3, 18, 29, 25, 30, 43, 52, 67, 70. a) 3, 0, and 1 b) 3, 1, and 2 c) 4, 0, and 1 d) 4, 0, and 2
Answer: a) 3, 0, and 1
For answers or latest updates join our telegram channel: Click here to join
These are Data Base Management System Week 6 nptel Answers
Q6. In a B+ tree, size of a node is generally the same as that of a disk block. Suppose that the size of a block is 2 kilobytes. One index entry is 32 bytes long. What will be the height of the tree of a file with 1 million search key values? a) 6 b) 5 c) 4 d) 3
Answer: c) 4
For answers or latest updates join our telegram channel: Click here to join
Q7. There are five records in a database table. Which column is represented by the following bitmap index? a) Sid b) Sname c) Course d) Teacher
Answer: c) Course
For answers or latest updates join our telegram channel: Click here to join
These are Data Base Management System Week 6 nptel Answers
Q8. There are five records in a Student table. Identify the correct SQL query to create a bitmap index on Teacher attribute for the ta- ble Student. a) CREATE BITMAP INDEX bm_teacher ON Student (Teacher); b) CREATE BITMAP INDEX bm_teacher ON Teacher (Student); c) CREATE BITMAP bm_teacher ON Teacher (Student); d) CREATE INDEX(BITMAP) bm_teacher ON Student (Teacher);
Answer: a) CREATE BITMAP INDEX bm_teacher ON Student (Teacher);
For answers or latest updates join our telegram channel: Click here to join
Q9. Suppose that one block in a disk can store either 25 records or 40 key pointers. If a database contains 5000 records, how many blocks do we need to store the data file and the dense index? a) 400 b) 325 c) 200 d) 125
Answer: b) 325
For answers or latest updates join our telegram channel: Click here to join
These are Nptel Database Management System Assignment 6 Answers
Q10. In a file system records are arranged with hashing using the hash function: H(2) Round(x÷7)%100, where az is the key. In which location, key x= 42651 will be placed? a) 93 b) 60 c) 51 d) 42
Answer: a) 93
For answers or latest updates join our telegram channel: Click here to join
These are Data Base Management System Week 6 Assignment Answers
