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.

1.	Which is a unary operation:(a) Selection operation(b) Primitive operation(c) Projection operation(d) Generalized selectionThis question was posed to me by my school principal while I was bunking the class.Question is taken from Relational Algebra topic in section Relational Algebra of Database Management
Answer» The CORRECT ANSWER is (d) Generalized SELECTION Easiest explanation - Generalization Selection takes only one ARGUMENT for OPERATION.

2.	The ___________ operation, denoted by −, allows us to find tuples that are in one relation but are not in another.(a) Union(b) Set-difference(c) Difference(d) IntersectionThis question was addressed to me in an online interview.Asked question is from Relational Algebra in division Relational Algebra of Database Management
Answer» Correct ANSWER is (B) Set-difference Explanation: The EXPRESSION r − s PRODUCES a relation CONTAINING those tuples in r but not in s.

3.	Relational Algebra is a __________ query language that takes two relations as input and produces another relation as an output of the query.(a) Relational(b) Structural(c) Procedural(d) FundamentalI got this question in final exam.Question is from Relational Algebra topic in division Relational Algebra of Database Management
Answer» Correct OPTION is (C) Procedural The best I can EXPLAIN: This language has fundamental and other OPERATIONS which are USED on relations.

4.	For select operation the ________ appear in the subscript and the ___________ argument appears in the paranthesis after the sigma.(a) Predicates, relation(b) Relation, Predicates(c) Operation, Predicates(d) Relation, OperationThe question was asked in an interview for internship.My query is from Relational Algebra in chapter Relational Algebra of Database Management
Answer» Correct ANSWER is (a) PREDICATES, relation To explain: NONE.

5.	Which is a join condition contains an equality operator:(a) Equijoins(b) Cartesian(c) Natural(d) LeftThe question was asked during an internship interview.This is a very interesting question from Relational Algebra in division Relational Algebra of Database Management
Answer» RIGHT ANSWER is (a) Equijoins Easiest EXPLANATION - NONE.

6.	A query in the tuple relational calculus is expressed as:(a) {t \| P() \| t}(b) {P(t) \| t }(c) {t \| P(t)}(d) All of the mentionedThe question was posed to me in final exam.The question is from Tuple Relational Calculus and Domain Relational Calculus topic in section Relational Algebra of Database Management
Answer» Correct choice is (c) {t \| P(t)} Easy explanation - The tuple relational CALCULUS, is a nonprocedural query language. It describes the desired INFORMATION without giving a SPECIFIC procedure for obtaining that information.

7.	Which of the following is a fundamental operation in relational algebra?(a) Set intersection(b) Natural join(c) Assignment(d) None of the mentionedI had been asked this question in an online quiz.This intriguing question comes from Relational Algebra topic in portion Relational Algebra of Database Management
Answer» Correct answer is (d) None of the mentioned The explanation is: The FUNDAMENTAL OPERATIONS are select, project, union, set difference, CARTESIAN product, and rename.

8.	Which of the following is not outer join?(a) Left outer join(b) Right outer join(c) Full outer join(d) All of the mentionedThis question was addressed to me in examination.I'd like to ask this question from Relational Algebra topic in section Relational Algebra of Database Management
Answer» Correct OPTION is (d) All of the mentioned Easy explanation - The FULL OUTER JOIN keyword combines the RESULT of both LEFT and RIGHT JOINS.

9.	Which of the following symbol is used in the place of except?(a) ^(b) V(c) ¬(d) ~This question was addressed to me in semester exam.My doubt is from Tuple Relational Calculus and Domain Relational Calculus in division Relational Algebra of Database Management
Answer» CORRECT OPTION is (c) ¬ Easiest EXPLANATION - The query ¬P NEGATES the value of P.

10.	Find the ID, name, dept name, salary for instructors whose salary is greater than $80,000 .(a) {t \| t ε instructor ∧ t[salary] > 80000}(b) Э t ∈ r (Q(t))(c) {t \| Э s ε instructor (t[ID] = s[ID]∧ s[salary] > 80000)}(d) None of the mentionedThis question was posed to me in a job interview.The question is from Tuple Relational Calculus and Domain Relational Calculus in division Relational Algebra of Database Management
Answer» CORRECT choice is (a) {t \| t ε instructor ∧ t[salary] > 80000} The best I can EXPLAIN: This EXPRESSION is in TUPLE relational format.

11.	Which of the following is used to denote the selection operation in relational algebra?(a) Pi (Greek)(b) Sigma (Greek)(c) Lambda (Greek)(d) Omega (Greek)I got this question in an international level competition.The question is from Relational Algebra in chapter Relational Algebra of Database Management
Answer» The correct answer is (B) Sigma (GREEK) The BEST explanation: The select operation selects tuples that SATISFY a given predicate.

12.	In precedence of set operators, the expression is evaluated from(a) Left to left(b) Left to right(c) Right to left(d) From user specificationI got this question during an interview.My question comes from Relational Algebra topic in chapter Relational Algebra of Database Management
Answer» Right choice is (b) Left to right Best EXPLANATION: The expression is EVALUATED from left to right according to the PRECEDENCE.