Noise
Delay distortion
Attenuation distortion
Dispersion
B. Delay distortion
empty
nonempty
contains null values
none of the above
4 NF
3 NF
2 NF
1 NF
Partially aborted
Partially committed
Aborted
Committed
converting data to insert in a database
translation of query to lower form
range of activities involved in extracting data from a database
none of the above
m+1
m
m-1
m/2
Lost Update
Uncommitted Dependency
Inconsistent Data
All of the above
Conceptual and view
Only physical
Physical and conceptual
Only conceptual
executable statement.
declarative statement.
Ordered file
none of the above
data is dependent on programs.
data redundancy increases.
data is integrated and can be accessed by multiple programs.
none of the above.
top-down approach.
bottom-up approach.
left-right approach.
none of the above
active rules
passive rules
inferences
none of the above
as
by
from
none of the above
Inner join
Outer join
union
Intersect
DBMS, same site
OS ,same site
DBMS ,different site
OS ,different site
B-Tree File
Hashed File
Indexed File
Sequential file.
where
exist
with
select
SQL permits attribute names to be repeated in the same relation.
a SQL query automatically eliminates duplicates.
a SQL query will not work if there are no indexes on the relations
None of these
Ring
Tree
Switch
Graph
Newsgroups
10Km to 1Km
10^3Km to 100Km
100M to 10M
Logging
Recovery manager
Both A and B are true
Both A and B are false
primary storage
secondary storage
tertiary storage
none of the above
Attenuation
Distortion
Delay
Noise
primarykey
superkey
candidatekey
foreignkey
users.
separate files.
database.
database administrator.
Data independence
Centralized control of data
Neither A) nor B)
both A) and B)
Relation dependencies
Data dependencies
key dependencies
none of the above
i and ii only
ii and iii only
i and iii only
All i, ii iii
is allowed to pass them to others
is not allowed to pass them to others
may be or may not be allowed to pass them to others
none
project
select
rename
none of the above
in the left relation which didnt match with any tuple in right relation
in the left relation which matched with a tuple in right relation
in the right relation which didnt match with any tuple in left relation
in the right relation which matched with a tuple in left relation