Below is the pseudocode of the "test" algorithm:
algorithm "test"
var
A: VECTOR [1..3,1..3] OF WHOLE
C, L, M: WHOLE
start
RANDOM 1,50
FOR L OF 1 ATE 3 KNIFE
FOR C OF 1 ATE 3 KNIFE
READ (A [L, C])
SE (L = 1) E (C = 1) ENTAO
M <-A [L, C]
END IF
IF A [L, C]> M ENTAO
M <-A [L, C]
END IF
FIMPARA
FIMPARA
WRITING ("**** MATRIX A ****")
FOR L OF 1 ATE 3 KNIFE
FOR C OF 1 ATE 3 KNIFE
WRITE (A [L, C]: 4)
FIMPARA
WRITING
FIMPARA
WRITING (M)
final algorithm
On this algorithm, analyze the following sentences:
I. A is a matrix whose elements are integers generated randomly.
II. A is an order 3 matrix.
III. At the end of its execution, the algorithm prints the smallest value of the matrix.
IV. At the end of its execution, the algorithm prints the largest value of the matrix.
Now, mark the alternative that presents the CORRECT answer.
Alternatives:
The)
Only affirmative III is correct.
B)
Affirmations I and II are correct.
w)
Affirmations I, II and III are correct.
(d)
Affirmations I, II and IV are correct.
and)
All statements are correct.
Answer:27/5
Step-by-step explanation:It just is that
The answer is A.
3(12 + 6) gives you 36 + 18 because 3 times 12 is 36 and 3 times 6 is 18
Are u like in 9th grade omg
Answer:
There's 2 red jacks in a deck and 2 black queens in a deck so you have a total of 4 possible cards out of a 52 total in a deck so that would be 4/52 or 1/13 of the time. Statistically 7.6% of the time you will get a red jack or a black queen.
Step-by-step explanation:
