data redundancy increases
data is dependent on programs
data is integrated and can be accessed by multiple programs
none of the above
C. data is integrated and can be accessed by multiple programs
2NF
5NF
4NF
3NF
<>
<
=<
>=
Statistical
Mathematical
Normalized
Un normalized
Default
Index
Rule
View
Snapshot
Dynaset
Stateless
Stateful
Hierarchical schema
Network schema
Relational Schema
All of the above
schema
instance of the database
data domain
independence
Data Flow Document
Data File Diagram
Data Flow Diagram
Non of the above
Sub
Parent
Candidate
Super
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.
Similarity
Granularity
Dimensionality
Arity
data is defined separately and not included in programs.
programs are not dependent on the physical attributes of data
programs are not dependent on the logical attributes of data
both B and C
Like
COMPARE
BETWEEN
IN
Total participation.
Multiple participation.
Cardinality N.
None of the above.
weak entity sets
weak relationship sets
strong entity sets
strong relationship sets
Deferred update
Immediate update
Two-phase commit
Shadow paging
Database
Data
Transaction
Record
data redundancy increases
data is dependent on programs
data is integrated and can be accessed by multiple programs
none of the above
Both undo and redo.
Undo but no redo.
Redo but no undo.
Neither undo nor redo.
Software
Server
Program
Client
Integrity
Availability
Confidentiality
Discretionary Security
It is a physical representation of the data.
It allows many to many relationship.
It is conceptually simple.
It will be the dominant database of the future.
Secondary key
Alternate key
Unique key
Primary key
Union
Intersection
Difference
Join
Primary storage
Secondary Storage
All
Tertiary Storage
BCNF
3NF
PJNF
DKNF
2NF
3NF
BCNF
4NF
Edgar. W
Edward Stephen
Edgar F. Codd
Edward Codd
Commutative
Associative
idempotent
distributive
Two - phase locking
Graph-based locking
Time-stamp based locking
None of these .