Bissoy.com
Doctors Medicines MCQs Q&A

In a __________ , we obtain the address of the disk block containing a desired record directly by computing a function on the search key value of the record

In a __________ , we obtain the address of the disk block containing a desired record directly by computing a function on the search key value of the record Correct Answer Hash file organization

Hashing can be used for 2 different purposes, hash file organization and hash index organization. In a Hash file organization, we obtain the address of the disk block containing a desired record directly by computing a function on the search key value of the record.

Related Questions

If a relation can have more than one record containing the same search key value, the search key is said to be a __________
Suppose you have a Linux file system where the block size is 2K bytes, a disk address is 32 bits, and an i-node contains the disk addresses of the first 12 direct blocks of file, a single indirect block, and a double indirect block. Approximately, what is the largest file that can be represented by an i-node?  
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.
Before a disk drive can access any sector record, a computer program has to provide the record's disk address. What information does this address specify?
Pyroxenes are class of silicate minerals, which exhibit a polymeric chain structure, as shown below
S-Block and P-Block Elements mcq question image
Its simplest repeating unit is
Public key encryption uses multiple keys.ne key is used to encrypt data, while another is used to decrypt data.he key used to encrypt data is called the _______ key, while the key used to decrypt data is called the ________ key.
Let disk request come to a disk driver for cylinders in the order 10, 22, 20, 2, 40, 6 and 38, at the time when the disk driver is reading from cylinder 20. If the seek time is 6 ms per cylinder, then the total seek time for the disk arm scheduling time algorithm (FCFS - First Come First Serve) is:
Disk requests come to a disk driver for cylinders in the order 10, 22, 20, 2, 40, 6 and 38, at a time when the disk drive is reading from cylinder 20. The seek time is 6 ms/cylinder. The total seek time, if the disk arm scheduling algorithms is first-come-first-served is
Consider a disk system having 60 cylinders. Disk requests are received by a disk drive for cylinders 10, 22, 20, 2, 40, 6, and 38, in that order. Assuming the disk head is currently at cylinder 20, what is the time taken to satisfy all the requests if it takes 2 milliseconds to move from one cylinder to an adjacent one and Shortest Seek Time First (SSTF) algorithm is used ?
The disk system consists of which of the following? i. Disk ii. Disk drive iii. Disk controller