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 3d node. Similarly 6h (last) node connected back to 1" 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 M calculate all other edges value and then applied Floyd Algorithm. Page I of 2
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 3d node. Similarly 6h (last) node connected back to 1" 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 M calculate all other edges value and then applied Floyd Algorithm. Page I of 2
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
This question is related from analysis of
![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 2™d and 3d node. Similarly 6h (last) node connected back to 1" 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 M
calculate all other edges value and then applied Floyd Algorithm.
Page I of 2](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fc3b2f39c-2d0b-4c1f-8841-3bd5e5cd8916%2F01f19904-d589-4504-81ad-d6feea99f399%2F6chtgp_processed.jpeg&w=3840&q=75)
Transcribed Image Text: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 2™d and 3d node. Similarly 6h (last) node connected back to 1" 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 M
calculate all other edges value and then applied Floyd Algorithm.
Page I of 2
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Concepts of Database Management](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY