adplus-dvertising
frame-decoration

Question

The record searching technique in which the searching of records is done by block by block is classified as

a.

heap search

b.

non linear search

c.

linear search

d.

relative search

Answer: (c).linear search

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. The record searching technique in which the searching of records is done by block by block is classified as

Similar Questions

Discover Related MCQs

Q. In the disk packs, the tracks are divided into smaller block of information containing large amount of information called

Q. In high level programs, the command which is used to prepare the file for writing and reading is classified as

Q. The technique of writing data on two physical disks and treating both disks as one logical disk unit is classified as

Q. Considering storage capacity, the one billion bytes of data are equal to

Q. The circles in a disk in which the information is stored are called

Q. The files in which the updates are performed rarely are classified as

Q. If the file load factor is 0.6, blocking factor is 25 and the number of file buckets are 5 then the current number of records are

Q. If the global depth in extendible hashing is equal to local depth then the operation must be performed in directory array is

Q. In external hashing for files of disk, the pointers which contain record position and block address within the block are classified as

Q. The technique which involves the arithmetic function or logical function is classified as

Q. The temporary unordered file is also called

Q. In high level programs, the command which is used to copy the current record from buffer to variable of user program is classified as

Q. In disks, the tracks having same diameter on different surfaces are classified as

Q. In high level programs, the command which sets the pointer of file to the beginning of that file is classified as

Q. The time required to position write or read track on correct place is classified as

Q. Considering storage capacity, the 2000 bytes of data are equal to

Q. Statement 1: Cache storage is very fast
Statement 2: Cache storage is very cheap

Q. What is the difference between flash memory and main memory?

Q. What is the full form of USB?

Q. DVD is a form of ______ storage