NPTEL Data Base Management System Assignment 6 Answers 2023

Hello Learners, In this Post, you will find NPTEL Data Base Management System Assignment 6 Week 6 Answers 2023. All the Answers are provided below to help the students as a reference don’t straight away look for the solutions.

NPTEL Data Base Management System Assignment 6 Answers Join Group👇

CLICK HERE

Note: First try to solve the questions by yourself. If you find any difficulty, then look for the solutions.

NPTEL Data Base Management System Assignment 6 Answers 2023:

We are updating answers soon Join Group for update: CLICK HERE

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

• a
• b
• c
• d

Q.2. 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

Q.3. 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.

NPTEL Data Base Management System Assignment 7 Answers Join Group👇

Q.4. 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

Q.5. 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

Q.6. 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

Q.7. 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);

NPTEL Data Base Management System Week 6 Answers Join Group👇

CLICK HERE

Q.8. 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

Q.9. 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:

Identify the correct option that must be represented by J4

• a) Analyst
• b) HR
• c) Engineer
• d) Manager

Q.10. Consider the following 2-3-4 tree:

What is the result of inserting 90 in the above tree?

• a
• b
• c
• d

NPTEL Data Base Management System Assignment 6 Answers Join Group👇

Disclaimer: This answer is provided by us only for discussion purpose if any answer will be getting wrong don’t blame us. If any doubt or suggestions regarding any question kindly comment. The solution is provided by Brokenprogrammers. This tutorial is only for Discussion and Learning purpose.

About NPTEL Data Base Management System Course:

Databases form the backbone of all major applications today – tightly or loosely coupled, intranet or internet based, financial, social, administrative, and so on. Structured Database Management Systems (DBMS) based on relational and other models have long formed the basis for such databases. Consequently, Oracle, Microsoft SQL Server, Sybase etc. have emerged as leading commercial systems while MySQL, PostgreSQL etc. lead in open source and free domain. NPTEL Data Base Management System Assignment 5 Answers

Course Layout:

• Week 1:Course Overview. Introduction to RDBMS 
• Week 2:Structured Query Language (SQL) 
• Week 3:Relational Algebra. Entity-Relationship Model 
• Week 4:Relational Database Design
• Week 5:Application Development. Case Studies. Storage and File Structure 
• Week 6:Indexing and Hashing. Query Processing
• Week 7: Query Optimization. Transactions (Serializability and Recoverability) 
• Week 8:Concurrency Control. Recovery Systems. Course Summarization.

CRITERIA TO GET A CERTIFICATE:

Average assignment score = 25% of average of best 8 assignments out of the total 12 assignments given in the course. (NPTEL Data Base Management System Assignment 5 Answers)
Exam score = 75% of the proctored certification exam score out of 100

Final score = Average assignment score + Exam score

YOU WILL BE ELIGIBLE FOR A CERTIFICATE ONLY IF AVERAGE ASSIGNMENT SCORE >=10/25 AND EXAM SCORE >= 30/75. If one of the 2 criteria is not met, you will not get the certificate even if the Final score >= 40/100.

If you have not registered for exam kindly register Through https://examform.nptel.ac.in/