Tutorials
PPTs
Lecture Notes
Objective Questions
Lab ProgramsObjective Type Questions & Answers
Database Management System Objective Type Question Bank-Unit-2
1. Which one of the following is a procedural language?
A . Domain relational calculus
B . Tuple relational calculus
C . Relational algebra
D . Query language
2. The_____ operation allows the combining of two relations by merging pairs of tuples, one from each relation, into a single tuple.
A . Select
B . Join
C . Union
D . Intersection
3. The result which operation contains all pairs of tuples from the two relations, regardless of whether their attribute values match.
A . Join
B . Cartesian product
C . Intersection
D . Set difference
4. The _______ operator takes the results of two queries and returns only rows that appear in both result sets.
A . Union
B . Intersect
C . Difference
D . Projection
5. The _________ provides a set of operations that take one or more relations as input and return a relation as an output.
A . Schematic representation
B . Relational algebra
C . Scheme diagram
D . Relation flow
6. 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 . Fundamental
7. 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)
8. 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, Operation
9. 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 mentioned
10. 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 mentioned
11. An expression in the domain relational calculus is of the form
A . {P(x1, x2, . . . , xn) | < x1, x2, . . . , xn > }
B . {x1, x2, . . . , xn | < x1, x2, . . . , xn > }
C . { x1, x2, . . . , xn | x1, x2, . . . , xn}
D . {< x1, x2, . . . , xn > | P(x1, x2, . . . , xn)}
12. In domain relaional calculus “there exist” can be expressed as
A . (P1(x))
B . (P1(x)) Э x
C . V x (P1(x))
D . Э x (P1(x))
13. Which of the following creates a virtual relation for storing the query?
A . Function
B . View
C . Procedure
D . None of the mentioned
14. Which of the following is the syntax for views where v is view name?
A . Create view v as “query name”;
B . Create “query expression” as view;
C . Create view v as “query expression”;
D . Create view “query expression”;
15. Updating the value of the view
A . Will affect the relation from which it is defined
B . Will not change the view definition
C . Will not affect the relation from which it is defined
D . Cannot determine
16. SQL view is said to be updatable (that is, inserts, updates or deletes can be applied on the view) if which of the following conditions are satisfied by the query defining the view?
A . The from clause has only one database relation
B . The query does not have a group by or having clause
C . The select clause contains only attribute names of the relation and does not have any expressions, aggregates, or distinct specification
D . All of the mentioned
17. Drop Table cannot be used to drop a table referenced by a _________ constraint.
A . Local Key
B . Primary Key
C . Composite Key
D . Foreign Key
18. ______ is a special type of integrity constraint that relates two relations & maintains consistency across the relations.
A . Entity Integrity Constraints
B . Referential Integrity Constraints
C . Domain Integrity Constraints
D . Domain Constraints
19. An entity in A is associated with at most one entity in B, and an entity in B is associated with at most one entity in A.This is called as
A . One-to-many
B . One-to-one
C . Many-to-many
D . Many-to-one
20. A Key which is a set of one or more columns that can identify a record uniquely is called?
A . Natural key
B . Candidate key
C . Not Null key
D . Alternate key
21. Relational Algebra does not have
A . Selection operator
B . Projection operator
C . Aggregation operators
D . Division operator
22. If two relations R and S are joined, then the non matching tuples of both R and S are ignored in
A . left outer join
B . right outer join
C . full outer join
D . inner join
23. The common column is eliminated in
A . theta join
B . outer join
C . natural join
D . composed join
24. Relational calculus is a
A . Procedural language
B . Declarative Language
C . Object oriented language
D . High level language
25. _______ produces the relation that has attributes of R1 and R2
A . Cartesian product
B . Difference
C . Intersection
D . Product
26. The following conditions must be met by a union operation.
A . There must be a common attribute between A and B.
B . A duplicate tuple is automatically discarded.
C . Both A. and B.
D . None of the above
Relevant Materials :
☞ Database Management System Objective Type Question Bank-Unit-1 - [ DBMS ]
☞ Database Management System Objective Type Question Bank-Unit-2 - [ DBMS ]
☞ Database Management System Objective Type Question Bank-Unit-3 - [ DBMS ]
☞ Database Management System Objective Type Question Bank-Unit-4 - [ DBMS ]
☞ Database Management System Objective Type Question Bank-Unit-5 - [ DBMS ]
Similar Materials :
☞ R - Programming MCQs - Unit-1 - [ R-Programming ]
☞ R - Programming MCQs - Unit-2 - [ R-Programming ]
☞ R - Programming MCQs - Unit-3 - [ R-Programming ]
☞ R - Programming MCQs - Unit-4 - [ R-Programming ]
☞ R - Programming MCQs - Unit-5 - [ R-Programming ]
☞ Formal Languages and Automata Theory (FLAT) MCQs - Unit-1 - [ FLAT ]
☞ Formal Languages and Automata Theory (FLAT) MCQs - Unit-2 - [ FLAT ]
☞ Formal Languages and Automata Theory (FLAT) MCQs - Unit-3 - [ FLAT ]
☞ Formal Languages and Automata Theory (FLAT) MCQs - Unit-4 - [ FLAT ]
☞ Formal Languages and Automata Theory (FLAT) MCQs - Unit-5 - [ FLAT ]
☞ PPS MCQs - Unit-1 - [ PPS ]
☞ PPS MCQs - Unit-2 - [ PPS ]
☞ PPS MCQs - Unit-3 - [ PPS ]
☞ PPS MCQs - Unit-4 - [ PPS ]
☞ PPS MCQs - Unit-5 - [ PPS ]
☞ Object Oriented Programming through Java MCQs - Unit-1 - [ OOP_JAVA ]
☞ Object Oriented Programming through Java MCQs - Unit-2 - [ OOP_JAVA ]
☞ Object Oriented Programming through Java MCQs - Unit-3 - [ OOP_JAVA ]
☞ Object Oriented Programming through Java MCQs - Unit-4 - [ OOP_JAVA ]
☞ Object Oriented Programming through Java MCQs - Unit-5 - [ OOP_JAVA ]
☞ Design and Analysis of Algorithms MCQs - Unit-1 - [ DAA ]
☞ Design and Analysis of Algorithms MCQs - Unit-2 - [ DAA ]
☞ Design and Analysis of Algorithms MCQs - Unit-3 - [ DAA ]
☞ Design and Analysis of Algorithms MCQs - Unit-4 - [ DAA ]
☞ Design and Analysis of Algorithms MCQs - Unit-5 - [ DAA ]
☞ Software Engineering MCQs - Unit-1 - [ SE ]
☞ Software Engineering MCQs - Unit-2 - [ SE ]
☞ Software Engineering MCQs - Unit-3 - [ SE ]
☞ Software Engineering MCQs - Unit-4 - [ SE ]
☞ Software Engineering MCQs - Unit-5 - [ SE ]
☞ Data Mining MCQs - Unit-1 - [ DM ]
☞ Data Mining MCQs - Unit-2 - [ DM ]
☞ Data Mining MCQs - Unit-3 - [ DM ]
☞ Data Mining MCQs - Unit-4 - [ DM ]
☞ Data Mining MCQs - Unit-5 - [ DM ]
☞ Computer Organization and Architecture (COA) Objective Question Bank-Unit-1 - [ COA ]
☞ Computer Organization and Architecture (COA) Objective Question Bank-Unit-2 - [ COA ]
☞ Computer Organization and Architecture (COA) Objective Question Bank-Unit-3 - [ COA ]
☞ Computer Organization and Architecture (COA) Objective Question Bank-Unit-4 - [ COA ]
☞ Computer Organization and Architecture (COA) Objective Question Bank-Unit-5 - [ COA ]
☞ Data Structures Objective Type Question Bank-Unit-1 - [ DS ]
☞ Data Structures Objective Type Question Bank-Unit-2 - [ DS ]
☞ Data Structures Objective Type Question Bank-Unit-3 - [ DS ]
☞ Data Structures Objective Type Question Bank-Unit-4 - [ DS ]
☞ Data Structures Objective Type Question Bank-Unit-5 - [ DS ]
☞ Cyber Forensics Objective Type Question Bank-Part-2 - [ Cyber Forensics ]
☞ Cyber Forensics Objective Type Question Bank-Part-1 - [ Cyber Forensics ]
☞ Java Programming Objective Type Question Bank - [ Java Programming ]
☞ Java Programming Objective Type Questions-Part-1 - [ Java Programming ]
☞ Java Programming Objective Type Questions-Part-2 - [ Java Programming ]