Multiple choices 13/50
(Choose 1 answer)
(See picture)
A. 25
B. 125
C. 1
D. 5
Next
E. 250
Given the algorithm
Procedure NMT (a11,212,..., ann, b11,612,..., bnn: integer)
for i:=1 to n do
for j:=1 to n do Cij:=0;for i:=1 to n do for j:=1 to n do for k:=1 to n do Cij:= Cij+aik*bkj;
If n=5, how many multiplications are required?
1
2
3
4
5
6
7
8
9
10
11
12 13 14
15 16 17
18 19 20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40 41 42
43
44
45 46 47 48
49 50
