Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
2NF Normal Form:
A relation schema process R is in 2NF if it is in 1NF and each non-prime attribute A in R is fully functionally related on primary key. Second normal form (2NF) is a normal process needed in database normalization. 2NF was originally described by E.F. Codd in 1971. A table that is in first normal form (1NF) must accept additional criteria if it is to accept for second normal form. A table is in 2NF if and only if, it is in 1NF and no non prime attribute is related on any proper subset of any candidate key of the table.
List two restrictions that are applied on the modification (updation, insertion or deletion) of base tables through view. Ans: The two restrictions are: 1. If a view
Complexity : A distributed DBMS that is available, reliable, and secure is inherently more difficult than a centralised DBMS. Though, adequate data replication is essential to have
Explain the Check Clause The CHECK clause is employed to at the end of a CREATE TABLE statement specify table constraints. This is known as table-based constraint because it ap
What is data independence? Data Independence: Techniques which permit data to be changed without affecting the applications in which procedure it. There are two types of data
1. Define each of the following IN YOUR OWN WORDS: (a) File: (b) Record: (c) Field: (d) Primary Key: (e) Secondary Key: 2. A travel agency wants t
QUESTION (a) Give two advantages of using Linked List as compared to arrays. (b) (i) You are working as programmer at the Orange Mauritius branch. You have been asked to cre
What are metrics for choosing the best algorithm? Matrices for choosing the best algorithms are as below: Computational complexity Ease of understand ability and im
what do you mean by consistency in rdbms?
1. Which relational algebra operations do not need the participating tables to be union-compatible? Ans: Join is the relational algebra operations that do not need the particip
These permit the user to unload a database or parts of a database and reload the data on the similar machine, or on another machine in a dissimilar location. This can be useful in
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd