Scribd
Upload
240 views

HASHING and RAID MCQ

The document discusses various topics related to databases and data structures, including different types of indexes used in databases, data allocation methods, hashing techniques, data organization, record searching methods, and definitions of terms related to hashing such as collisions and buckets. It also covers topics like RAID levels, disk striping, and technologies used for optical disks. The questions provide multiple choice answers about these database, data structure, and storage-related concepts.

Uploaded by

Shokry Mohamed
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
240 views

HASHING and RAID MCQ

The document discusses various topics related to databases and data structures, including different types of indexes used in databases, data allocation methods, hashing techniques, data organization, record searching methods, and definitions of terms related to hashing such as collisions and buckets. It also covers topics like RAID levels, disk striping, and technologies used for optical disks. The questions provide multiple choice answers about these database, data structure, and storage-related concepts.

Uploaded by

Shokry Mohamed
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

1) In database management system, the types of data structures used in indexes:

a) hash data structures


b) tree data structures
c) content and glossary structures
d) both a and b
Answer: (d)
2) The kind of allocation in which the file blocks contain the pointer to the next
blocks of file is classified as:
a) linked allocation(Chaining)
b) indexed allocation
c) header allocation
d) contiguous allocation
Answer: (a)
3) The hashing technique which allocates fixed number of buckets is classified as:
a) dynamic hashing
b) static hashing
c) external hashing
d) internal hashing
Answer: (c)
4) The type of data organization which does not allow cross block boundaries is:
a) unspanned organization
b) spanned organization
c) factor organization
d) indexed organization
Answer: (a)
5) 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
Answer: (c)
6) 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
Answer: (b)
7) The type of organization in which the records are inserted at the end of stored
file is classified as:
a) pile file
b) linear search file
c) relative file
d) external file
Answer: (a)
8) The command in DBMS software which is used to locate records that fulfills the
search condition is classified as:
a) Find All command
b) Find n
c) Find Ordered command
d) Reorganize command
Answer: (a)
9) 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:
a) Less than 1
b) Less than n
c) Less than m
d) Less than n/2
Answer: (a)
10) What is the best definition of a collision in a hash table?
a) Two entries are identical except for their keys
b) Two entries with different data have the exact same key
c) Two entries with different keys have the same exact hash value
Answer: (b)
11) Which of the following scenarios leads to linear running time for a random
search hit in a linear-probing hash table?
a) All keys hash to same index
b) All keys hash to different indices
c) All keys hash to an even-numbered index
Answer: (a)
12) The term ______ is used to denote a unit of storage that can store one or more
records
a) Basket
b) Bucket
c) Unit
d) Set
Answer: (b)
13) If K denotes the set of all the search key values, and B denotes the set of all
bucket addresses, a function from K to B is called as __________
a) Bucket function
b) Address function
c) Hash function
d) Search function
Answer: (c)
14) What is a bucket overflow?
a) When a bucket does not have enough space
b) There are insufficient buckets
c) When Bucket skew occurs
d) All of the mentioned
Answer: (d)
15) Overflow handling using a linked list of buckets is called as ____________
a) Bucket chaining
b) Overflow chaining
c) Bucket linking
d) Overflow linking
Answer: (b)
16) Which level of RAID refers to disk mirroring with block striping?
a) RAID level 1
b) RAID level 2
c) RAID level 0
d) RAID level 3
Answer: (a)
17) Optical disk technology uses:
a) Helical scanning
b) DAT
c) A laser beam
d) RAID
Answer: (d)
18) With multiple disks, we can improve the transfer rate as well by ___________
data across multiple disks
a) Striping
b) Dividing
c) Mirroring
d) Dividing
Answer: (a)
19) Which one of the following is a Stripping technique?
a) Byte level stripping
b) Raid level stripping
c) Disk level stripping
d) Block level stripping
Answer: (b)
20) Where performance and reliability are both important, RAID level ____ is used.
a) 0
b) 1
c) 2
d) 0+1
Answer: (d)
21) ___________ is popular for applications such as storage of log files in a
database system since it offers the best write performance.
a) RAID level 1
b) RAID level 2
c) RAID level 0
d) RAID level 3
Answer: (a)

You might also like