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 6" (last) node connected back to 1" and 2nd node. Eg. 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.

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 6" (last) node connected back to 1" and 2nd node. Eg. 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.

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

Similar questions

Understanding the purpose of a virtual machine is crucial.
que 3 Computer Science sin(x) can be represented well by a six or seven term polynomial for all values in its domain (e.g., all real numbers). Could something similar be done for ex? Why or why not?
Computer science--1. Find mod (45, 5) and div (45, 5). mod(45, 5)=? div(45, 5)=?.
After an exhaustive list of all of the mathematical operations has been collected, the steps in that list should be organised in a methodical fashion.
Has an agreed set of criteria for Algorithm Analysis been developed?
You are advised to refer to the recommended textbook “Introduction to Algorithms (3rdedition) by Thomas H. Corman, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein”. Have areading through Chapter 04 and answer the following questions as a follow up exercise 1) Compute big-oh of the given T(n) using Recursion Tree Method
The Fibonacci series can be defined recursively as: F1 = 0; F2 = 1; and Fn = Fn-2 + Fn-1. Show inductively that: (F1)2 + (F2)2 + ... + (Fn)2 = (Fn)(Fn+1).
Discrete Mathematics Give 2 examples of Complexity and Algorithms
When solving a system of equations, how does one go about doing it numerically? Tell me how at least one of the algorithms works using just your own words?
Let n be an integer such that n>0. Consider the alphabet = {0, 1, 2} and let a,, denote the number of strings over Σ with length n which do not contain two consecutive zeros? Derive a recursive definition for the above scenario.
Explain the five distinctions between Prim's and Kruskal's algorithms.
Because even though we may not understand them, algorithms can help us solve problems.