adplus-dvertising

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.

frame-decoration

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 4 of 15

Explore more Topics under DBMS

Q31.
The kind of allocation in which the file blocks contain the pointer to the next blocks of file is classified as

a.

linked allocation

b.

indexed allocation

c.

header allocation

d.

contiguous allocation

Discuss
Answer: (a).linked allocation
Q32.
The hashing technique which allocates fixed number of buckets is classified as

a.

dynamic hashing

b.

static hashing

c.

external hashing

d.

internal hashing

Discuss
Answer: (c).external hashing
Q33.
The hashing technique which allows increase or decrease in number of buckets without a need of directory is classified as

a.

global depth hashing

b.

linear hashing

c.

relative hashing

d.

local depth hashing

Discuss
Answer: (b).linear hashing
Q34.
In linear hashing, the formula used to calculate number of records if the blocking factor, loading factor and file buckets are known is as

a.

r =l + bfr + N

b.

r =l - bfr - N

c.

r =l + bfr - N

d.

r =l * bfr * N

Discuss
Answer: (d).r =l * bfr * N
Q35.
The type of data organization which does not allow cross block boundaries is called

a.

unspanned organization

b.

spanned organization

c.

factor organization

d.

indexed organization

Discuss
Answer: (a).unspanned organization
Q36.
If the global depth is more than local depth then the operation must be performed in directory array is

a.

adding

b.

subtracting

c.

halving

d.

doubling

Discuss
Answer: (c).halving
Q37.
In extendible hashing array of bucket addresses 2d then d is considered as

a.

global depth

b.

global width

c.

global length

d.

global multiplier

Discuss
Answer: (a).global depth
Q38.
The open addressing, multiple hashing and chaining are all the methods used for

a.

multiple hashing resolution

b.

chaining resolution

c.

collision resolution

d.

address space resolution

Discuss
Answer: (c).collision resolution
Q39.
The record searching technique which is based on the blocks rather than records is called

a.

tertiary search

b.

binary search

c.

ordinary search

d.

ternary search

Discuss
Answer: (b).binary search
Q40.
The additional access path added into ordered file is called

a.

ternary index

b.

tertiary index

c.

primary index

d.

secondary index

Discuss
Answer: (c).primary index
Page 4 of 15

Suggested Topics

Are you eager to expand your knowledge beyond DBMS? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!

Java Programming

Level up your coding skills with our Java Programming MCQs. From object-oriented...

Management Information Systems

Discover how businesses leverage technology with our Management Information Systems...

JavaScript

Strengthen your web development skills with our JavaScript MCQs. Understand core...

MySQL Database

Enhance your knowledge of relational databases with our MySQL MCQs. Understand...

SQL Server

Master Microsoft's database server with our SQL Server MCQs. Topics cover database...

Cryptography and Network Security

Secure your knowledge of information security with our Cryptography and Network...

Object Oriented Programming

Enhance your coding skills with our Object Oriented Programming MCQs. Understand...

Data Structures and Algorithms

Journey through the fundamentals of Data Structures and Algorithms with our extensive...

Visual Basic

Enhance your knowledge of Microsoft's event-driven programming language with our...