InterviewSolution

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.

51.	State true or false: The aggregation functions can be implemented in the same way as that of duplicate elimination.(a) True(b) FalseThis question was addressed to me during an interview for a job.The query is from Join and Other Operations topic in division Query Processing and Optimization of RDBMS
Answer» Right OPTION is (a) True To EXPLAIN I WOULD SAY: The AGGREGATION functions can be implemented in the same way as that of duplicate elimination.

52.	Which of the following joins preserves the tuples of the relation on the left side of the operator?(a) Left outer join(b) Natural join(c) Right outer join(d) None of the mentionedI have been asked this question in an interview.Enquiry is from Join and Other Operations in division Query Processing and Optimization of RDBMS
Answer» Right CHOICE is (a) Left outer join Explanation: Left outer join and FULL outer join both PRESERVE the TUPLES on the left side of the OPERATOR.

53.	Which of the following is not a set operation(a) Union(b) Intersection(c) And operation(d) Set differenceThis question was posed to me by my college director while I was bunking the class.Question is from Join and Other Operations in chapter Query Processing and Optimization of RDBMS
Answer» The CORRECT option is (c) And operation To elaborate: The AND operation is not a SET operation, it is a LOGICAL bit operation.

54.	Overflow resolution is performed when,(a) A hash index overflow is detected(b) Extra hash indices are to be added(c) When the number of partitions are to be increased(d) None of the mentionedI had been asked this question during an internship interview.My question is from Join and Other Operations in division Query Processing and Optimization of RDBMS
Answer» Correct option is (a) A hash INDEX overflow is DETECTED The explanation: Hash table OVERFLOWS can be handled by EITHER overflow RESOLUTION or overflow avoidance. Overflow resolution is performed when a hash index overflow is detected.

55.	The splitting of input until each partition of the build input fits the memory is called as ______(a) Temporary partitioning(b) Block partitioning(c) Recursive partitioning(d) Byte partitioningThe question was posed to me in examination.My question is taken from Join and Other Operations in chapter Query Processing and Optimization of RDBMS
Answer» The correct ANSWER is (c) RECURSIVE partitioning The best explanation: The SPLITTING of input until each partition of the build input fits the memory is CALLED as recursive partitioning.

56.	The ___________ merges the sorted relation with leaf entries of the secondary B+ tree index.(a) Merge join algorithm(b) Hybrid merge join algorithm(c) Hash join algorithm(d) Hybrid Hash join algorithmThe question was asked in an interview.This interesting question is from Join and Other Operations in division Query Processing and Optimization of RDBMS
Answer» The CORRECT choice is (b) Hybrid MERGE JOIN ALGORITHM The best I can explain: The Hybrid merge join algorithm merges the sorted relation with leaf entries of the secondary B+ tree index. The result contains tuples from the sorted relation and addresses for tuples from the unsorted relation.

57.	The merge join can be used to compute(a) Natural joins(b) Equi joins(c) Both the mentioned(d) None of the mentionedThe question was posed to me in a job interview.My question is taken from Join and Other Operations in section Query Processing and Optimization of RDBMS
Answer» The CORRECT answer is (c) Both the mentioned To explain: The merge join can be USED to COMPUTE both equijoins and natural joins. This is also called as the sort-merge-join algorithm.

58.	If nested loop join is done on a per block basis rather than on a per tuple basis, it is called as(a) Equi join(b) Hash join(c) Nested loop join(d) Block nested loop joinI have been asked this question in a job interview.I want to ask this question from Join and Other Operations in section Query Processing and Optimization of RDBMS
Answer» Right option is (d) BLOCK nested loop JOIN The explanation is: If nested loop join is done on a per block basis rather than on a per tuple basis, it is called as Block nested loop join. Within each PAIR of blocks, every tuple in one block is paired with every tuple in the other block to generate all POSSIBLE COMBINATIONS.

59.	A join of the form r ⨝r.A=s.B s is called as(a) Equi join(b) Left outer join(c) Right outer join(d) Full outer joinI had been asked this question in quiz.Asked question is from Join and Other Operations topic in chapter Query Processing and Optimization of RDBMS
Answer» Right CHOICE is (a) Equi join Explanation: A join of the form r ⨝r.A=s.B s is CALLED as equi-join where A and B are SETS of attributes of r and s respectively.

