Maurice Tutor

(5)

$15/per page/Negotiable

About Maurice Tutor

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

Expertise:
Algebra,Applied Sciences See all
Algebra,Applied Sciences,Biology,Calculus,Chemistry,Economics,English,Essay writing,Geography,Geology,Health & Medical,Physics,Science Hide all
Teaching Since: May 2017
Last Sign in: 398 Weeks Ago, 2 Days Ago
Questions Answered: 66690
Tutorials Posted: 66688

Education

  • MCS,PHD
    Argosy University/ Phoniex University/
    Nov-2005 - Oct-2011

Experience

  • Professor
    Phoniex University
    Oct-2001 - Nov-2016

Category > Computer Science Posted 15 Sep 2017 My Price 9.00

Maximum 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

Answers

Maurice Tutor
(5)
Status NEW Posted 15 Sep 2017 09:09 PM My Price 9.00

Hel-----------lo -----------Sir-----------/Ma-----------dam-----------Tha-----------nk -----------You----------- fo-----------r u-----------sin-----------g o-----------ur -----------web-----------sit-----------e a-----------nd -----------and----------- ac-----------qui-----------sit-----------ion----------- of----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n.P-----------lea-----------se -----------pin-----------g m-----------e o-----------n c-----------hat----------- I -----------am -----------onl-----------ine----------- or----------- in-----------box----------- me----------- a -----------mes-----------sag-----------e I----------- wi-----------ll

Not Rated(0)