Ask question

Ask question

All categories

2 years ago

7

When using for loops and two-dimensional arrays, the outside loop moves across the ___________ and the inside loop moves across

the ___________.
indexes, elements

columns, rows

elements, indexes

rows, columns

Computers and Technology

1 answer:

lana66690 [7]2 years ago

6 0

Answer: rows, columns

Explanation: :)

You might be interested in

Any executable files???

Kipish [7]

Doesn't look like there are any..

7 0

2 years ago

Create a new Die object. (Refer to Die.html for documentation.)Create a loop that will iterate at least 100 times. In the loop b

hjlf

Answer:

Java code is given below

Explanation:

import java.util.Random;

class Die{

private int sides;

public Die(){

sides = 6;

}

public Die(int s){

sides = s;

}

public int Roll(){

Random r = new Random();

return r.nextInt(6)+1;

}

}

class DieRoll{

public static void main(String[] args) {

Die die = new Die();

int arr[] = new int[6];

for(int i=0; i<6; i++)

arr[i] = 0;

for(int i=0; i<100; i++){

int r = die.Roll();

arr[r-1]++;

}

for(int i=0; i<6; i++)

System.out.println((i+1)+" was rolled "+arr[i]+" times.");

}

}

8 0

3 years ago

Press the ENTER key to do what?

Blababa [14]

Change the line in word, it basically returns

7 0

2 years ago

Make absolutely no changes to main(). Change function backwards so that the elements of the array are swapped in order for eleme

makkiz [27]

Answer:

i got you hold on.

Explanation:

5 0

2 years ago

Let's consider a long, quiet country road with houses scattered very sparsely along it. (We can picture the road as a long line

Rus_ich [418]

Answer:

Follows are the solution to these question:

Explanation:

A simple gullible algorithm is present. Let h mark the house to the left. Then we put a base station about 4 kilometers to the right. Now delete and repeat all the houses protected by this base station. In this algorithm, they can simply be seen to position baselines at b1, . . , bk as well as other algorithms (which may be an optimum algorithm) at $b'_{1}, \ . . . . . . ,b'_{k'}$ and so on. (from left to right) $b_1 \geq b'_{1},\ \ b_2 \geq b'_{2}$ That's why $k \leq k'$ .

7 0

2 years ago