Explore topic-wise InterviewSolutions in .

This section includes InterviewSolutions, each offering curated multiple-choice questions to sharpen your knowledge and support exam preparation. Choose a topic below to get started.

1.

What is the full form of LRU (in buffer replacement strategy)?(a) Least Reactive User(b) Least Recently Used(c) Least Read URL(d) Lowest Reading UserI had been asked this question during an online interview.Origin of the question is Organization of Records in Files in section Storage and File Structure of RDBMS

Answer»

Correct option is (b) Least RECENTLY USED

Easy EXPLANATION: The full FORM of LRU is Least Recently Used. In this, the least recently used program is substituted by the new REQUEST.

2.

The subsystem responsible for the allocation of buffer space is called as _______(a) Buffer allocator(b) Buffer manager(c) Buffer enhancer(d) Buffer intermediaryThis question was addressed to me during an online interview.This intriguing question comes from Organization of Records in Files topic in section Storage and File Structure of RDBMS

Answer»

The correct OPTION is (b) Buffer manager

Best explanation: The subsystem responsible for the allocation of buffer space is called as buffer manager. PROGRAMS on the database MAKE requests to the buffer manager and it in in TURN allocates the buffer space.

3.

Which of the following need to be stored in the data dictionary?(a) Name of the relation(b) Domains and lengths of attributes(c) Integrity constraints(d) All of the mentionedThe question was asked in a national level competition.Asked question is from Organization of Records in Files topic in section Storage and File Structure of RDBMS

Answer»

The correct answer is (d) All of the mentioned

To elaborate: Name of the relation, Domains and LENGTHS of attributes and INTEGRITY constraints all MUST be stored in the DATA DICTIONARY.

4.

What is a multitable clustering file organization?(a) It stores related records of two or more relations in each block(b) It stores related data about the relations in each block(c) It links each and every block by introducing an external attribute(d) None of the mentionedI got this question during an interview.Origin of the question is Organization of Records in Files in chapter Storage and File Structure of RDBMS

Answer» CORRECT choice is (a) It stores related RECORDS of two or more relations in each BLOCK

Best EXPLANATION: A multitable clustering file organization stores the related records of two or more relations in each block. This allows us to read records that satisfy a join condition by using one block read.
5.

Data dictionary is also called as ________(a) Data log(b) System log(c) System catalog(d) System database logThis question was addressed to me at a job interview.I need to ask this question from Organization of Records in Files in portion Storage and File Structure of RDBMS

Answer»

The CORRECT CHOICE is (c) System catalog

Explanation: DATA dictionary is ALSO CALLED as System Catalog.

6.

Metadata about the relations are stored in ________(a) File header(b) Data dictionary(c) Data query(d) Data analyserThis question was posed to me during an online interview.The origin of the question is Organization of Records in Files in division Storage and File Structure of RDBMS

Answer»

Right option is (B) DATA DICTIONARY

The best I can explain: A relational SCHEMA needs to maintain data about the data called as metadata. Metadata about the relations is STORED in the Data dictionary.

7.

What is a search key in sequential file organization?(a) A number assigned to each record(b) Necessarily the primary key(c) Any attribute or a set of attributes(d) None of the mentionedThis question was addressed to me by my college professor while I was bunking the class.My query is from Organization of Records in Files topic in section Storage and File Structure of RDBMS

Answer»

The correct choice is (C) Any attribute or a set of attributes

Explanation: A SEARCH KEY in sequential file organization is any attribute or a set of attributes that need not be a primary key or even a SUPERKEY.

8.

What is hashing file organization?(a) Any record can be placed wherever there is a space for the record(b) Records are stored in a sequential order according to a search key(c) A hash function is computed on some attribute and that decides the block(d) None of the mentionedI had been asked this question in an online interview.My enquiry is from Organization of Records in Files topic in chapter Storage and File Structure of RDBMS

Answer»

The CORRECT choice is (c) A hash function is computed on some attribute and that decides the block

To explain: Hashing file organization means that a hash function is computed on some attribute and that decides the block. The RESULT of the hash function specifies which block of the file the RECORD should be placed in.

9.

