Union
Intersection
Cartesian Product
Select
D. Select
Union.
Set difference.
Intersection.
All of the above.
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
Single
Three
Two
None
None
Multi
Single
Concurrent
It will result in a deadlock situation.
It will immediately be rejected.
It will immediately be granted.
It will be granted as soon as it is released by A .
With finer degree of granularity of locking a high degree of concurrency is possible.
Locking prevents non-serializable schedules.
Locking cannot take place at field level.
An exclusive lock on data item X is granted even if a shared lock is already held on X.
It is the data contained in database that is non redundant.
It is the data contained in database that is accurate and consistent.
It is the data contained in database that is secured.
It is the data contained in database that is shared.
Create table Employee(EMPNO int, EMPNAME char(10));
Create table Employee(EMPNO integer, EMPNAME String(10));
Create table Emplo(EMPNO number, EMPNAME string);
Create table Emp(EMPNO int, EMPNAME char(10));
Query
Embedded SQL
DDL
DCL
Conceptual, physical and internal
Conceptual, view and external
Logical, physical and internal
Logical, physical and view
Operationally, if Y is deleted, so is X
existence is dependent on Y.
Operationally, if X is deleted, so is Y.
Operationally, if X is deleted, & remains the same.
2NF
3NF
BCNF
4NF
jamming
password
documentation
record lock
Clustered
Hashed
Un-clustered
Collision
Edgar. W
Edward Stephen
Edgar F. Codd
Edward Codd
2NF
5NF
4NF
3NF
Schema
Tuple
Domain
Relational
Partition constraint.
Dependency preservation.
Redundancy.
Security.
Serializable schedule.
Recoverable schedule.
Deadlock free schedule.
Cascadeless schedule.
Data security
Derived columns
Hiding of complex queries
All of the above
Atomicity
Concurrency
Isolation
Durability
Tuple
Cardinality
Degree
Domain
Two - phase locking
Graph-based locking
Time-stamp based locking
None of these .
read Q
write Q
both read and write Q
write Q but not read Q
DISTINCT
UNIQUE
NULL
EXISTS
Oval; An oval with an underlined attribute
Circle; A circle with bolded attribute inside it
Diamond; A bolded attribute
Square; An attribute within the square
Code
Codd
Boyce Codd
Boyce
OR
AND
NOT
ALL
Fields
Records
Relations
Keys
Hierarchic Standard Access Method
Hierarchic Sequential Access Method
Hierarchic Sequential and Method
Hierarchic Standard and Method