WorksheetsCA3 DBMS
Total questions: 20
Worksheet time: 12mins
Views can be created for?
One table
Many table
Another view
All of the above
A view is actually a?
composition of a table the above
decomposition of a table
associated to a table
None of these
What is syntax for delete the view?
DELETE VIEW view_name;
DROP VIEW view_name/table_name;
DROP VIEW view_name;
DROP VIEW table_name;
You can perform ______ operation(s) on SQL Views?
Filter
Sort
Join
All of the above
Which of the following specifies when the trigger will be executed?
BEFORE
AFTER
All of the above
Which of the operation are not specifies in triggers?
Alter
UPDATE
INSERT
DELETE
To combine multiple retrievals, we write several SELECT statements and put the keyword between them. What is the keyword?
COMBINE
CONCAT
JOIN
UNION
Which keyword used with UNION does not retain duplicate rows?
A. ALL
B. NARROW
C. STRICT
D. DISTINCT
Which of the following is not Constraint in SQL?
Primary Key
Not Null
Check
Union
A functional dependency is a relationship between or among
A. Entities
B. Rows
C. Attributes
D. Tables
The database design prevents some data from being stored due to _______.
A. Deletion anomalies
B. Insertion anomalies
C. Update anomalies
D. Selection anomalie
If one attribute is determinant of second, which in turn is determinant of third, then the relation cannot be:
A. Well-structured
B. 1NF
C. 2NF
D. 3NF
Consider the relation Sale(Date, Customer, Product, Vendor, VendorCity, SalesRep){Date, Customer, Product} is the composite candidate key and the following functional dependencies are also given:Vendor -> VendorCity, Product -> VendorWhat is the highest normal form of the sale relation?
1NF
2NF
3NF
BCNF
Consider a relation R(A, B, C, D) with the following functional dependencies: A -> (B, C, D), (A, D) -> (B, C) and (C, D) -> (A, B). Identify the candidate key(s).
{A}
{A}, {C, D}
{A}, {C, D}, {A, D}
{C, D}
A relation is in 2NF if:
All the values of non-key attributes are dependent fully on the candidate key.
Any non-key attribute that are dependent on only part of the candidate key should be moved to another relation where the partial key is the actual full key.
It must be already in the 1NF.
All of the above.
4NF is designed to cope with :
Transitive dependency
Join dependency
Multi valued dependency
None of these
5NF is designed to cope with :
Transitive dependency None of these
Join dependency
Multi valued dependency
None of these
Consider the schema R(S,T,U,V) and the dependencies S→T, T→U, U→V, V→S. Let R= {R1,R2} such that R1∩R2=Φ. Then the decomposition is :
not in 2NF
in 2NF but not in 3NF
in 3NF but not in 2NF
in both 2NF and 3NF
Third normal form is based on the concept of _________
Closure Dependency
Transitive Dependency
Normal Dependency
Functional Dependency
R(A,B,C,D) is a relation, Which of the following does not have a lossless join dependency preserving BCNF decomposition
A->B, B->CD
A->B, B->C,C->D
AB->C, C->AD
A->BCD
