Home /
Expert Answers /
Computer Science /
1-2048-1-2048-j-1-to-2048-do-a-i-j-a-j-i-b-i-j-provided-the-arrays-are-mapped-into-the-main-m-pa174
(Solved): 1:2048,1:2048 J:=1 to 2048 do {A[I,J]:=A[J,I]*B[I,J]} provided the arrays are mapped into the main m ...
1:2048,1:2048 J:=1 to 2048 do
{A[I,J]:=A[J,I]*B[I,J]}
provided the arrays are mapped into the main memory space in row-major order,
Consider QuickSort on the array A[1:n] and assume that the pivot element xA[lo:hi] into two portions such that all elements in the left portion A[lo:m] are <=x
and all elements in the right portion A[m:hi] are >=xA[hi] 1dotsnA[lo:m] and A[m:hi] are always of equal sizen rectangular matrices discussed in class. Assume, in
contrast to what we did in class, that we want to determine the maximum number of scalar
multiplications that one might need (that is, compute the maximum of all possible
parenthesizations).
Formulate precisely an algorithm that determines this value. Then carry out your method on
the following product to show what is the worst-possible parenthesization and how many
scalar multiplications are required to carry it out: M_(9,1)*M_(1,9)*M_(9,2)*M_(2,11)*M_(11,5).
Related to Optimal Huffman Codes
Construct a Huffman code for the symbols a through g , listed below together with their probabilities.
Then determine the expected length of your resulting code!
a (1)/(45)
b( 2)/(45)
c( 3)/(45)
d (14)/(45)
e (5)/(45)
f_((6)/(45))
g( 6)/(45)
h (8)/(45)
Related to HeapSort
(a) Construct a heap for the following array of numbers: 10,1,3,2,8,5,6,4,9