60.	Which of the following can be implemented?(a) Conjunctive selection using one index(b) Conjunctive selection using composite index(c) Conjunctive selection by intersection of identifiers(d) All of the mentionedI got this question by my school principal while I was bunking the class.My doubt is from Query Processing topic in chapter Query Processing and Optimization of RDBMS
Answer» Right OPTION is (d) All of the mentioned For explanation: Conjunctive selection using one INDEX, conjunctive selection using composite index and conjunctive selection by INTERSECTION of identifiers can be implemented. These are A7, A8, A9 algorithms that use an index.

61.	A selection of the form giving all the records not satisfying simple individual conditions is ______(a) Conjunctive selection(b) Disjunctive selection(c) Negation(d) None of the mentionedThis question was posed to me in a job interview.My query is from Query Processing in chapter Query Processing and Optimization of RDBMS
Answer» RIGHT choice is (C) Negation Explanation: A selection of the FORM giving all the records not satisfying simple INDIVIDUAL CONDITIONS is negation. This is a form of complex selection predicate.

62.	A selection of the form satisfying the union of all records satisfying individual simple conditions is(a) Conjunctive selection(b) Disjunctive selection(c) Negation(d) None of the mentionedThis question was posed to me in final exam.My question is based upon Query Processing topic in section Query Processing and Optimization of RDBMS
Answer» Correct CHOICE is (B) Disjunctive selection Explanation: A selection of the form satisfying the INTERSECTION of all records satisfying individual simple conditions is a disjunctive selection. This is a form of COMPLEX selection predicate.

63.	A selection of the form satisfying the intersection of all records satisfying individual simple conditions is(a) Conjunctive selection(b) Disjunctive selection(c) Negation(d) None of the mentionedI have been asked this question in unit test.My question is from Query Processing topic in section Query Processing and Optimization of RDBMS
Answer» Right choice is (a) Conjunctive selection To elaborate: A selection of the FORM satisfying the INTERSECTION of all records satisfying individual SIMPLE conditions is a conjunctive selection. This is a form of complex selection PREDICATE.

64.	Sorting of relations that do not fit in memory is called as _______(a) Internal sorting(b) External sorting(c) Overflow sorting(d) Overload sortingI got this question in unit test.Question is from Query Processing topic in chapter Query Processing and Optimization of RDBMS
Answer» Correct choice is (B) External sorting The EXPLANATION: Sorting of RELATIONS that do not fit in memory is CALLED as external sorting.

65.	Search algorithms that use an index are referred to as _________(a) Index scans(b) Search scans(c) Primary scans(d) Equality scansI have been asked this question in final exam.The above asked question is from Query Processing in section Query Processing and Optimization of RDBMS
Answer» The correct CHOICE is (a) INDEX scans Easiest EXPLANATION: Search ALGORITHMS that use an index are called as index scans. We use the selection predicate to guide us through the choice of index to use in processing the QUERY.

66.	The lowest level operator to access data in query processing is _______(a) File scan(b) File manipulation(c) File handling(d) File organizationThe question was asked in homework.My question is taken from Query Processing in portion Query Processing and Optimization of RDBMS
Answer» The correct choice is (a) FILE SCAN The explanation: The lowest level operator to access data in query processing is file scan. File scans are algorithms that locate and retrieve records that FULFILL a selection CRITERION.

67.	A sequence of primitive operations that can be used to evaluate a query are called as__________(a) Query evaluation algebra(b) Query evaluation plan(c) Query evaluation primitive(d) Query evaluation engineThis question was posed to me at a job interview.Origin of the question is Query Processing topic in division Query Processing and Optimization of RDBMS
Answer» Correct option is (b) Query evaluation plan For explanation: A sequence of PRIMITIVE operations that can be used to evaluate a query are CALLED as Query evaluation plan. This is used by the query evaluation engine to PROCESS the queries.

68.	A relational algebra operation annotated with instructions on how to evaluate it is called _______(a) Evaluation algebra(b) Evaluation plan(c) Evaluation primitive(d) Evaluation engineI have been asked this question in examination.I want to ask this question from Query Processing in chapter Query Processing and Optimization of RDBMS
Answer» Right option is (c) Evaluation primitive Easy explanation: A relational algebra operation ANNOTATED with INSTRUCTIONS on how to evaluate it is called Evaluation primitive. The evaluation primitive is the basis for evaluation of QUERIES.

69.	Which of the following are steps in query processing?(a) Parsing and translation(b) Optimization(c) Evaluation(d) All of the mentionedI had been asked this question during an online exam.I need to ask this question from Query Processing in chapter Query Processing and Optimization of RDBMS
Answer» The CORRECT option is (d) All of the mentioned Easiest explanation: Parsing and TRANSLATION, optimization, evaluation are all the BASIC steps to PROCESS a query.