top-down approach.
bottom-up approach.
left-right approach.
none of the above
B. bottom-up approach.
Object Linked Access Program
Organizational Architecture Processing
Online Analytical Processing
none of these
BCNF
Second
Third
Fourth
Transitive dependency
Partial transitive dependency
Functional dependency
Partial functional dependency
is the entire database.
is a standard way of organizing information into accessible parts.
describes how data is actually stored on disk.
both A) and C)
300MHz
1GHz
5GHz
10 GHz
Attributes
Weak entity set
Relationship sets
Multi-valued attributes
top-down approach.
bottom-up approach.
left-right approach.
none of the above
record
active data set
object
none of the above
rectangle.
square.
ellipse.
triangle.
Granted
Committed
Compensated
Accomplished
UPDATE
DROP
ALTER
DELETE
Relation
Table
Attribute
Entity
Insertion
Deletion
Update
All of the above
1
2
3
4
either committed or aborted
either partially committed or aborted
either committed or failed
none of these
i and ii only
ii and iii only
i and iii only
i only
Static SQL
Dynamic SQL
both
none of these
Thermal
Medium
Protocol
Impulse
top-down approach.
bottom-up approach.
left-right approach.
none of the above
the data items are locked in growing phase.
the data items are released in shrinking phase.
Both A and B are true
Both A and B are false
B8ZS
Manchester
RZ
NRZ-L
Simple Attribute
Composite Attribute
Multi-valued Attribute
Derived Attribute
Super query
Sub query
Master query
Multi-query
Create information table in the Database
Insertion of new information into the Database
Deletion of information in the Database
Modification of information in the Database
in 1NF also
in 2NF also
free from transitive dependencies
All of these
Data rate
Bit rate
Signal to Noise Ratio
Baud rate
i and ii only
ii and iii only
i and iii only
i only
Two concurrent processes attempt to interact with each other.
Two concurrent processes interact with different data files.
Two concurrent processes attempt to hold a data item .
none of the above.
BCNF is stronger than 3NF
Relational algebra is a non-procedural language
Every conflict serializable schedule is view serializable.
none of the above
not Null
Null
both Null & not Null.
any value.