Unit 2 ip question | Mathematics homework help

Complete the following in a paper of 12 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:




























    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.


b.      Complete the following table by finding the shortest distance and the path for that distance from vertex A to the other vertices:


Shortest Distance from A

Path from A

























    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.


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:



Left Child

Right Child




























































                        Consider the following weighted graph:


  • 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




10, 14, 16, 5

4, 6, 9, 11


5, 11, 13, 8

2, 7, 12, 15


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.
Punctual Essays
Calculate your paper price
Pages (550 words)
Approximate price: -

Why Work with Us

Top Quality and Well-Researched Papers

We always make sure that writers follow all your instructions precisely. You can choose your academic level: high school, college/university or professional, and we will assign a writer who has a respective degree.

Professional and Experienced Academic Writers

We have a team of professional writers with experience in academic and business writing. Many are native speakers and able to perform any task for which you need help.

Free Unlimited Revisions

If you think we missed something, send your order for a free revision. You have 10 days to submit the order for review after you have received the final document. You can do this yourself after logging into your personal account or by contacting our support.

Prompt Delivery and 100% Money-Back-Guarantee

All papers are always delivered on time. In case we need more time to master your paper, we may contact you regarding the deadline extension. In case you cannot provide us with more time, a 100% refund is guaranteed.

Original & Confidential

We use several writing tools checks to ensure that all documents you receive are free from plagiarism. Our editors carefully review all quotations in the text. We also promise maximum confidentiality in all of our services.

24/7 Customer Support

Our support agents are available 24 hours a day 7 days a week and committed to providing you with the best customer experience. Get in touch whenever you need any assistance.

Try it now!

Calculate the price of your order

Total price:

How it works?

Follow these simple steps to get your paper done

Place your order

Fill in the order form and provide all details of your assignment.

Proceed with the payment

Choose the payment system that suits you most.

Receive the final file

Once your paper is ready, we will email it to you.

Our Services

No need to work on your paper at night. Sleep tight, we will cover your back. We offer all kinds of writing services.


Essay Writing Service

No matter what kind of academic paper you need and how urgent you need it, you are welcome to choose your academic level and the type of your paper at an affordable price. We take care of all your paper needs and give a 24/7 customer care support system.


Admission Essays & Business Writing Help

An admission essay is an essay or other written statement by a candidate, often a potential student enrolling in a college, university, or graduate school. You can be rest assurred that through our service we will write the best admission essay for you.


Editing Support

Our academic writers and editors make the necessary changes to your paper so that it is polished. We also format your document by correctly quoting the sources and creating reference lists in the formats APA, Harvard, MLA, Chicago / Turabian.


Revision Support

If you think your paper could be improved, you can request a review. In this case, your paper will be checked by the writer or assigned to an editor. You can use this option as many times as you see fit. This is free because we want you to be completely satisfied with the service offered.