Assume radix sorting of 1024 unsigned integers on a 32-bit machine with 4 passes (rounds). The integers are initially stored in lst[1024] and the sorted integers will be available in lst at the end of sorting. int buf[1024] is available as working space. Required:
a. What is the number of buckets?
b. The bit mask in hexadecimal is?
c. Find the number of data assignments for correcting the result after 4 passes are completed.
d. For floating point radix sort, assuming exactly half (512 floats) is negative, what is the number of data assignments for correcting the result?

Larry sent an email to andy. andy didn't open larry's email but still understood what the message was. how did andy determine the message without opening the email?

Create a word problem that involves calculating the volume and surface area of a three-dimensional object. cube: surface area 6 s2 , volume s3

What is the worst-case complexity of the maxrepeats function? assume that the longest string in the names array is at most 25 characters wide (i.e., string comparison can be treated as o( class namecounter { private: int* counts; int nc; string* names; int nn; public: namecounter (int ncounts, int nnames); int maxrepeats() const; }; int namecounter: : maxrepeats () { int maxcount = 0; for (int i = 0; i < nc; ++i) { int count = 1; for (int j = i+1; j < nc; ++j) { if (names[i] == names[j]) ++count; } maxcount = max(count, maxcount); } return maxcount; }