What is sequential file organization?(a) Any record can be placed wherever there is a space for the record(b) Records are stored in a sequential order according to a search key(c) A hash function is computed on some attribute and that decides the block(d) None of the mentionedThe question was posed to me at a job interview.The question is from Organization of Records in Files in chapter Storage and File Structure of RDBMS

Answer»

Right option is (B) Records are stored in a sequential order according to a SEARCH key

For EXPLANATION: Sequential file ORGANIZATION MEANS that Records are stored in a sequential order according to a search key. The records are ordered.

10.

What is heap file organization?(a) Any record can be placed wherever there is a space for the record(b) Records are stored in a sequential order according to a search key(c) A hash function is computed on some attribute and that decides the block(d) None of the mentionedI got this question in homework.This intriguing question comes from Organization of Records in Files topic in section Storage and File Structure of RDBMS

Answer»

Right option is (a) Any record can be placed wherever there is a SPACE for the record

Easy EXPLANATION: HEAP file organization means that any record can be placed wherever there is space for that record. There is no ordering of RECORDS. Typically there is a single file for each relation.

11.

State true or false: It is easier to delete a record from the fixed length records(a) True(b) FalseThe question was posed to me during an interview for a job.My doubt stems from File Organization in division Storage and File Structure of RDBMS

Answer»

Right OPTION is (b) False

Explanation: It is tough to delete a record from the FIXED LENGTH records but it is EASIER to delete a record from the variable length record. Thus, IMPLEMENTATION of variable records is preferred.

12.

The header in the slotted page structure does not contain which of the following data?(a) The number of record entries in the header(b) The end of free space in a block(c) The size of all the records put together in the header(d) An array containing location and size of each recordThe question was asked in semester exam.The query is from File Organization in section Storage and File Structure of RDBMS

Answer»

Right option is (C) The size of all the records PUT together in the header

The BEST explanation: The header in the slotted PAGE structure does not contain the size of all the records put together in the header but it contains the number of RECORD entries, the end of free space and an array containing location and size of each record.

13.

The slotted page structure is used for _________(a) Organizing records in a block(b) Organizing blocks in a database(c) Deleting records from a block(d) None of the mentionedI had been asked this question during an interview for a job.I need to ask this question from File Organization topic in section Storage and File Structure of RDBMS

Answer»

Correct option is (a) Organizing records in a BLOCK

Best EXPLANATION: The SLOTTED page structure is USED for organizing records in a block. The slotted page structure CONTAINS a header at the beginning of each block.

14.

The linked list formed by the deleted records is called as ______(a) Delete list(b) Free list(c) Null list(d) Non-existent listI got this question in homework.This intriguing question originated from File Organization in section Storage and File Structure of RDBMS

Answer»

The CORRECT choice is (B) Free list

Easy explanation: As the addresses can be thought of as pointers, the DELETED RECORDS thus form a linked list. The linked list formed by the deleted records is called as a free list.

15.

State true or False: Variable length records cannot be implemented(a) True(b) FalseThe question was posed to me by my school teacher while I was bunking the class.Enquiry is from File Organization in section Storage and File Structure of RDBMS

Answer»

Correct option is (b) False

To ELABORATE: Variable length records can be implemented in DATABASES. There are different TECHNIQUES to implement variable length records.

16.

What does a null bitmap indicate?(a) The database does not exist(b) The record does not exist(c) The attributes of a record do not have a value(d) The attributes are missing from recordI got this question during an interview.My question is based upon File Organization in portion Storage and File Structure of RDBMS

Answer» RIGHT answer is (c) The ATTRIBUTES of a record do not have a value

The best I can explain: A NULL-bitmap indicates that the attributes of a PARTICULAR record have null values.
17.

How can variable length records arise in a file(a) Storage of multiple record types in a file(b) Record types that allow variable lengths for one or more fields(c) Record types that allow repeating fields, such as arrays or multisets(d) All of the mentionedThis question was addressed to me in semester exam.The doubt is from File Organization topic in portion Storage and File Structure of RDBMS

Answer»

Right choice is (d) All of the mentioned

For explanation: Variable length records arise in a system in several WAYS like, STORAGE of multiple RECORD types in a FILE. Record types that allow variable lengths for one or more fields. Record types that allow repeating fields, such as arrays or multisets.

18.

