dbms3
dbms3
1. An ________ is a set of entities of the same type that share the same properties, or
attributes.(a)
a) Entity set
b) Attribute set
c) Relation set
d) Entity model
.
2. Entity is a _________(c)
a) Object of relation
b) Present working model
c) Thing in real world
d) Model of relation
6. The attribute AGE is calculated from DATE_OF_BIRTH. The attribute AGE is(d)
a) Single valued
b) Multi valued
c) Composite
d) Derived
b) Name
c) Date_of_birth
d) All of the mentioned
10. In a relation between the entities the type and condition of the relation should be
specified. That is called as______attribute.(a)
a) Desciptive
b) Derived
c) Recursive
d) Relative
c) Method constraints
d) Referential integrity constraints
7. ______ is a special type of integrity constraint that relates two relations &
maintains consistency across the relations.(b)
a) Entity Integrity Constraints
b) Referential Integrity Constraints
c) Domain Integrity Constraints
d) Domain Constraints
8. Which one of the following uniquely identifies the elements in the relation?(b)
a) Secondary Key
b) Primary key
c) Foreign key
d) Composite key
d) Diamond
4. Consider a directed line(->) from the relationship set advisor to both entity sets
instructor and student. This indicates _________ cardinality(b)
a) One to many
b) One to one
c) Many to many
d) Many to one
5. We indicate roles in E-R diagrams by labeling the lines that connect ___________
to __________(d)
a) Diamond , diamond
b) Rectangle, diamond
c) Rectangle, rectangle
d) Diamond, rectangle
Explanation: Diamond represents a relationship set and rectangle represents a entity set.
6. An entity set that does not have sufficient attributes to form a primary key is
termed a __________(c)
a) Strong entity set
b) Variant set
c) Weak entity set
d) Variable set
7. For a weak entity set to be meaningful, it must be associated with another entity
set, called the(a)
a) Identifying set
b) Owner set
c) Neighbour set
d) Strong entity set
9. If you were collecting and storing information about your music collection, an
album would be considered a(n) _____(b)
5
a) Relation
b) Entity
c) Instance
d) Attribute
10. What term is used to refer to a specific record in your music database; for
instance; information stored about a specific album?(b)
a) Relation
b) Instance
c) Table
d) Column
3. Given the basic ER and relational models, which of the following is INCORRECT?
(c)
a) An attribute of an entity can have more than one value
b) An attribute of an entity can be composite
c) In a row of a relational table, an attribute can have more than one value
d) In a row of a relational table, an attribute can have exactly one value or a NULL value
4. Which of the following indicates the maximum number of entities that can be
involved in a relationship?(b)
a) Minimum cardinality
b) Maximum cardinality
c) ERD
d) Greater Entity Count
b) Binary
c) Ternary
d) Quaternary
1. The entity set person is classified as student and employee. This process is called
_________(b)
a) Generalization
b) Specialization
c) Inheritance
d) Constraint generalization
3. The refinement from an initial entity set into successive levels of entity
subgroupings represents a ________ design process in which distinctions are made
explicit.(c)
a) Hierarchy
b) Bottom-up
c) Top-down
7
d) Radical
4. There are similarities between the instructor entity set and the secretary entity set
in the sense that they have several attributes that are conceptually the same across
the two entity sets: namely, the identifier, name, and salary attributes. This process is
called(c)
a) Commonality
b) Specialization
c) Generalization
d) Similarity
5. If an entity set is a lower-level entity set in more than one ISA relationship, then the
entity set has(d)
a) Hierarchy
b) Multilevel inheritance
c) Single inheritance
d) Multiple inheritance
7. Consider the employee work-team example, and assume that certain employees
participate in more than one work team. A given employee may therefore appear in
more than one of the team entity sets that are lower level entity sets of employee.
Thus, the generalization is _____________(a)
a) Overlapping
b) Disjointness
c) Uniqueness
d) Relational
6. If every non-key attribute is functionally dependent primary key, then the relation
will be in(b)
a) First normal form
b) Second normal form
c) Third form
d) Fourth normal form
8. The term for information that describes what type of data is available in a database
is(d)
a) Data dictionary
9
b) data repository
c) Index data
d) Metadata
9. A data type that creates unique numbers for key columns in Microsoft Access is(a)
a) Autonumber
b) Boolean
c) Sequential key
d) Sequential number
Explanation: The first normal form is used to eliminate the duplicate information.
2. A table on the many side of a one to many or many to many relationship must(d)
a) Be in Second Normal Form (2NF)
b) Be in Third Normal Form (3NF)
c) Have a single attribute key
d) Have a composite key
Explanation: The relation in second normal form is also in first normal form and no partial
dependencies on any column in primary key.
Explanation: The relation in second normal form is also in first normal form and no partial
dependencies on any column in primary key.
5. Functional Dependencies are the types of constraints that are based on______(a)
a) Key
b) Key revisited
c) Superset key
d) None of the mentioned
7. Which forms simplifies and ensures that there are minimal data aggregates and
repetitive groups(c)
a) 1NF
b) 2NF
c) 3NF
d) All of the mentioned
Explanation: The first normal form is used to eliminate the duplicate information.
8. Which forms has a relation that possesses data about an individual entity:(c)
a) 2NF
b) 3NF
c) 4NF
d) 5NF
Explanation: A Table is in 4NF if and only if, for every one of its non-trivial multivalued
dependencies X \twoheadrightarrow Y, X is a superkey—that is, X is either a candidate key
or a superset thereof.
10.
For any pincode, there is only one city and state. Also, for given street, city and state,
there is just one pincode. In normalization terms, empdt1 is a relation in(b)
a) 1 NF only
b) 2 NF and hence also in 1 NF
11
1. We can use the following three rules to find logically implied functional
dependencies. This collection of rules is called(b)
a) Axioms
b) Armstrong’s axioms
c) Armstrong
d) Closure
4. Inst_dept (ID, name, salary, dept name, building, budget) is decomposed into(d)
5. There are two functional dependencies with the same set of attributes on the left
side of the arrow(a)
A->BC
A->B
This can be combined as
a) A->BC
b) A->B
c) B->C
12
7. Suppose we wish to find the ID’s of the employees that are managed by people
who are managed by the employee with ID 123. Here are two possible queries(a)
I.SELECT ee.empID
FROM Emps ee, Emps ff
WHERE ee.mgrID = ff.empID AND ff.mgrID = 123;
II.SELECT empID
FROM Emps
WHERE mgrID IN
(SELECT empID FROM Emps WHERE mgrID = 123);
Which, if any, of the two queries above will correctly (in SQL2) get the desired set of
employee ID’s?
a) Both I and II
b) I only
c) II only
d) Neither I nor I
8. Suppose relation R(A,B) currently has tuples {(1,2), (1,3), (3,4)} and relation S(B,C)
currently has {(2,5), (4,6), (7,8)}. Then the number of tuples in the result of the SQL query:
<i>SELECT *
FROM R NATURAL OUTER JOIN S; </i>IS:
a) 2
b) 4
c) 6
d) None of the mentioned
Answer: a
A -> B
13
B -> C
BC -> A
A -> D
E -> A
D -> E
3. R (A,B,C,D) is a relation. Which of the following does not have a lossless join
dependency preserving BCNF decomposition?(d)
a) A->B, B->CD
b) A->B, B->C, C->D
c) AB->C, C->AD
d) A->BCD
5. The algorithm that takes a set of dependencies and adds one schema at a time,
instead of decomposing the initial schema repeatedly is(c)
a) BCNF algorithm
b) 2NF algorithm
c) 3NF synthesis algorithm
d) 1NF algorithm
6. The functional dependency can be tested easily on the materialized view, using the
constraints ____________.(d)
a) Primary key
b) Null
c) Unique
d) Both Null and Unique
7. Which normal form is considered adequate for normal relational database design?
(d)
a) 2NF
14
b) 5NF
c) 4NF
d) 3NF
9. A table has fields F1, F2, F3, F4, and F5, with the following functional dependencies:
F1->F3
F2->F4
(F1,F2)->F5
10. Let R(A,B,C,D,E,P,G) be a relational schema in which the following FDs are known
to hold(d)
AB->CD
DE->P
C->E
P->C
B->G
1. The normal form which satisfies multivalued dependencies and which is in BCNF
is(a)
a) 4 NF
b) 3 NF
c) 2 NF
d) All of the mentioned
3. The main task carried out in the __________ is to remove repeating attributes to
separate tables.(a)
15
5. Which forms has a relation that possesses data about an individual entity?(c)
a) 2NF
b) 3NF
c) 4NF
d) 5NF
7. Which of the following has each related entity set has its own schema and there is
an additional schema for the relationship set?(a)
a) A many-to-many relationship set
b) A multivalued attribute of an entity set
c) A one-to-many relationship set
d) None of the mentioned
10. In 2NF(c)
a) No functional dependencies (FDs) exist
b) No multivalued dependencies (MVDs) exist
c) No partial FDs exist
16