Normalization: The process used to minimize data redundancy and dependency in a relational database is known as normalization. The database table is divided into two or more tables and defines the relationship between those tables. First normal form (1NF): If a table does not contain any replicate fields or groups of fields then that model is called as first normal form. In this form, entities do not contain any single instance of the repeating variable. It means that the entities contain only one instance of the attributes, multi-valued attributes are neglected. Second normal form (2NF): The value of all non-primary key attributes should be dependent on the primary key attribute. If any attribute is depending on the partial primary key then it should determine the other attributes for an instance of the entity. The partial dependencies should be removed from the data model. Third normal form (3NF): The value of any non-primary key attributes will not depend on any other non-primary key attributes. If any non-primary key attributes depend on any other non-primary key attribute then it should be moved or deleted. It is termed as transitive dependency. Partial dependency: A partial dependency exists at that time of an attributes depends only a part of primary key. This dependency is related with 1 st normal form. Transitive dependency: A transitive dependency exists at that time of an attributes depends on another attribute which is not part of primary key. Functional dependency: An association between two attributes or two set of attributes in a same relational database table, which is having some constraints is known as functional dependency. In a table one attribute is functionally dependent on another attribute to take one value.

Question

make corrections of this program based on the errors shown. this is CIS 227 .

Answer 1

Question

100%

Chapter 6, Problem 7RQ

a.

Program Plan Intro

Normalization:

The process used to minimize data redundancy and dependency in a relational database is known as normalization. The database table is divided into two or more tables and defines the relationship between those tables.

First normal form (1NF):

If a table does not contain any replicate fields or groups of fields then that model is called as first normal form.

In this form, entities do not contain any single instance of the repeating variable.

It means that the entities contain only one instance of the attributes, multi-valued attributes are neglected.

Second normal form (2NF):

The value of all non-primary key attributes should be dependent on the primary key attribute.

If any attribute is depending on the partial primary key then it should determine the other attributes for an instance of the entity.

The partial dependencies should be removed from the data model.

Third normal form (3NF):

The value of any non-primary key attributes will not depend on any other non-primary key attributes.

If any non-primary key attributes depend on any other non-primary key attribute then it should be moved or deleted.

It is termed as transitive dependency.

Partial dependency:

A partial dependency exists at that time of an attributes depends only a part of primary key. This dependency is related with 1^st normal form.

Transitive dependency:

A transitive dependency exists at that time of an attributes depends on another attribute which is not part of primary key.

Functional dependency:

An association between two attributes or two set of attributes in a same relational database table, which is having some constraints is known as functional dependency.

In a table one attribute is functionally dependent on another attribute to take one value.

b.

Explanation of Solution

Dependencies diagrams for each database table:

Table1:

Create the database table with name of Table1 is given below:

Table1 (ISBN, BookTitle, Edition)

Here, “ISBN” indicates the primary key.

“BookTitle” and “Edition” are partial dependent on ISBN.

Normal form:

The relation is in third normal form (3NF), since there is no transitive dependency and no repeated attributes.

The representation of dependency diagram for table1 is shown below:

Table2:

Create the database table with name of Table2 is given below:

Table2 (BookTitle, Publisher)

“BookTitle” are transitive dependent on “Publisher”.

Normal form:

The relation is in second normal form (2NF), because there is transitive dependency in this database table.

The representation of dependency diagram for table2 is shown below:

Table3:

Create the database table with name of Table3 is given below:

Table3 (Author_Num, LastName)

Here, “Author_Num” indicate the primary key...

Expert Solution & Answer

Trending nowThis is a popular solution!

See solution

Check out sample textbook solution

Students have asked these similar questions

make corrections of this program based on the errors shown. this is CIS 227 .

Create 6 users: Don, Liz, Shamir, Jose, Kate, and Sal. Create 2 groups: marketing and research. Add Shamir, Jose, and Kate to the marketing group. Add Don, Liz, and Sal to the research group. Create a shared directory for each group. Create two files to put into each directory: spreadsheetJanuary.txt meetingNotes.txt Assign access permissions to the directories: Groups should have Read+Write access Leave owner permissions as they are “Everyone else” should not have any access Submit for grade: Screenshot of /etc/passwd contents showing your new users Screenshot of /etc/group contents showing new groups with their members Screenshot of shared directories you created with files and permissions

⚫ your circuit diagrams for your basic bricks, such as AND, OR, XOR gates and 1 bit multiplexers, ⚫ your circuit diagrams for your extended full adder, designed in Section 1 and ⚫ your circuit diagrams for your 8-bit arithmetical-logical unit, designed in Section 2. 1 An Extended Full Adder In this Section, we are going to design an extended full adder circuit (EFA). That EFA takes 6 one bit inputs: aj, bj, Cin, Tin, t₁ and to. Depending on the four possible combinations of values on t₁ and to, the EFA produces 3 one bit outputs: sj, Cout and rout. The EFA can be specified in principle by a truth table with 26 = 64 entries and 3 outputs. However, as the EFA ignores certain inputs in certain cases, it is easier to work with the following overview specification, depending only on t₁ and to in the first place: t₁ to Description 00 Output Relationship Ignored Inputs Addition Mode 2 Coutsjaj + bj + Cin, Tout= 0 Tin 0 1 Shift Left Mode Sj = Cin, Cout=bj, rout = 0 rin, aj 10 1 1 Shift Right…