You are given an array that holds the weights of n people in the class w = (w1, w2, wn). your goal is to divide the n people into two teams such that the total weight of the two teams is equal or as close as possible to equal. describe such an algorithm and give its running time. the total number of people on each team should differ by at most 1. assume that m is the maximum weight of a person, i. f., ∀i'm. the running time should be a polynomial function of n and m. the output should be the list of people on each team and the difference in weight.

Line joining liquid phase with liquid and solid phase mixture is known as: a) liquidus b) solidus c) tie line d) none of the mentioned

If a particle moves along a path such that r : (3 sin t) m and ? : 2t rad, where t is in seconds. what is the particle's acceleration in m/s in 4 seconds? a)- 16.43 b)- 16.29 c)- 15.21 d)- 13.79

Asingle-geared blanking press has a stroke of 200 mm and a rated capacity of 320 kn. a cam driven ram is assumed to be capable of delivering the full press load at constant force during the last 15 percent of a constant-velocity stroke. the camshaft has an average speed of 90 rev/min and is geared to the flywheel shaft at a 6: 1 ratio. the total work done is to include an allowance of 16 percent for friction a) estimate the maximum energy fluctuation b) find the rim weight for an effective diameter of 1.2 m and a coefficient of speed fluctuation of 0.10