Which normal form is considered adequate for normal relational database design?
2NF
5NF
4NF
3NF
Correct Answer :
D. 3NF
Related Questions
A table can have only one
Secondary key
Alternate key
Unique key
Primary key
It is an abstraction through which relationships are treated as higher level entities
Generalization.
Specialization.
Aggregation.
Inheritance.
The transactions like adding an employee, enrolling a student in a course are examples of _______
Logical
Physical
None
Theoretical
Which of the following is not comparison operator?
<>
<
=<
>=
Relations produced from an E-R model will always be
First normal form.
Second normal form.
Third normal form.
Fourth normal form.
In an E-R diagram double lines indicate
Total participation.
Multiple participation.
Cardinality N.
None of the above.
An outstanding functionality of SQL is its support for automatic_____ to the target data.
programming
navigation
functioning
notification
The clause alter table in SQL can be used to
add an attribute
delete an attribute
alter the default values of an attribute
all of the above
The metadata is created by the
DML compiler
DML pre-processor
DDL interpreter
Query interpreter
Which of the following is not a recovery technique?
Deferred update
Immediate update
Two-phase commit
Shadow paging
What is a disjoint less constraint?
It requires that an entity belongs to no more than one level entity set.
The same entity may belong to more than one level.
The database must contain an unmatched foreign key value.
An entity can be joined with another entity in the same level entity set.
Which of the following relational algebra operations do not require the participating tables to be union-compatible?
Union
Intersection
Difference
Join
The ______ indexes are forced to store only record IDs in the data structure and require at least one additional I/O Operation to retrieve the actual record.
Clustered
Hashed
Un-clustered
Collision
A ____ key specifies a uniqueness constraint that no two distinct tuples in any state r of relation R can have the same value for super key.
Sub
Parent
Candidate
Super
Which of the following is not a characteristic of a relational database model?
Table
Tree like structure
Complex logical relationship
Records
Drop Table cannot be used to drop a table referenced by a ______ constraint.
Primary Key
Local Key
Foreign Key
Composite Key
_____clause is an additional filter that is applied to the result.
Select
Order by
Group-by
Having
The ____ operator joins two or more conditions and displays rows only if that rows data satisfies all conditions specified.
OR
AND
NOT
ALL
Whenever two independent one-to-many relationships are mixed in the same relation, a __________ arises.
Functional dependency
Multi-valued dependency
Transitive dependency
Partial dependency
Which of the following aggregate functions does not ignore nulls in its results?.
COUNT .
COUNT (*)
MAX
MIN
Data items grouped together for storage purposes are called a
record
string
title
list
______defines the structure of a relation which consists of a fixed set of attribute-domain pairs.
Instance
Program
Schema
Super Key
Given the following relation S(SNO,SNAME,CITY) write a query to update the value of CITY to KANPUR for the supplier S1.
UPDATE S CITY = KANPUR WHERE SNO=S1
UPDATE S SET CITY = KANPUR FOR SNO=S1
UPDATE S SET CITY = KANPUR WHERE SNO=S1
UPDATE S RENAME CITY = KANPUR WHERE SNO=S1
The clause in SQL that specifies that the query result should be sorted in ascending or descending order based on the values of one or more columns is
View
Order by
Group by
Having
The common column is eliminated in
theta join
outer join
natural join
composed join
Checkpoints are a part of
Recovery measures.
Security measures.
Concurrency measures.
uthorization measures.
The fact that all employees of a particular organization should not have salaries more than $10000 is a _____ constraint.
Schema
Tuple
Domain
Relational
If the closure of an attribute set is the entire relation then the attribute set is a
superkey
candidate key
primary key
not a key
The division operator divides a dividend A of degree m+n by a divisor relation B of degree n and produces a result of degree
m - 1
m + 1
m * m
m
____specifies a search condition for a group or an aggregate.
GROUP BY Clause
HAVING Clause
FROM Clause
WHERE Clause