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...

See similar textbooks

Related questions

Q: In hill-climbing algorithms there are steps that make lots of progress and steps that make very…

A: Introduction: In the area of artificial intelligence, the heuristic search technique known as "hill…

Q: Volume of Histogram: Imagine a histogram (bar graph). Design an algorithm to compute the volume of…

A: Histogram A histogram is a graph that displays the values of a numeric variable's distribution as a…

Q: Write algorithm for Recursive Backtracking Algorithms pre-cond: I is an instance of the problem.…

A: given data: pre-cond: I is an instance of the problem.post-cond: optSol is one of the optimal…

Q: Look up the original papers by Warshall and by Roy(in French) in which they develop algorithms for…

A: Let's see the solution in the next steps

Q: Under what conditions will an algorithm that recursively summons itself no longer do so?

A: Recursion is a method in computer programming where a function calls itself Repeatedly until a…

Q: Exercise # 1: Dijkstra's Algorithm (a) Write a function named getShortestPath (graph, from, to) that…

A: Dijkstra's algorithm:- Dijkstra's Shortest Path First algorithm (SPF algorithm) is an algorithm for…

Q: Develop a string matching algorithm to find a pattern P of length m from a text T of length n (n >…

A: The string matching algorithm is shown below. StringMatch (T[0..n−1],P[0..m−1]) //Implements the…

Q: Investigate the problem with the graph's coloring. Examine both greedy and backtracking algorithms…

A: Introduction:

Q: Design and implement a recursive program that solves the Nonattacking Queens problem. That is, write…

A: The Nonattacking Queens problem is a classic problem in computer science and mathematics that…

Q: Everyday we experience some variety of recursion in our lives. Please give an example with (pusedo…

A: The situation: You have a credit that you make regularly scheduled installments. Premium builds…

Q: Neville's Iterated Interpolation To evaluate the interpolating polynomial P on the n + 1 distinct…

A: Neville's Iterated Interpolation is a mathematical method used to approximate a function's value at…

Q: A halting condition is required for all recursive algorithms; describe the halting condition for the…

A: Given: We have to discuss A halting condition is required for all recursive algorithms; describe…

Q: A knight's tour is a sequence of moves of a knight on a chessboard such that the knight visits every…

A: Python which refers to the high-level, general-purpose programming language. Its design which…

Q: Denn enne a language of polyn Give derivation for 5x²+7x.

A: Summary According to turing machine, Also, a formal language is recursive if there exists a…

Q: Explain and model the Tower of Hanoi game using recursion concepts. Show step by step the moves that…

A: In this question we will understand the working of tower of Hanoi game using recursion concepts. We…

Q: For this computer algorithms problem, you are given an N amount of cents, Then you are being asked…

A: Pseudocode: A pseudocode is a plain language description of the steps in an algorithm or another…

Q: Examples: Find the tight bound of the following recursive functions, T(n). T(n)=9T(n/3)+n T(n)=…

A: the solution is an given below :

Q: Compare the number of operations and time taken to compute Fibonacci numbers recursively versus that…

A: The iterative and recursive forms of Fibonacci numbers have significantly different running speeds.…

Q: Apply the divide-and-conquer Karatsuba algorithm to multiply 1234 × 4321 (in decimal). Stop the…

A: To apply the Karatsuba algorithm to multiply 1234 by 4321, we will use a divide-and-conquer…

Q: Investigate the problem with the colour of the graph. Examine both greedy and backtracking…

A: Basically, an algorithm is a methodical procedure. Backtracking Methodology: Place the queens in the…

Q: Give a recursive definition for the language STRANGE which is defined over the alphabet Σ = {a, b}…

A: The language STRANGE is defined over the alphabet Σ = {a, b} and encompasses strings with an even…

Q: Explain the distiction between an ambiguity in a proposed algorithm and an ambiguity in the…

A: The above question is solved in step 2 :-

Q: Implement a recursive function in Python that will sum of the num- bers in a finite array

A: Please find the answer below

Q: d the sets A and B if A- B = {1, 4, 7, 11}, B – A ={2, 20}, and A N B = {3, 5 ,19}

A: Set

Q: Write Java program to find Fibonacci Sequence using iterative and recursive solutions?

A: Code using iterative solution: Code using recursive solution:

Q: the simple code masks a more sophisticated computation, so studying these examples, tracing their…

A: Yes, that's correct. Simple code can often mask more sophisticated computations, making it important…

Q: Use the Euclidean algorithm to find the Greatest Common Divisor (GCD) of the numbers 1083974892 and…

A: Answer:

Q: A graph is a collection of vertices and edges G(V, E). A weighted graph has weights (numbers, etc.)…

A: We are authorized to answer one question at a time since you have not mentioned which question you…

Q: recursive algorithm performs 2 recursive calls. Assume the first recursive call is of size at most…

A: Solution :See we can write the recurrence relation as : T(n) = 3T(n/4) + T(n/4) + n Now we can solve…

Q: This is a MATLAB Coding problem: Implement a recursive function, called count, that takes two…

A: Code: function index=count(A,b) %defining the function n=numel(A); %determining the size of array…

Q: Recursive formulation algorithm

A: Lets see the solution.

Q: From Fundamentals of Discrete Math for Computer Science: A Problem-Solving Primer, 2nd edition Apply…

A: Answer :-

Q: Investigate the problem with the graph's coloring. Examine both greedy and backtracking algorithms…

A: Backtracking: Backtracking algorithm places queens in columns starting from the left Suppose Check…

Q: 3. Suppose that you have a computational problem A, input to A can be transformed to the input to…

A: Dear Student, Here we need to find whether the argument lower bound of is nlogn is true or not ,…

Q: n-17 .. n. For example, if n = 4 and k = 2, a solution is: [ [2,4], [3,4], [2,3], [1,2], [1,3],…

A: Machine independent language :- > the language which does not depend on the computer or its parts…

Q: Computer Science Compute the DFT of the vector x = [0, 1, 2, 3, 4, 5] by running FFT(x) using any…

A: Hello student Greetings Hope you are doing great. Thank You!!!

Q: kindly solve it with graph approach with the algorithm . Please elaborately explain each line of…

A: It is a directed graph and there is no cycle so it is a tree. Applying Depth first Search on the…

Question

This question is related from analysis of algorithms subject kindly solved it correctly

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

Process or set of rules that allow for the solving of specific, well-defined computational problems through a specific series of commands. This topic is fundamental in computer science, especially with regard to artificial intelligence, databases, graphics, networking, operating systems, and security.

Expert Solution