1.

An attribute that is not part of any candidate key is known as

(1) Sub-prime attribute
(2) non-prime attribute
(3) sub-candidate key
(4) non-candidate key

Ans (2). The constituent attributes are called prime attributes. Conversely, an attribute that
does not occur in any candidate key is called a non-prime attribute.

2. Which of the follow is not the degree of relationship?

(1) Single
(2) Binary
(3) Ternary
(4) N-ary

Ans (1). Following are the degrees of Relationships.

1. Single Entity - Unary
2. Double Entities - Binary
3. Triple Entities - Ternary
4. N Entities - N- ary

3. The degree of the relationship is

(1) Number of Tables in a relationship
(2) Number of entities in a relationship
(3) Number of Row and Columns in a relationship
(4) Number of participating entities in a relationship

Ans (4) Degree of a Relationship refers to number of entity sets that participate in a
relationship set. Relationship sets that involve two entity sets are binary (or degree two).
Generally, most relationship sets in a database system are binary.

4. How many rules in “CODD’S RULES” of Relational Model of database systems?

(1) 11
(2) 12
(3) 13
(4) 14

Ans (2) Dr Edgar F. Codd, after his extensive research on the Relational Model of
database systems, came up with twelve rules of his own, which according to
him, a database must obey in order to be regarded as a true relational
database.

5. Every attribute has some predefined value scope that is called

(1) Tuple
 (2) Tables
(3) Attribute domain
(4) Relation schema

Ans (3) In computing, the attribute domain is the set of values allowed in an attribute. The domain is
an elementary type, and attribute domain the domain a given attribute belongs to an abstraction
belonging to or characteristic of an entity.

6. An attribute of a table cannot hold multiple values is the property of

(1) First Normal form (1NF)
(2) Second Normal form (2NF)
(3) Third Normal form (3NF)
(4) Fourth Normal form (4NF)

Ans (1) First normal form (1NF) is a property of a relation in a relational database. A relation is
in first normal form if and only if the domain of each attribute contains only atomic
(indivisible) values, and the value of each attribute contains only a single value from that
domain.

7. A key that consists of more than one attribute to uniquely identify rows in a table is called
(1) Composite key
(2) Candidate key
(3) Primary key
(4) Foreign key

Ans (1) A key that consists of more than one attribute to uniquely identify rows (also known
as records & tuples) in a table is called composite key.

8. In hierarchical model, data is organized into

(1) Logical structure
(2) Physical structure
(3) Tree like structure
(4) None of these

Ans (3) In hierarchical model, data is organized into a tree like structure with each record is
having one parent record and many children.

9. The key selected from the sets of candidate keys by database designer is called
(1) Primary key
(2) Secondary key
(3) Foreign key
(4) Super key

Ans (1) Primary key is being selected from the sets of candidate keys by database
designer.
 10. In an Entity-Relationship diagram “Double Rectangles” represents
(1) Relationship Set
(2) Weak Entity Sets
(3) Derived Attributes
(4) Multi-valued Attributes

Ans (2). We depict a weak entity set by double rectangles.

11. The minimal set of super key is called

(1) Primary key
(2) Secondary key
(3) Candidate key
(4) Foreign key

Ans (3) The minimal set of attribute which can uniquely identify a tuple is known as candidate
key. For Example, STUD_NO in STUDENT relation.

12. A relation that has no partial dependencies is in which normal form

(1) First
(2) Second
(3) Third
(4) BCNF

Ans (2) A relation is in 2NF if it has No Partial Dependency, i.e., no non-prime attribute
(attributes which are not part of any candidate key) is dependent on any proper subset of any
candidate key of the table.

13. A functional dependency between two or more non-key attributes is called

(1) Transitive dependency
(2) Partial transitive dependency
(3) Functional dependency
(4) Partial functional dependency

Ans (1) A functional dependency between two or more non-key attributes is called
Transitive dependency

14. A logical description of some portion of database that is required by a user to perform task
is called as
(1) System View
(2) User View
(3) Logical View
(4) Data View
Ans (2) User view is a logical description of some portion of the database that is required
by a user to perform some task

15. _________________ is a classical approach to database design?

(1) Left-Right approach
(2) Right-Left approach
(3) Top-Down approach
(4) None of the above

Ans (3). Database Design Strategies

There are two approaches for developing any database, the top-down method and the bottom-up
method. While these approaches appear radically different, they share the common goal of utilising
a system by describing all of the interaction between the processes.

Top – down design method

The top-down design method starts from the general and moves to the specific. In other words, you
start with a general idea of what is needed for the system and then work your way down to the more
specific details of how the system will interact. This process involves the identification of different
entity types and the definition of each entity’s attributes.

Bottom – up design method

The bottom-up approach begins with the specific details and moves up to the general. This is done
by first identifying the data elements (items) and then grouping them together in data sets. In other
words, this method first identifies the attributes, and then groups them to form entities.

16. ___________ refers to the correctness and completeness of the data in a database?
(1) Data Security
(2) Data Integrity
(3) Data Constraint
(4) Data Independence

Ans (2). The term data integrity refers to the correctness and completeness of the data in a
database.

17. A table that displays data redundancies yields __________ anomalies

(1) Insertion
(2) Deletion
(3) Update
(4) All of the above

Ans (4) The data redundancies yield the following anomalies:Update anomalies.Addition anomalies.
Deletion anomalies.
update anomaly – modifying the room for a class requires potentially many changes – if not done
– inconsistent

insert anomaly – cannot insert a student without having course info to go with them

delete anomaly – deletion of all sections for example a course loses info about the course as well
(and have to make sure get all students in the sections or inconsistent)

18. A lock that allows concurrent transactions to access different rows of the same table is known as
a
(1) Field-level lock
(2) Row-level lock
(3) Table-level lock
(4) Database-level lock

Ans (2) A lock that allows concurrent transactions to access different rows of the same table is known as
a Row-level lock

19. A type of query that is placed within a WHERE or HAVING clause of another query is called
(1) Super query
(2) Sub query
(3) Master query
(4) Multi-query

Ans (2). A subquery can be used in some cases in place of a join operation by indirectly linking
data between the tables, based on one or more conditions. When a subquery is used within a
query, then the subquery is resolved first, and then the main query is resolved according to the
conditions as resolved in the subquery. The subquery can either be used in the WHERE clause
or the HAVING clause of the main query.

20. A transaction completes its execution is said to be

(1) Saved
(2) Loaded
(3) Rolled
(4) Committed

Ans (4). If a transaction executes all its operations successfully, it is said to be committed.