Anomaly: Without normalization, redundancies occur in the table, and it may lead to errors or some sort of inconsistency. These are termed as anomalies. Anomalies occur when user wants to update the data in the table. There are three types of anomalies namely, Insertion anomaly, Deletion anomaly and Modification anomaly. Data redundancy: Data redundancy is presence of repeated data in the storage device. It consists of duplicate data that is additional to the actual data. In this, the data related to a folder can be seen in other folders. For example, file related to science folder can be seen in mathematics or social.

Question

Please answer JAVA OOP problem below: You are working at a university that tracks students. Each student is identified by their name and faculty advisor. Each faculty advisor is identified by their name, department, and maximum number of students they can advise. Using solid OO design principles, create a modular program that implements all the classes for the problem and also creates an implementation class that gathers user input for one student and then prints out the information gathered by creating the appropriate data definition and implementation classes. All data must be validated. I have given the code so far: Implementation: import javax.swing.JOptionPane; public class Implementation { public static void main(String[] args) { FacultyAdvisor facultyAdvisor = new FacultyAdvisor("Sharmin Sultana", "IT", 30); Student student = new Student("John", facultyAdvisor); JOptionPane.showMessageDialog(null, student.toString()); } } Student: public…

Answer 1

Question

Chapter 1, Problem 4P

Program Plan Intro

Anomaly:

Without normalization, redundancies occur in the table, and it may lead to errors or some sort of inconsistency. These are termed as anomalies.

Anomalies occur when user wants to update the data in the table.

There are three types of anomalies namely, Insertion anomaly, Deletion anomaly and Modification anomaly.

Data redundancy:

Data redundancy is presence of repeated data in the storage device. It consists of duplicate data that is additional to the actual data.

In this, the data related to a folder can be seen in other folders. For example, file related to science folder can be seen in mathematics or social.

Expert Solution & Answer

Trending nowThis is a popular solution!

See solution

Check out sample textbook solution

Students have asked these similar questions

Please answer JAVA OOP problem below: You are working at a university that tracks students. Each student is identified by their name and faculty advisor. Each faculty advisor is identified by their name, department, and maximum number of students they can advise. Using solid OO design principles, create a modular program that implements all the classes for the problem and also creates an implementation class that gathers user input for one student and then prints out the information gathered by creating the appropriate data definition and implementation classes. All data must be validated. I have given the code so far: Implementation: import javax.swing.JOptionPane; public class Implementation { public static void main(String[] args) { FacultyAdvisor facultyAdvisor = new FacultyAdvisor("Sharmin Sultana", "IT", 30); Student student = new Student("John", facultyAdvisor); JOptionPane.showMessageDialog(null, student.toString()); } } Student: public…

Exercise 1 Function and Structure [30 pts] Please debug the following program and answer the following questions. There is a cycle in a linked list if some node in the list can be reached again by continuously following the next pointer. #include typedef struct node { int value; struct node *next; } node; int 11_has_cycle (node *first) if (first == node *head { NULL) return 0;B = first; while (head->next != NULL) { if (head == first) { return 1; } head head->next; } return 0; void test_11_has_cycle() { int i; node nodes [6]; for (i = 0; i < 6; i++) nodes [i] .next = NULL; nodes [i].value i; } nodes [0] .next = &nodes [1]; nodes [1] .next = &nodes [2]; nodes [2] .next = &nodes [3]; nodes [3] .next = & nodes [4]; nodes [4] .next = NULL; nodes [5] .next = &nodes [0]; printf("1. Checking first list for cycles. \n Function 11_has_cycle says it hass cycle\n\n", 11_has_cycle (&nodes [0]) ?"a":"no"); printf("2. Checking length-zero list for cycles. \n Function 11_has_cycle says it has %s…

checkpoint exercice for my students for Amortized Analysis