Make a graph of unique capital letters of your Name then applied Floyd algorithm to findthe last matrix. (Note: If your Name is too long, then chose only six unique letters).Edge weight between two Nodes is the difference of ASCII table values of that letters.Suppose there is a Node „A‟ and „B‟. ASCII value of A=65 and B=66, difference ofB-A=1 (66-65=1). Every node is connected to next two node through edges i.e. 1st Nodeconnected with 2nd and 3rd node. Similarly 6th (last) node connected back to 1st and 2ndnode.E.g. If your Name is “USMAN ALI” then initially node of graphlook like this. ASCII value of U=85 and S=83 then edge weightbetween U and S is 85-83=2. Similarly make your name graph andcalculate all other edges value and then applied Floyd Algorithm. 1. Make a graph of unique capital letters of your Name then applied Floyd algorithm to findthe last matrix. (Note: If your Name is too long, then chose only six unique letters).Edge weight between two Nodes is the difference of ASCII table values of that letters.Suppose there is a Node A' and 'B’. ASCII value of A=65 and B=66, difference ofB-A=1 (66-65=1). Every node is connected to next two node through edges i.e. 1ª Nodeconnected with 2nd and 3rd node. Similarly 6th (last) node connected back to 1st and 2ndnode.E.g. If your Name is "USMAN ALI" then initially node of graphlook like this. ASCII value of U=85 and S=83 then edge weightbetween U and S is 85-83=2. Similarly make your name graph andcalculate all other edges value and then applied Floyd Algorithm.M

Answered: Image /qna-images/answer/9644cbf7-6850-47a3-9c02-759b377ea816.jpg

Answered: Make a graph of unique capital letters…

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

See similar textbooks

Related questions

Question

100%

Make a graph of unique capital letters of your Name then applied Floyd algorithm to find
the last matrix. (Note: If your Name is too long, then chose only six unique letters).
Edge weight between two Nodes is the difference of ASCII table values of that letters.
Suppose there is a Node „A‟ and „B‟. ASCII value of A=65 and B=66, difference of
B-A=1 (66-65=1). Every node is connected to next two node through edges i.e. 1
st Node
connected with 2nd and 3rd node. Similarly 6th (last) node connected back to 1st and 2nd
node.
E.g. If your Name is “USMAN ALI” then initially node of graph
look like this. ASCII value of U=85 and S=83 then edge weight
between U and S is 85-83=2. Similarly make your name graph and
calculate all other edges value and then applied Floyd Algorithm.

1. Make a graph of unique capital letters of your Name then applied Floyd algorithm to find
the last matrix. (Note: If your Name is too long, then chose only six unique letters).
Edge weight between two Nodes is the difference of ASCII table values of that letters.
Suppose there is a Node A' and 'B’. ASCII value of A=65 and B=66, difference of
B-A=1 (66-65=1). Every node is connected to next two node through edges i.e. 1ª Node
connected with 2nd and 3rd node. Similarly 6th (last) node connected back to 1st and 2nd
node.
E.g. If your Name is "USMAN ALI" then initially node of graph
look like this. ASCII value of U=85 and S=83 then edge weight
between U and S is 85-83=2. Similarly make your name graph and
calculate all other edges value and then applied Floyd Algorithm.
M

Expert Solution

Step by step

Solved in 7 steps with 8 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

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