Assuming both operands are normalised and nonzero, what is the…
Question Answered step-by-step Assuming both operands are normalised and nonzero, what is the… Image transcription textalgorithms [a] Explain the greedy strategy in algorithm design. To what problems does it apply? [34 {b} It aproblem can be solved with both dynamic programming and a greedy algorithm, what are the ady, of up to agiven amount of p gegge, Its goal is to minimize the number of postage stamps issued, and the m… Show more… Show moreAssuming both operands are normalised and nonzero, what is the maximumdegree (number of shifts) of normalisation required in the result of a floatingpoint multiplication? Ignore zero and denormal results. [5 .](b) A watertight capsule containing scientific instruments is dropped from ahigh-altitude plane into the ocean where it must approach close to the sea bottombefore floating up for retrieval by a boat. You are provided with subroutinesthat compute water and air resistance from velocity. Collision with the oceanbottom is a mission failure.(i) Set up a state vector and sketch code for a finite-difference, time-domainsimulation of the trajectory in one dimension. Include a check for missionfailure. [5 .](ii) What three issues will affect your choice of simulation timestep?(e) Radix sorting can sort any set of integers in linear time. (f ) All straight lines from the inside of a polygon to the outside intersect the points on the edges forming its boundary an odd number of times. (g) It is always cheaper to find the shortest distance between two given nodes u, v of G than to find all N shortest distances from u to every other node. (h) It is possible to find the shortest paths between all N2 pairs of nodes of G in O(N3 ) time. (i) If G is connected then the minimal spanning subtree of G contains the N − 1 edges whose weights are smallest. (j) Given n points (xi , yi), 1 6 i 6 n in a plane, then the four points (xa, ya), (xb, yb), (xc, yc), (xd, yd) such that xa is minimal of the xi , xb is maximal of the xi , yc is minimal of the yi , yd is maximal of the yi form a quadrilateral Q which can be used to speed up a convex hull algorithm by preprocessing to remove points which lie inside Q. Computer Science Engineering & Technology C++ Programming COMPUTER S MISC Share QuestionEmailCopy link Comments (0)
