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

State true or false: It is easier to delete a record from the fixed le

1.	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.

Discussion

No Comment Found

Related InterviewSolutions

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
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
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
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
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
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
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
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
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
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

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

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment