Radix sort for floating point numbers requires an additional step for correction
ID: 3532444 • Letter: R
Question
Radix sort for floating point numbers requires an additional step for correction because numbers are sorted as signed integers they are biased-127 exponents negative numbers are placed in positive number places positive numbers are placed in negative number places all of the above Given float f; which of the C statements would allow you to access the binary equivalent of f: Af *f (unsigned long *) (&f;) (unsigned long *) (*f) * (unsigned long *) (&f;) From problem 9, you now have the floating point number f converted to x. Assuming char s[32]; int i,n=32; which of the following C statements would store the binary equivalent of X in the string s, where s[0] holds the sign bit (the most significant bit) of the original number f while s[31] holds the least significant bit of the original number f: For 7-10 consider succ has three nodes (p,q,r) while open has two nodes (x,y). What search strategy is used to obtain open=(p,q,r,x,y) after merging succ and open? depth breadth best branch-bound a What search strategy is used to obtain open=(x,y,p,q,r) after merging succ and open? depth breadth best branch-bound a* Best first search relies soley on g h f=func(g.h) none any two from f,g,h A* heuristic search relies on g h f=func(g,h) d)none any two from f,g,h The complexity of selection sort is x, merge sort is y, radix sort is z: none of the above r problems 2 and 3, x and y may be any number including log, square, 0, and 1. The complexity of merge sort is O(x*y) because it requires aproximately: x split opeartions, y merging opeartions x counting, x split opeartions, y merging comparisions x mapping opeartions, x split opeartions, y comparisions x counting, y merging opeartions none of the aboveExplanation / Answer
4)c
5)c
6)d
7)a
8)b
9)b
10)a
11)e, as it sud be Z=O(kn) for radix sort
12)a
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.