Which of the following is true about file header?(a) It is allocated at the beginning of the file(b) It has information about the file(c) It generally contains the address of the first record in it(d) All of the mentionedI have been asked this question during an online exam.My doubt stems from File Organization topic in division Storage and File Structure of RDBMS

Answer»

The CORRECT choice is (d) All of the mentioned

Best explanation: A file header is a certain number of bytes allocated at the beginning of the file. It CONTAINS a VARIETY of information about the file and it can be USED to point the first record by storing the address of the first record in it.

19.

The devices that store a lot of optical disks are called as(a) Optical reservoirs(b) Jukeboxes(c) Karaoke machines(d) Sequential access machinesI got this question in an interview.Asked question is from File Organization in portion Storage and File Structure of RDBMS

Answer»

Correct option is (b) JUKEBOXES

The EXPLANATION: Jukeboxes are the DEVICES that store a lot of optical DISKS and load them automatically on demand.

20.

What is the approximate storage capacity of CDs in MB(a) 300(b) 700(c) 1100(d) 1500The question was asked in an interview.My question is taken from File Organization in portion Storage and File Structure of RDBMS

Answer»

The correct ANSWER is (b) 700

The best explanation: s: CDs generally have a STORAGE CAPACITY of 700 Megabytes and DVDs have a storage capacity of around 4.7 Gigabytes.

21.

Which of the factors need not be taken into consideration while choosing a RAID level?(a) Monetary cost(b) I/O requirements(c) Performance when the disk has failed(d) None of the mentionedThis question was posed to me by my college professor while I was bunking the class.My question is taken from RAID topic in chapter Storage and File Structure of RDBMS

Answer»

Right option is (d) None of the mentioned

For EXPLANATION: Monetary COST, I/O requirements, performance when disk has FAILED are to be TAKEN into consideration while choosing a RAID level.

22.

RAID level 5 refers to?(a) Disk arrays with striping at the level of blocks(b) Disk mirroring with block striping(c) Memory style error correcting code(d) Block interleaved distributed parityThis question was addressed to me in class test.My enquiry is from RAID topic in division Storage and File Structure of RDBMS

Answer»

Right choice is (d) Block interleaved distributed parity

The best I can explain: RAID level 5 refers to Block interleaved distributed parity. It partitions both the DATA and parity AMONG N+1 DISKS.

23.

RAID level 2 refers to?(a) Disk arrays with striping at the level of blocks(b) Disk mirroring with block striping(c) Memory style error correcting code(d) Block interleaved distributed parityThe question was asked in an interview for job.My question is from RAID topic in chapter Storage and File Structure of RDBMS

Answer»

The CORRECT choice is (c) Memory style error correcting code

The explanation: RAID LEVEL 2 refers to Memory style error correcting code. Memory systems have LONG PARITY bits for error detection and CORRECTION.

24.

RAID level 1 refers to?(a) Disk arrays with striping at the level of blocks(b) Disk mirroring with block striping(c) Memory style error correcting code(d) Block interleaved distributed parityThis question was posed to me in an international level competition.The above asked question is from RAID in division Storage and File Structure of RDBMS

Answer»

Right choice is (b) Disk mirroring with block STRIPING

Easiest EXPLANATION: RAID level 1 refers to Disk mirroring with block striping. This is ALSO CALLED as RAID 10 or RAID 1+0.

25.

RAID level 0 refers to?(a) Disk arrays with striping at the level of blocks(b) Disk mirroring with block striping(c) Memory style error correcting code(d) Block interleaved distributed parityThis question was posed to me in an online interview.I'm obligated to ask this question of RAID in chapter Storage and File Structure of RDBMS

Answer» RIGHT option is (a) DISK arrays with striping at the level of blocks

Explanation: RAID level 0 refers to Disk arrays with striping at the level of blocks. This level does not have any redundancy.
26.

How many levels of RAID exist?(a) 5(b) 6(c) 7(d) 8I have been asked this question in class test.My doubt is from RAID in chapter Storage and File Structure of RDBMS

Answer»

The correct option is (c) 7

Explanation: There exist a TOTAL of 7 RAID levels ranging from 0 to 6.

27.

Data striping by splitting bits across multiple disks is called as _______(a) RAID striping(b) Array striping(c) Bit level striping(d) Block level stripingThe question was asked during an online interview.This interesting question is from RAID in chapter Storage and File Structure of RDBMS

