Complete the following in a paper of 1–2 pages:
1.Consider the following graph:
a.Complete this table by finding the degree of each vertex, and identify whether it is even or odd:
VertexDegreeEven/Odd
A
B
C
D
E
F
G
H
b.What is the order of the graph?
c.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.
b.Complete the following table by finding the shortest distance and the path for that distance from vertex A to the other vertices:
VertexShortest Distance from APath from A
B
C
D
E
F
G
H
I
b.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.
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.
.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:
.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:
VertexLeft ChildRight Child
A
B
C
D
E
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
Our website has a team of professional writers who can help you write any of your homework. They will write your papers from scratch. We also have a team of editors just to make sure all papers are of HIGH QUALITY & PLAGIARISM FREE. To make an Order you only need to click Ask A Question and we will direct you to our Order Page at WriteDemy. Then fill Our Order Form with all your assignment instructions. Select your deadline and pay for your paper. You will get it few hours before your set deadline.
Fill in all the assignment paper details that are required in the order form with the standard information being the page count, deadline, academic level and type of paper. It is advisable to have this information at hand so that you can quickly fill in the necessary information needed in the form for the essay writer to be immediately assigned to your writing project. Make payment for the custom essay order to enable us to assign a suitable writer to your order. Payments are made through Paypal on a secured billing page. Finally, sit back and relax.
About Writedemy
We are a professional paper writing website. If you have searched a question and bumped into our website just know you are in the right place to get help in your coursework. We offer HIGH QUALITY & PLAGIARISM FREE Papers.
How It Works
To make an Order you only need to click on “Place Order” and we will direct you to our Order Page. Fill Our Order Form with all your assignment instructions. Select your deadline and pay for your paper. You will get it few hours before your set deadline.
Are there Discounts?
All new clients are eligible for 20% off in their first Order. Our payment method is safe and secure.