Database Management Systems Mcqs

Page No. 45

A(n) _________ can be used to preserve the integrity of a document or a message.


aMessage digest


bMessage summary


cEncrypted message


dNone of the mentioned


View Answer Encrypted message

Breadth First Search is used in


aBinary trees


bStacks


cGraphs


dAll of the mentioned


View Answer Graphs

Which of the following scenarios leads to linear running time for a random search hit in a linear-probing hash table?


aAll keys hash to same index


bAll keys hash to different indices


cAll keys hash to an even-numbered index


dAll keys hash to different even-numbered indices



What is the best definition of a collision in a hash table?


aTwo entries are identical except for their keys


bTwo entries with different data have the exact same key


cTwo entries with different keys have the same exact hash value


dTwo entries with the exact same key have different hash values



Key value pairs is usually seen in


aHash tables


bHeaps


cBoth Hash tables and Heaps


dSkip list


View Answer Hash tables

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


a0.1


b0.6


c0.2


d0.5


View Answer 0.6

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.


a8, _, _, _, _, _, 10


b1, 8, 10, _, _, _, 3


c1, _, _, _, _, _,3


d1, 10, 8, _, _, _, 3


View Answer 1, 8, 10, _, _, _, 3

The goal of hashing is to produce a search that takes


aO(1) time


bO(n2 )time


cO(log n ) time


dO(n log n ) time


View Answer O(1) time

The searching technique that takes O (1) time to find a data is


aLinear Search


bBinary Search


cHashing


dTree Search


View Answer Hashing

A technique for direct search is


aBinary Search


bLinear Search


cTree Search


dHashing


View Answer Hashing

Goto Page No.

Page 45 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