Answer»

The correct answer is (c) Bit LEVEL striping

Explanation: DATA striping by splitting bits across multiple disks is CALLED as bit level striping. For EXAMPLE if we have an array of 8 disks, we write bit I of each byte to disk i.

28.

State true or false: Using RAID increases the mean time to failure(a) True(b) FalseI have been asked this question in final exam.I need to ask this question from RAID in division Storage and File Structure of RDBMS

Answer»

Correct option is (a) True

For explanation: Using RAID ENABLES US to use multiple DISKS which when combined TOGETHER increase the mean time to FAILURE.

29.

The process of duplicating every disk is called _______(a) Incremention(b) Arraying(c) Mirroring(d) ReflectingI have been asked this question in quiz.My doubt is from RAID topic in chapter Storage and File Structure of RDBMS

Answer»

The CORRECT CHOICE is (c) Mirroring

Explanation: The simplest technique to INTRODUCE redundancy is to DUPLICATE every disk. This process is KNOWN as Mirroring.

30.

What is the full form of RAID?(a) Redundant Array of Independent Disks(b) Reliable Array of Independent Disks(c) Redundant Asset Increment Data(d) Reliable Aggravation of Immaculate DataThis question was posed to me at a job interview.This question is from RAID topic in chapter Storage and File Structure of RDBMS

Answer»

Right answer is (a) REDUNDANT Array of Independent Disks

Explanation: The full form of RAID is Redundant array of Independent Disks. This DISK ORGANIZATION technique IMPROVES performance and RELIABILITY.

31.

The logical to physical page mapping is represented in a ____________(a) Logic physical table(b) Transition table(c) Wear leveling table(d) Logic log tableI had been asked this question in an online quiz.I would like to ask this question from Magnetic Disk and Flash Storage topic in division Storage and File Structure of RDBMS

Answer»

Correct answer is (b) TRANSITION table

Easiest explanation: The LOGICAL to physical page mapping is represented in a Transition table which is generally AVAILABLE in memory. This is used for QUICK access of data.

32.

State true or false: NOR flash is cheaper than NAND flash(a) True(b) FalseThe question was posed to me in examination.I need to ask this question from Magnetic Disk and Flash Storage in division Storage and File Structure of RDBMS

Answer» CORRECT choice is (b) False

Best explanation: NAND flash is significantly CHEAPER than NOR flash and ALSO has a higher STORAGE capacity and hence is widely used.
33.

Files that support log disks are called as ________(a) Logging file systems(b) Jorte File Systems(c) Journaling File Systems(d) Channelizing File SystemsThe question was asked by my college director while I was bunking the class.I want to ask this question from Magnetic Disk and Flash Storage topic in portion Storage and File Structure of RDBMS

Answer» RIGHT answer is (c) Journaling File Systems

The explanation: Files that support log DISKS are CALLED as Journaling File Systems. Journaling file systems can be implemented without a separate log disk, KEEPING the DATA and the log on the same disk.
34.

What is an NVRAM?(a) RAM which is non-volatile in nature(b) RAM whose data is not lost during power failures(c) RAM that significantly speeds up data transfers(d) All of the mentionedThe question was asked in class test.The question is from Magnetic Disk and Flash Storage topic in section Storage and File Structure of RDBMS

Answer»

Right answer is (d) All of the mentioned

Easiest explanation: A non-volatile random access memory or NVRAM is the ONE which is non-volatile, DATA is retained during POWER failure and which CONSIDERABLY speeds up the disk WRITES.

35.

What is buffering?(a) The blocks read from disk are directly accessed(b) The blocks read from disk are temporarily stored in a memory(c) The blocks read from disk are organized in a particular fashion to cater requests.(d) None of the mentionedThis question was addressed to me at a job interview.My question is based upon Magnetic Disk and Flash Storage topic in division Storage and File Structure of RDBMS

Answer»

Right CHOICE is (b) The blocks read from disk are temporarily stored in a memory

The explanation: Buffering INVOLVES READING the DATA and storing it in a temporary memory location called as the data BUFFER for future requests. The data in the buffer is temporary and is deleted after usage.

36.

