Adegree-constrained minimum spanning tree is a minimum spanning tree (mst) where the maximum vertex degree is limited to a certain constant k. the problem is np-hard. adapt prim's and kruskal's mst algorithms, and implement them, to find degree-constrained mst. compare the resulting msts obtained from these two approximation techniques. implement in java language.

Apump is used to circulate hot water in a home heating system. water enters the well-insulated pump operating at steady state at a rate of 0.42 gal/min. the inlet pressure and temperature are 14.7 lbf/in.2, and 180°f, respectively; at the exit the pressure is 60 lbf/in.2 the pump requires 1/15 hp of power input. water can be modeled as an incompressible substance with constant density of 60.58 lb/ft3 and constant specific heat of 1 btu/lb or. neglecting kinetic and potential energy effects, determine the temperature change, in °r, as the water flows through the pump.

Burgers vector is generally parallel to the dislocation line. a)-true b)-false

Which of the following ziegler nichols tuning methods the response of the controller to a step input should exhibit an s-shaped curve? a)-open loop mode b)-closed loop mode c)-both modes (open & closed) d)-none of the modes (open & closed)