The algorithm is based on five steps. But before it can begin, the input must be in a certain format to recognize the source and target fields. To keep things really simple, we expect the first column to be the source, second column the target, and the third column a name for the arrow going from source to target. And this is put on a sheet called “Data”. 7 102 Beginner’s Guide to Code Algorithms 102 Step 1: Review the “Data” list and create a list of entities in a tab called “Entities”. An entity is a thing with a unique name. So we basically go through columns A and B and create a single list with all unique names. Step 2: Count up the number of connections for these entities and make a note of these as shown below. Entity From Count To Count Total Count AD 1 0 SAP R3 4 0 Applicant Insight 1 0 Bank of America 1 0 Transcentive 1 0 Bright Horizon 1 0 E&Y 1 0 EDW 5 1 0 EMS 1 0 SuccessFactors 1 0 TeamConnect 1 0 Transecure Travel 1 0 Step 3: Draw the rectangles for each entity. Step 4: Draw the arrows for each pair of entity and set the labels to be the names in column C of the data. Step 5: If the same “From” entity is connected to multiple “To” entities, or the same “To” entity is connected to many “From” entities, this is not very easy to print on the diagram. Create a special table for this during the previous steps. In this step, the diagram is already drawn, so finish by printing the table that holds the multiple source or multiple target labels.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

The algorithm is based on five steps. But before it can begin, the input must be in a
certain format to recognize the source and target fields. To keep things really simple,
we expect the first column to be the source, second column the target, and the third
column a name for the arrow going from source to target. And this is put on a sheet
called “Data”.
7
102 Beginner’s Guide to Code Algorithms
102
Step 1:
Review the “Data” list and create a list of entities in a tab called “Entities”. An
entity is a thing with a unique name. So we basically go through columns A and
B and create a single list with all unique names.
Step 2:
Count up the number of connections for these entities and make a note of these as
shown below.
Entity From Count To Count Total Count
AD 1 0
SAP R3 4 0
Applicant Insight 1 0
Bank of America 1 0
Transcentive 1 0
Bright Horizon 1 0
E&Y 1 0
EDW 5 1 0
EMS 1 0
SuccessFactors 1 0
TeamConnect 1 0
Transecure Travel 1 0
Step 3:
Draw the rectangles for each entity.
Step 4:
Draw the arrows for each pair of entity and set the labels to be the names in column
C of the data.
Step 5:
If the same “From” entity is connected to multiple “To” entities, or the same “To”
entity is connected to many “From” entities, this is not very easy to print on the
diagram. Create a special table for this during the previous steps. In this step, the
diagram is already drawn, so finish by printing the table that holds the multiple
source or multiple target labels.

Expert Solution
steps

Step by step

Solved in 5 steps

Blurred answer
Knowledge Booster
Intelligent Machines
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education