Single
Three
Two
None
GROUP BY Clause
HAVING Clause
FROM Clause
WHERE Clause
Lost update problem.
Update anomaly.
Unrepeatable read.
Dirty read.
Secondary key
Alternate key
Unique key
Primary key
Logm(n)
(m+n)/2
Logm/2(m+n)
None of these
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));
Constraints
Triggers
Stored procedure
Cursors
Chain
Network
Tree
Relational
Commutative
Associative
idempotent
distributive
Statistical
Mathematical
Normalized
Un normalized
Select
Order by
Group-by
Having
None
Multi
Single
Concurrent
data redundancy increases
data is dependent on programs
data is integrated and can be accessed by multiple programs
none of the above
Similarity
Granularity
Dimensionality
Arity
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.
TCL
DCL
DDL
DML
Domain Integrity Constraints
Referential Integrity Constraints
Domain Constraints
Entity Integrity Constraints
Query
Embedded SQL
DDL
DCL
Indirect addressing
Indexed addressing
PC relative addressing
Base register addressing
Total participation.
Multiple participation.
Cardinality N.
None of the above.
Referential constraint.
Index.
Integrity constraint.
Functional dependency.
add an attribute
delete an attribute
alter the default values of an attribute
all of the above
Functional dependency
Multi-valued dependency
Transitive dependency
Partial dependency
Atomicity
Concurrency
Isolation
Durability
theta join
outer join
natural join
composed join
IX
IS
S
SIX
alter
update
set
create
SQL
System
Nested
None of these
Integrity
Availability
Confidentiality
Discretionary Security
Data security
Derived columns
Hiding of complex queries
All of the above