Unit 2 ip question | Mathematics homework help

Complete the following in a paper of 12 pages:

  1. Consider the following graph:

https://class.aiu-online.com/LCMSFileShareCommon/e13/04d/5c3/ebe/41f/8a6/e55/eef/5ea/086/37/U2IP_graph1.png

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

https://class.aiu-online.com/LCMSFileShareCommon/095/5f7/53c/339/494/7b4/3d0/669/3ca/a8a/df/U2IP_graph2.png

b.      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?
  1. 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.

https://class.aiu-online.com/LCMSFileShareCommon/bf1/77c/d28/3fe/438/e9e/76f/595/bc8/539/f7/U2IP_graph3.png

b.      Using Euler’s theorem, explain why it is possible to pass through all of the stations by traversing every rail only once.

c.       Using Fleury’s algorithm, provide an optimal path to clean all the rails by passing through them only once.

d.      Is it possible to find an optimal path described in question 3-b that starts on any station? Explain your answer.

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

                        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.

https://class.aiu-online.com/LCMSFileShareCommon/b50/c0d/e4b/63c/492/f92/262/6b6/8ea/fce/3c/U2IP_graph4.png

 .        Find a Hamiltonian path in the graph.

a.       Find a Hamiltonian circuit that will allow the engineer to inspect all of the servers. How much will the cost be for his trips?

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

                        Consider the following binary tree:

https://class.aiu-online.com/LCMSFileShareCommon/2a8/28c/00b/d0e/43a/1b8/3d9/778/da6/5b6/6e/U2IP_graph5.png

 .        What is the height of the tree?

a.       What is the height of vertex H?

b.      Write the preorder traversal representation of the tree.

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

 

 

 

 

                        Consider the following weighted graph:

https://class.aiu-online.com/LCMSFileShareCommon/b1c/3a2/640/531/4cc/2bf/764/c94/cf3/d30/60/U2DB_graph1.jpg

  • In the table below, choose the bracket that contains the first letter of your last name. Then, choose 1 value for and 1 value for b from the numbers listed for your bracket. (Put your chosen values for a and b in the heading for your first post for the week, so your classmates will know which values you have chosen for each and so they will not choose the same values as yours. Be sure to choose a combination of a and b that is different from your classmates who have already posted or have chosen their values.) The values chosen will be the weights in the paths labeled a and b in the weighted graph above.
    • I choose the following: a = 8, b = 6

Last Name Begins With

a

b

A–K

10, 14, 16, 5

4, 6, 9, 11

L–Q

5, 11, 13, 8

2, 7, 12, 15

R–Z

3, 8, 10, 19

13, 15, 17, 18

  • In the weighted graph above, find the shortest path from node A to node E using Dijkstra’s shortest path algorithm and using your chosen values for a and b.
    • Explain your key steps in determining the shortest path, and give the node sequence that corresponds to that shortest path.
  • Explain 2 examples where knowledge of a shortest path algorithm could be useful in an information technology career.
  • Thinking of the graph above as undirected, does this graph have a Euler path? If so, give an example of such a path starting with a node you choose; if not, explain why not.
    • Does this graph have a Euler circuit? If so, give an example; if not, explain why not.
  • Does this graph have a Hamiltonian path? If so, give an example of such a path starting with a node you choose; if not, explain why not.
    • If there is a Hamiltonian path, is there a Hamiltonian circuit? If so, give an example of such a circuit starting with a node you choose; if not, explain why not.
Order a unique copy of this paper
(550 words)

Approximate price: $22

Basic features
  • Free title page and bibliography
  • Unlimited revisions
  • Plagiarism-free guarantee
  • Money-back guarantee
  • 24/7 support
On-demand options
  • Writer’s samples
  • Part-by-part delivery
  • Overnight delivery
  • Copies of used sources
  • Expert Proofreading
Paper format
  • 275 words per page
  • 12 pt Arial/Times New Roman
  • Double line spacing
  • Any citation style (APA, MLA, Chicago/Turabian, Harvard)

Our guarantees

We value our customers and so we ensure that what we do is 100% original..
With us you are guaranteed of quality work done by our qualified experts.Your information and everything that you do with us is kept completely confidential.

Money-back guarantee

You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.

Read more

Zero-plagiarism guarantee

The Product ordered is guaranteed to be original. Orders are checked by the most advanced anti-plagiarism software in the market to assure that the Product is 100% original. The Company has a zero tolerance policy for plagiarism.

Read more

Free-revision policy

The Free Revision policy is a courtesy service that the Company provides to help ensure Customer’s total satisfaction with the completed Order. To receive free revision the Company requires that the Customer provide the request within fourteen (14) days from the first completion date and within a period of thirty (30) days for dissertations.

Read more

Privacy policy

The Company is committed to protect the privacy of the Customer and it will never resell or share any of Customer’s personal information, including credit card data, with any third party. All the online transactions are processed through the secure and reliable online payment systems.

Read more

Fair-cooperation guarantee

By placing an order with us, you agree to the service we provide. We will endear to do all that it takes to deliver a comprehensive paper as per your requirements. We also count on your cooperation to ensure that we deliver on this mandate.

Read more

Calculate the price of your order

550 words
We'll send you the first draft for approval by September 11, 2018 at 10:52 AM
Total price:
$26
The price is based on these factors:
Academic level
Number of pages
Urgency