Database Management Systems Mcqs

Page No. 46

If h is any hashing function and is used to hash n keys in to a table of size m, where n<=m, the expected number of collisions involving a particular key x is :


aLess than 1

✓


bLess than n

✖


cLess than m

✖


dLess than n/2

✖


View Answer Less than 1

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


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

✖


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

✖


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

✓


dNone of the mentioned

✖



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


aLoading

✖


bBulk insertion

✖


cBulk loading

✓


dIncrease insertion

✖


View Answer Bulk loading

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


aLeaf node

✖


bExternal node

✖


cFinal node

✖


dInternal node

✓


View Answer Internal node

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


aSimple

✖


bComposite

✓


cCompound

✖


dSecondary

✖


View Answer Composite

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


aPointed index

✖


bSequential index

✖


cMultilevel index

✓


dMultiple index

✖


View Answer Multilevel index

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


aDense

✓


bSparse

✖


cStraight

✖


dContinuous

✖


View Answer Dense

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.


aDense

✓


bSparse

✖


cStraight

✖


dContinuous

✖


View Answer Dense

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


aIndex entry

✓


bIndex hash

✖


cIndex cluster

✖


dIndex map

✖


View Answer Index entry

Indices whose search key specifies an order different from the sequential order of the file are called ___________ indices.


aNonclustered

✖


bSecondary

✖


cAll of the mentioned

✓


dNone of the mentioned

✖


View Answer All of the mentioned

Goto Page No.

Page 46 of 101

Alphabetical MCQs Categories
—

Here below You find all kind of categories of MCQs in alphabetical order.


"Comprehensive Collection of MCQs: Alphabetically Organized by Subject"
—

"Discover an extensive collection of multiple-choice questions (MCQs) neatly categorized by subject from A to Z. This resource is designed for anyone eager to explore various topics in a straightforward and organized manner. Whether you're a student preparing for exams, an educator seeking supplementary materials, or simply curious about different subjects, this compilation offers a convenient way to learn and assess your knowledge. With questions arranged alphabetically, navigation is effortless, allowing you to delve into subjects of interest at your own pace. Engage, learn, and expand your understanding with this accessible and comprehensive repository of MCQs!"


BolPakistan

bolpakistan.com.pk includes Job Mcqs and Pak Mcqs is the Top Largest Mcqs Forum in World, in which you can read Mcqs of All Subjects, PPSC test preparation, FPSC, NTS and PPSC PAST PAPERS, PPSC PAST MCQS. A Collection of Repeated MCQs for JOBs seekers.

Copyright © 2024, Designed & Developed by BolPakistan