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 11 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

Q101.

Which of the following operations can be performed on an extendable hash structure?

Lookup

Insertion

Deletion

All of the mentioned

Discuss

Answer: (d).All of the mentioned

Q102.

The space overhead in dynamic hashing is ________ than that of static hashing

Less

Equal

None of the mentioned

Discuss

Answer: (b).Less

Q103.

Which of the following is a disadvantage of the dynamic hashing structure

Buckets can be allocated dynamically

Lookup involves additional level of indirection

It involves a lesser space overhead

Hash structure can be modified dynamically

Discuss

Answer: (b).Lookup involves additional level of indirection

Q104.

The form of dynamic hashing that avoids the additional level of indirection is called as _________

Linear hashing

Static hashing

Directive hashing

Indirective hashing

Discuss

Answer: (a).Linear hashing

Q105.

Hash structures are not the best choice for which of the following?

A search key on which individual point queries are likely

A search key which is invalid

A search key on which range queries are likely

A search key on which multi-level queries are likely

Discuss

Answer: (c).A search key on which range queries are likely

Q106.

Which of the following is an issue that needs to be considered while choosing an indexing technique?

Frequency of insertion and deletion

Data types of the data

Number of items in the relation

None of the mentioned

Discuss

Answer: (a).Frequency of insertion and deletion

Q107.

Which of the following hash function classifies data into least number of buckets?

Sum of digits modulo 8

Sum of digits modulo 5

Sum of digits modulo 2

Sum of digits

Discuss

Answer: (a).Sum of digits modulo 8

Q108.

Which of the following hash function classifies data into the highest number of buckets ?

Sum of digits modulo 8

Sum of digits modulo 5

Sum of digits modulo 2

Sum of digits

Discuss

Answer: (d).Sum of digits

Q109.

A bitmap is _______

An array of bits

An index of bits

A function mapping all the bits of data

None of the mentioned

Discuss

Answer: (a).An array of bits

Q110.

A _________ on the attribute A of relation r consists of one bitmap for each value that A can take

Bitmap array

Bitmap index

Bitmap excess

Bitmap

Discuss

Answer: (b).Bitmap index

Page 11 of 15

Welcome to the Indexing and Hashing MCQs Page

Indexing and Hashing MCQs | Page 11 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

DBMS

Embedded Systems

Formal Languages and Automata Theory

CSS

Web Technologies

UNIX

Python

Systems Programming

Software Architecture and Design