Text Title: The Design & analysis of Algorithm, Levitin, 2nd EditionISBN Number: 0321358287Q1 :Maximum Spanning Tree is a spanning tree…

Text Title: The Design & analysis of Algorithm, Levitin, 2nd Edition ISBN Number: 0321358287

 

Q1 :Maximum Spanning Tree is a spanning tree with the largest possible edge weight, of a weighted connect graph. Please provide a solution (pseudo code) byutilizing or revising any of the algorithms discussed in class. p.310 -322

 

Q:2 Packet Transmission Problem (PTP) and Job Scheduling Problems (JSP) are known NP-complete problems. It is also known that any NP-complete problem can be transformed into another NP-complete problem within polynomial time. How would you transform the PTP to JSP? Following are the descriptions of PTP and JSP.

Packet Transmission Problem (PTP)

There is a data packet that needs to be transmitted to all n sites on the network.  Data packet cannot be duplicated by any sites, and each site should receive the data packet only once.  The time it takes to transmit this data packet from site i to site j is T(i,j).  PTP is to choose the routing so that this data packet can be transmitted to all sites with the least amount of time.

 

 

Job Scheduling Problems (JSP)

We have a set of n jobs with the amount of time they need to complete, t1, t2, …, tn, the deadline they need to be completed by, d1, d2, …, dn, and a penalty incurred if the job is not completed by the deadline, p1, p2, …, pn.  JSP attempts to order this set of n jobs to incur the smallest penalty.

 
Looking for solution of this Assignment?

WHY CHOOSE US?

We deliver quality original papers

Our experts write quality original papers using academic databases.  

Free revisions

We offer our clients multiple free revisions just to ensure you get what you want.

Discounted prices

All our prices are discounted which makes it affordable to you. Use code FIRST15 to get your discount

100% originality

We deliver papers that are written from scratch to deliver 100% originality. Our papers are free from plagiarism and NO similarity

On-time delivery

We will deliver your paper on time even on short notice or  short deadline, overnight essay or even an urgent essay