Calculate the complexity t(n) of the bubble-sort algorithm below. calculate the constant cost of a step by assuming that each basic operation included in that step – addition, subtraction, multiplication, division, array-read, array-write, assigning a value to a variable, returning a value, etc. – has a cost of 1. so the cost of executing a statement once is to be calculated as the total number of basic operations that have to be executed. fill in the table below, then determine the expression for t(n) and simplify it to produce a polynomial in n. in the second column for steps 4-9, provide sigma (summation) notation.

Aloaded platform of total mass 500 kg is supported by a dashpot and by a set of springs of effective stiffness 72 kn/m. it is observed that when the platform is depressed through a distance x = 12.5 cm below its equilibrium position and then released without any initial velocity; it reaches its equilibrium position in the shortest possible time without overshoot. find the position and velocity of the loaded platform 0.10 sec. after its release. if a further load of 400 kg is added to the platform, find, i) the frequency of damped vibrations, and i) the amplitude of vibration after 2 complete oscillations, given that the initial amplitude is 15 cm.

Aplate clutch has a single pair of mating friction surfaces 250-mm od by 175-mm id. the mean value of the coefficient of friction is 0.30, and the actuating force is 4 kn. a) find the maximum pressure and the torque capacity using the uniform-wear model. b) find the maximum pressure and the torque capacity using the uniform-pressure model.

Items are similar to the free issue items, but their access is limited. (clo5) a)-bin stock items free issue b)-bin stock controlled issue c)-critical or insurance spares d)-rebuildable spares e)-consumables