Using MIS (9th Edition)
9th Edition
ISBN: 9780134106786
Author: David M. Kroenke, Randall J. Boyle
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 5, Problem 5.6CE5
Program Plan Intro
E-R model:
- E-R model is a tool for creating data model.
- It is used for developers to describe the content of data model by using two functions called entities and relationships.
Entity:
- Entity helps the user for tracking something in
database . - Example entities in student database system are Student, Grade, Course, etc.
Relationships:
- Entities have relationships among each other.
- For example, in student database, a Student has a relationship to Major and Student has a relationship to Advisor.
Maximum cardinality:
Maximum cardinality is referred as maximum number of entities that are involved in a relationship.
The three examples of maximum cardinality are:
- l:N(one to Many relationship)
- 1:1(one to one relationship)
- N:M(Many to many relationship)
Minimum cardinality:
- It gives the minimum number of entities that are required for relationship.
- Controls on minimum requirements are referred as minimum cardinality.
The two examples of minimum cardinality are:
- It could contain 0 relationship
- It could contain 1 relationship
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Subject: Computer databases please show all the work, draw the ER diagram
Subject: Computer databases please show all the work, draw the ER diagram
Subject: Computer databases please show all the work, draw the ER diagram
Chapter 5 Solutions
Using MIS (9th Edition)
Ch. 5.2 - Prob. 1EGDQCh. 5.2 - Prob. 2EGDQCh. 5.2 - Prob. 3EGDQCh. 5.2 - Prob. 4EGDQCh. 5.2 - Prob. 5EGDQCh. 5.2 - Prob. 6EGDQCh. 5.2 - Prob. 7EGDQCh. 5.2 - Prob. 8EGDQCh. 5.3 - Prob. 1NWDSCh. 5.3 - Prob. 2NWDS
Ch. 5.3 - Prob. 3NWDSCh. 5.3 - Prob. 4NWDSCh. 5.3 - Prob. 5NWDSCh. 5.8 - Prob. 1SGDQCh. 5.8 - Prob. 2SGDQCh. 5.8 - Prob. 3SGDQCh. 5.8 - Prob. 4SGDQCh. 5.8 - Prob. 5SGDQCh. 5.8 - Prob. 6SGDQCh. 5.8 - Prob. 7SGDQCh. 5.8 - Prob. 1IKDMCh. 5.8 - Prob. 2IKDMCh. 5.8 - Prob. 3IKDMCh. 5.8 - Prob. 4IKDMCh. 5.8 - Prob. 1ARQCh. 5.8 - Prob. 2ARQCh. 5.8 - Prob. 3ARQCh. 5.8 - Prob. 4ARQCh. 5.8 - Prob. 5ARQCh. 5.8 - Prob. 6ARQCh. 5.8 - Prob. 7ARQCh. 5.8 - Prob. 8ARQCh. 5 - Prob. 5.1UYKCh. 5 - Prob. 5.2UYKCh. 5 - Prob. 5.3UYKCh. 5 - Prob. 5.4UYKCh. 5 - Prob. 5.5CE5Ch. 5 - Prob. 5.6CE5Ch. 5 - Prob. 5.7CE5Ch. 5 - Prob. 5.8CE5Ch. 5 - Prob. 5.9CE5Ch. 5 - Prob. 5.10CE5Ch. 5 - Prob. 5.11CE5Ch. 5 - Prob. 5.12CE5Ch. 5 - Prob. 5.13CS5Ch. 5 - Prob. 5.14CS5Ch. 5 - Prob. 5.15CS5Ch. 5 - Prob. 5.16CS5Ch. 5 - Prob. 5.17CS5Ch. 5 - Prob. 5.18CS5Ch. 5 - Prob. 5.19CS5Ch. 5 - Prob. 5.2MMLCh. 5 - Prob. 5.21MML
Knowledge Booster
Similar questions
- module : java q1 and q2 in image Question3: (30 MARKS) Passenger Rail Agency for South Africa Train Scheduling System Problem Statement Design and implement a train scheduling system for Prasa railway network. The system should handle the following functionalities: 1. Scheduling trains: Allow the addition of train schedules, ensuring that no two trains use the same platform at the same time at any station. 2. Dynamic updates: Enable adding new train schedules and canceling existing ones. 3. Real-time simulation: Use multithreading to simulate the operation of trains (e.g., arriving, departing). 4. Data management: Use ArrayList to manage train schedules and platform assignments. Requirements 1. Add Train Schedule, Cancel Scheduled Train, View Train Schedules and Platform Management 2. Concurrency Handling with Multithreading i.e Use threads to…arrow_forwardmodule : java Question 1: (40 MARKS) E-Hailing Bicycle Management System Case Study:An e-hailing company that rents out bicycles needs a system to manage its bicycles, users, and borrowing process. Each user can borrow up to 2 bicycles at a time, specifically for families with children 18 years or below. The system must track the bicycles (name, make, type, and availability) and users (name, ID, and borrowed bicycles). The company also wants to ensure that the system uses a multidimensional array to store information about the bicycles. Requirements: Add and View Bicycles: Borrow Bicycles: Return Bicycles Display Borrowed Bicycles and Search for a bicycle Create a menu-driven program to implement the above. Sample Output: Add Bicycle View All Bicycles Borrow Bicycle Return Bicycle View Borrowed Bicycles Search Bicycle ExitEnter your choice:arrow_forwardthis module is java 371. please answer all questions correctly , include all comments etc and follow all requirements. Question 1: (40 MARKS) E-Hailing Bicycle Management System Case Study:An e-hailing company that rents out bicycles needs a system to manage its bicycles, users, and borrowing process. Each user can borrow up to 2 bicycles at a time, specifically for families with children 18 years or below. The system must track the bicycles (name, make, type, and availability) and users (name, ID, and borrowed bicycles). The company also wants to ensure that the system uses a multidimensional array to store information about the bicycles. Requirements: Add and View Bicycles: Borrow Bicycles: Return Bicycles Display Borrowed Bicycles and Search for a bicycle Create a menu-driven program to implement the above. Sample Output: Add Bicycle View All Bicycles Borrow Bicycle Return Bicycle View Borrowed Bicycles Search Bicycle ExitEnter your choice: Question 2…arrow_forward
- this module is java 371. please answer all questions correctly , include all comments etc and follow all requirements. Question 1: (40 MARKS) E-Hailing Bicycle Management System Case Study:An e-hailing company that rents out bicycles needs a system to manage its bicycles, users, and borrowing process. Each user can borrow up to 2 bicycles at a time, specifically for families with children 18 years or below. The system must track the bicycles (name, make, type, and availability) and users (name, ID, and borrowed bicycles). The company also wants to ensure that the system uses a multidimensional array to store information about the bicycles. Requirements: Add and View Bicycles: Borrow Bicycles: Return Bicycles Display Borrowed Bicycles and Search for a bicycle Create a menu-driven program to implement the above. Sample Output: Add Bicycle View All Bicycles Borrow Bicycle Return Bicycle View Borrowed Bicycles Search Bicycle ExitEnter your choice: Question 2…arrow_forwardwhat are some available cloud components, types, delivery models, and configurations in web services and cloud computing? thanksarrow_forwardI would like to get information to know features about the following concepts: 1. Anything as a Server (XaaS) 2. Block Storage 3. WebSocketarrow_forward
- 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…arrow_forwardExercise 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…arrow_forwardcheckpoint exercice for my students for Amortized Analysisarrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education