Scribd
Upload
20 views8 pages

QP On Indexing

Uploaded by

fahimahmed4286
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
20 views8 pages

QP On Indexing

Uploaded by

fahimahmed4286
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/ 8

QP

• If a system contains 1,000 disk drives, and each of them has a


6,00,000-hour MTBF (Mean time between failure), how often a
single drive failure will occur in that disk system?

• MTBF (array) = MTBF (one disk) / Number of disks in the array

• So, the answer is 600,000 / 1000 = 600 hrs

N.B: MTBF, or Mean Time Between Failures, is the estimated time it will
take for a device to fail.
QP
• What is the availability of a Database Management System having the
following reliability parameters?
• Mean Time Between Failure (MTBF) = 36 days
• Mean Time to Repair (MTTR) = 18 hours
• Availability = Total uptime / (total uptime + total downtime)=
MTBF/(MTBF+MTTR)*100= 36*24/(36*24 + 18) *100= 97.95
• Mean time between failures is not the average time that the system is
working and then fail. It is the average time between failures.
• Mean time between failures (MTBF) = total uptime / number of failures.
• Mean time to repair is the average time taken to repair the system after
failure. Mean time to repair (MTTR) = total down time/number of failures.
Seek time: It is the time required by read/write head to move from one track to other.

Rotational Latency: The time required by the read/write head to rotate to the requested sector from the current
position is called Rotational Latency.
QP
• Consider a disk pack with the following specifications: 16 double-sided
platters, 256 tracks per surface, 512 sectors per track and 1024 bytes per
sector. Which of the following is the correct capacity of disk
(approximately)?
QP
Suppose, there is a disk with 200 sectors per track, size of one sector is
512 bytes and one disk block unit is 4 kilobytes. What will be the access
time of a single block unit if its average seek time and rotational speed
is 6 ms, and 12000 RPM. respectively, assuming the data rate is 128
kilobytes per second?
HW

• Suppose you have a 64-gigabyte disk pack with the following


specifications: 32 double-sided platters, 1024 tracks per surface, and
512 sectors per track. What is the data size of one sector?
QP
• Consider there is a sequential file for the relation Customer. The record size is
fixed and the size of one record is 46 bytes. If the records do not cross block
boundaries, and the disk block is 512 bytes with the block pointer size 10 bytes
long, what is the maximum number of record scan be stored in one block?
• Size of one record is 46 bytes.
• Size of one block is = 512 bytes
• Size of block pointer is = 10 bytes
• available space to store data = 512 − 10 = 502
• Records do not cross block boundaries.
• Hence, maximum 502 ÷ 46 = 10 records can be stored in one block(Always take
the lower bound).
QP
• Consider the following information for a file organization: The size of one
record is 48 bytes. The size of the disk block pointer is 10 bytes. The size of
one disk block is 512 bytes. If organization of the file is sequential and
unspanned (one block can store only whole records), maximum how many
records can be stored in one block?
• The le organization is unspanned. So, one block can store N numbers of
whole records and one block pointer.
• One record size(V) = 48 bytes
• Disk block size = 512 bytes
• Disk block pointer (p) = 10 bytes
• Actual Storage size of one block = (512-10) =502 bytes
• N = 502/48 = 10
• So, maximum 10 records can be stored in a block.

You might also like