Welcome to the Indexing and Hashing MCQs Page

Dive deep into the fascinating world of Indexing and Hashing with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Indexing and Hashing, a crucial aspect of DBMS. In this section, you will encounter a diverse range of MCQs that cover various aspects of Indexing and Hashing, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within DBMS.

Check out the MCQs below to embark on an enriching journey through Indexing and Hashing. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of DBMS.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Indexing and Hashing. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

Indexing and Hashing MCQs | Page 13 of 15

Explore more Topics under DBMS

01

DBMS Basics

02

Data Models

03

The Entity Relationship Approach

04

Relational Databases

05

Data Storage and Querying

06

Relational Algebra

07

Normalization

08

Storage and File Structures

09

Transactions

10

Concurrency Control

11

Recovery System

12

Distributed Databases

13

SQL

14

Data Warehousing and Data Mining

15

RDBMS

16

Advanced SQL

17

SQL Queries,Constraints and Triggers

Q121.

An ____________ consists of a search-key value and pointers to one or more records with that value as their search-key value.

Index entry

Index hash

Index cluster

Index map

Discuss

Answer: (a).Index entry

Q122.

In a _______ clustering index, the index record contains the search-key value and a pointer to the first data record with that search-key value and the rest of the records will be in the sequential pointers.

Dense

Sparse

Straight

Continuous

Discuss

Answer: (a).Dense

Q123.

In a __________ index, an index entry appears for only some of the search-key values.

Dense

Sparse

Straight

Continuous

Discuss

Answer: (a).Dense

Q124.

Incase the indices values are larger, index is created for these values of index. This is called

Pointed index

Sequential index

Multilevel index

Multiple index

Discuss

Answer: (c).Multilevel index

Q125.

A search key containing more than one attribute is referred to as a _________ search key.

Simple

Composite

Compound

Secondary

Discuss

Answer: (b).Composite

Q126.

In B+ tree the node which points to another node is called

Leaf node

External node

Final node

Internal node

Discuss

Answer: (d).Internal node

Q127.

Insertion of a large number of entries at a time into an index is referred to as __________ of the index.

Bulk insertion

Bulk loading

Increase insertion

Discuss

Answer: (c).Bulk loading

Q128.

While inserting the record into the index, if the search-key value does not appear in the index.

The system adds a pointer to the new record in the index entry

The system places the record being inserted after the other records with the same search-key values

The system inserts an index entry with the search-key value in the index at the appropriate position

None of the mentioned

Discuss

Answer: (c).The system inserts an index entry with the search-key value in the index at the appropriate position

Q129.

Consider a hash table of size seven, with starting index zero, and a hash function (3x + 4)mod7. Assuming the hash table is initially empty, which of the following is the contents of the table when the sequence 1, 3, 8, 10 is inserted into the table using closed hashing? Note that ‘_’ denotes an empty location in the table.

8, _, _, _, _, _, 10

1, 8, 10, _, _, _, 3

1, _, _, _, _, _,3

1, 10, 8, _, _, _, 3

Discuss

Answer: (b).1, 8, 10, _, _, _, 3

Q130.

A hash table can store a maximum of 10 records, currently there are records in location 1, 3,4,7,8,9,10. The probability of a new record going into location 2, with hash functions resolving collisions by linear probing is

0.1

0.6

0.2

0.5

Discuss

Answer: (b).0.6

Page 13 of 15

Welcome to the Indexing and Hashing MCQs Page

Indexing and Hashing MCQs | Page 13 of 15

Explore more Topics under DBMS

DBMS Basics

Data Models

The Entity Relationship Approach

Relational Databases

Data Storage and Querying

Relational Algebra

Normalization

Storage and File Structures

Transactions

Concurrency Control

Recovery System

Distributed Databases

SQL

Data Warehousing and Data Mining

RDBMS

Advanced SQL

SQL Queries,Constraints and Triggers

Suggested Topics

Computer Graphics

C# programming

UNIX

Wireless and Mobile Communications

Data Science

R Programming

JavaScript

Computer Hardware

Digital Communication