QuickHelper

(10)

$20/per page/

About QuickHelper

Levels Tought:
Elementary,High School,College,University,PHD

Expertise:
Accounting,Applied Sciences See all
Accounting,Applied Sciences,Business & Finance,Chemistry,Engineering,Health & Medical Hide all
Teaching Since: May 2017
Last Sign in: 387 Weeks Ago, 2 Days Ago
Questions Answered: 20103
Tutorials Posted: 20155

Education

  • MBA, PHD
    Phoniex
    Jul-2007 - Jun-2012

Experience

  • Corportae Manager
    ChevronTexaco Corporation
    Feb-2009 - Nov-2016

Category > Accounting Posted 23 Aug 2017 My Price 11.00

finding the shortest distance and the path for that distance from vertex A, statistics homework help

Question description

 

Complete the following in a paper of 1–2 pages:

  1. Consider the following graph: 
    1. Complete this table by finding the degree of each vertex, and identify whether it is even or odd:
    Vertex Degree Even/Odd
    A    
    B    
    C    
    D    
    E    
    F    
    G    
    H    
    1. What is the order of the graph?
    2. Construct the 10 x 10 adjacency matrix for the graph.
  2. The graph below illustrates a switching network. The weights represent the delay times, in nanoseconds, travelled by a data packet between destinations, represented by the vertices. 
    1. Complete the following table by finding the shortest distance and the path for that distance from vertex A to the other vertices:
    Vertex Shortest Distance from A Path from A
    B    
    C    
    D    
    E    
    F    
    G    
    H    
    I    
    1. What is the shortest distance between A and J and the path for that distance?
  3. The following graph represents a portion of the subway system of a city. The vertices on the graph correspond to subway stations, and the edges correspond to the rails. Your job is to write a program for a cleaning car to efficiently clean this portion of the subway system. 
    1. Using Euler’s theorem, explain why it is possible to pass through all of the stations by traversing every rail only once.
    2. Using Fleury’s algorithm, provide an optimal path to clean all the rails by passing through them only once.
    3. Is it possible to find an optimal path described in question 3-b that starts on any station? Explain your answer.
    4. Is it possible to find an optimal path described in question 3-b that starts and ends at the same station? Explain why or why not.
  4. A network engineer lives in City A, and his job is to inspect his company’s servers in various cities. The graph below shows the cost (in U.S. dollars) of travelling between each city that he has to visit. 
    1. Find a Hamiltonian path in the graph.
    2. Find a Hamiltonian circuit that will allow the engineer to inspect all of the servers. How much will the cost be for his trips?
    3. Is there another Hamiltonian circuit that will allow the engineer to inspect all of the servers other than your answer in question 4-b? If so, calculate the cost.
  5. Consider the following binary tree: 
    1. What is the height of the tree?
    2. What is the height of vertex H?
    3. Write the preorder traversal representation of the tree.
    4. Write the array representation of the tree by completing the following table:
Vertex Left Child Right Child
A    
B    
C    
D    
E    
G    
H    
I    
J    
K    
L    
M    
N    
O    
P    
Q    
R    
S    
T    

Please submit your assignment.

Answers

QuickHelper
(10)
Status NEW Posted 23 Aug 2017 02:08 PM My Price 11.00

Hel-----------lo -----------Sir-----------/Ma-----------dam----------- T-----------han-----------k Y-----------ou -----------for----------- us-----------ing----------- ou-----------r w-----------ebs-----------ite----------- an-----------d a-----------cqu-----------isi-----------tio-----------n o-----------f m-----------y p-----------ost-----------ed -----------sol-----------uti-----------on.----------- Pl-----------eas-----------e p-----------ing----------- me----------- on----------- ch-----------at -----------I a-----------m o-----------nli-----------ne -----------or -----------inb-----------ox -----------me -----------a m-----------ess-----------age----------- I -----------wil-----------l

Not Rated(0)