Which of the following is a measure of reliability of a disk?(a) Seek time(b) Average latency time(c) Mean time to failure(d) Average seek timeThis question was posed to me in a job interview.This interesting question is from Magnetic Disk and Flash Storage in section Storage and File Structure of RDBMS

Answer»

Right choice is (c) Mean time to FAILURE

To elaborate: The mean time to failure is the MEASURE of the reliability of a disk. It GIVES the mean of the TIMES that most disks LAST.

37.

The time for repositioning the arm is called as _________(a) Seek time(b) Access time(c) Reposition time(d) Latency timeThis question was posed to me during an online interview.Origin of the question is Magnetic Disk and Flash Storage topic in section Storage and File Structure of RDBMS

Answer»

Correct OPTION is (a) Seek time

To elaborate: The time for repositioning the ARM is called as Seek time.

38.

The time from when a read or write request is issued to when the actual data transfer begins is called _______(a) Seek time(b) Access time(c) Average latency time(d) Data transfer rateI have been asked this question in an interview.I need to ask this question from Magnetic Disk and Flash Storage topic in division Storage and File Structure of RDBMS

Answer» RIGHT option is (b) Access time

The best EXPLANATION: The time from when a read or WRITE request is issued to when the actual data transfer begins is called access time. Data transfer rate is the rate at which data can be retrieved from the storage.
39.

When a large number of disks are connected by a high speed network to a number of server computers, it is known as ________ architecture(a) Storage area network(b) High performance network(c) Multiple disk network(d) Local area networkI have been asked this question during a job interview.I'm obligated to ask this question of Magnetic Disk and Flash Storage topic in portion Storage and File Structure of RDBMS

Answer»

The correct answer is (a) Storage area network

Easiest explanation: When a large number of disks are connected by a high SPEED network to a number of server computers, it is known as Storage Area Network (SAN) architecture. These disks are usually arranged by a local ORGANIZATION TECHNIQUE CALLED RAID.

40.

Which of the following is a part of the Magnetic disk assembly?(a) Spindle(b) Read write head(c) Arm(d) All of the mentionedI got this question during an internship interview.My question is taken from Magnetic Disk and Flash Storage in section Storage and File Structure of RDBMS

Answer»

Right option is (d) All of the mentioned

The EXPLANATION is: In a magnetic disk assembly, Spindle is the CENTRAL cylindrical rod, Read write head is USED to read and write data and the ARM is used to hold the magnetic disk.

41.

DVD is a form of ______ storage(a) Magnetic storage(b) USB storage(c) Tape storage(d) Optical storageThis question was addressed to me during a job interview.My question is from Magnetic Disk and Flash Storage topic in section Storage and File Structure of RDBMS

Answer»

The CORRECT option is (d) Optical storage

To explain I WOULD SAY: DVD is a form of optical storage. The DATA on a DVD is read by an optical READER.

42.

What is the full form of USB?(a) Universal Serial Binary(b) Universal Storage Base(c) Universal Serial Bus(d) Uninterrupted Service BusI have been asked this question in an international level competition.I would like to ask this question from Magnetic Disk and Flash Storage topic in division Storage and File Structure of RDBMS

Answer»

Correct choice is (c) UNIVERSAL Serial BUS

To explain I would SAY: USB – Universal Serial Bus. This is currently the most popular and convenient way of DATA transmittal.

43.

What is the difference between flash memory and main memory?(a) Data is retained in flash memory(b) Data access is faster in flash memory(c) Data storage is very large in flash memory(d) None of the mentionedI had been asked this question in a national level competition.My enquiry is from Magnetic Disk and Flash Storage in section Storage and File Structure of RDBMS

Answer»

Correct OPTION is (a) DATA is RETAINED in flash memory

To ELABORATE: Data is retained in flash memory. Power LOSSES do not affect the data stored in flash memory.

44.

Statement 1: Cache storage is very fastStatement 2: Cache storage is very cheap(a) Both the statements are true(b) Statement 1 is true but statement 2 is false(c) Statement 1 is false but statement 2 is true(d) Both the statements are falseThe question was asked in class test.The doubt is from Magnetic Disk and Flash Storage in portion Storage and File Structure of RDBMS

Answer»

The correct answer is (b) Statement 1 is TRUE but statement 2 is false

Best explanation: CACHE STORAGE is very fast but it is the costliest form of storage.