1NF and 2NF Comparison

Difference between 1NF and 2NF / Comparison of 1NF and 2NF / Compare 1NF and 2NF / 1NF and 2NF Comparison / 1NF and 2NF difference

Properties to be satisfied for 1NF and 2NF (recall)

1NF – All attribute values are atomic values, i.e, no repeating group or no composite attributes present.

2NF – Table should be in 1NF and no partial functional dependency presents.

Properties	1NF	2NF
Attribute Domain	Should be Atomic	Should be Atomic
Functional Dependencies Identification	Not necessary	Must
Handling of Update Anomalies	Does not handle. It deals with the basic structure of a relation.	Handle update anomalies.
Composite Key as Primary Key	Primary Key can be Composite key	Primary Key cannot be Composite key always. It may violate 2NF if partial key dependency exists. That is, no partial functional dependency is permitted
Goal	Eliminate Redundant Data	Ensure Data Dependencies

*********

Related Links

• Go to Normal Form - Home page

• Go to Normalization - Home page

• Go to Normalization Solved Exercises - Home page

• Go to Comparison of All Normal Forms page

Compare first normal form 1nf with second normal form 2nf in dbms

Distributed Database - Quiz 1

1. Let us suppose that in a distributed database, during a transaction T1, one of the sites, say S1, is failed. When recovers, the site S1 has to check its log file (log based recovery) to decide the next move on the transaction T1. If the log contains a record, what the site S1 has to do?

Need not do anything
Perform Undo
Perform Redo
Abort the transaction

2. Global Wait-for graph is used for ________________ in Distributed database.

Handling concurrency control
Handling failures
Handling deadlock
None of the above

3. In Distributed database, ______________ are the transactions for which a log is found in the log file, but neither a log nor an log is found.

In-doubt transactions
Serialized transactions
Cascadeless transactions
Distributed transactions

4. While using commit protocols for handling atomicity issues, the distributed database system may enter into a situation called Blocking problem. Which of the following commit protocols can avoid Blocking problem?

Two-phase commit protocol
Three-phase commit protocol
Both of the above
None of the above

5. Which of the following concurrency control protocol is suitable for an application where frequency of read operation is much greater than that of write operation?

Majority protocol
Quorum-consensus protocol
Biased protocol
Single lock protocol

6. Which of the following parallel database architectures is/are mainly used by distributed database system?

Shared Memory
Shared Disk
Shared Nothing
Hierarchical

7. Which of the following is not a promise of distributed database?

Network Transparency
Replication Transaparency
Fragmentation Transparency
None of the above

8. All sites in a distributed database must commit at exactly the same instant. TRUE/FALSE

TRUE
FALSE

9. The real use of the Two-phase commit protocol is ______________

Deadlock will not occur
Concurrency control can be avoided
Atomicity, i.e, all-or-nothing commits at all sites
None of the above

10. Read one, write all available protocol is used to increase ___________ in a distributed database system.

Availability
Robustness
Both Availability and Robustness
Neither Availability nor Robustness

Score =

Correct answers:

CS 9221 / 241204 Database Technology question paper – June 2012

CS 9221 / 241204 Database Technology question paper – June 2012 / Anna University Previous Year Exam Questions / Anna University Previous Year M.E. M.Tech. Computer Science and Information Technology Question Papers

Question Paper Code : 81230 M.E. DEGREE EXAMINATION, JUNE 2012 Second Semester Computer Science and Engineering CS 9221 / 241204 / 8241204 CS 921 — DATABASE TECHNOLOGY (Common to M.E. Computer Science and Engineering) (Regulation 2009) Time: Three hours                                                       Maximum: 100 Marks Answer ALL Questions PART A — (10 × 2 = 20 Marks) 1. What are the Distributed databases? 2. Define Concurrency control. 3. What are Object Oriented Databases? 4. What is Persistence? 5. Define Data Mining. 6. Give two features of Mobile Databases. 7. Define Normalization. 8. Define Integrity. 9. What are Active Databases? 10. Give two features of text database. PART B — (5 × 16 = 80 Marks) 11. (a) (i) Compare Distributed Databases and Conventional Databases. (10) (ii) Explain Query Processing. (6) Or (b) (i) Describe the architecture of Distributed Databases. (8) (ii) Explain Transaction Processing and Concurrency Control. (8) 12. (a) Give a brief account on Approaches, Modeling and Design of Object Oriented Databases. (16) Or (b) Discuss about: (i) Persistence (4) (ii) Multiversion locks (8) (iii) Recovery (4) 13. (a) Discuss about Web databases and Mobile databases. (16) Or (b) Give a brief account on Data Warehousing and Data Mining. (16) 14. (a) (i) Explain E-R model with an example. (8) (ii) Discuss about Database Tuning. (8) Or (b) Describe the design of Temporal Databases and Spatial Databases. (16) 15. (a) Discuss about Deductive databases and Spatial database. (16) Or (b) Explain the features of Multimedia databases and Image databases. (16) ____________________