1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
ahrayia [7]
3 years ago
11

To iterate through (access all the entries of) a two-dimensional arrays you

Computers and Technology
1 answer:
ahrayia [7]3 years ago
6 0

Answer: You would need two loops to iterate through both dimensions

Explanation:

matrix = [[1,2,3,4,5],

              [6,7,8,9,10],

              [11,12,13,14,15]]

for rows in matrix:

    for numbers in rows:

         print(numbers)

The first loop cycles through all the immediate subjects in it, which are the three lists. The second loop calls the for loop variable and iterates through each individual subject because they are lists. So the first loop iterates through the 1st dimension (the lists) and the seconds loop iterates through the 2nd dimension (the numbers in the lists).

You might be interested in
When writing potential test questions, it is very important to use vocabulary words in their correct form. Please select the bes
Ilya [14]
The answer is True.

Hope I helped!
6 0
3 years ago
Read 2 more answers
Given that it takes 0.08 ms to travel from one track to the next of a hard drive; that the arm is originally positioned at Track
daser333 [38]

Answer:

Time taken to travel from one track to the next = 0.08ms

Initial track= 15     0

4      (15-4)*(0.08)= 0.88

40     (40-4)*(0.08)= 2.88

35      (40-35)*(0.08)= 0.4

11       (35-11)*(0.08)= 1.92

14       (14-11)*(0.08)= 0.24

7         (14-7)*(0.08)= 0.56

----------------------------------------------

Total seek time=0.88+2.88+0.4+1.92+0.24+0.56=6.88ms

Explanation:

We caculate the seek time for each request, and then add them together to find the total seek time. The final track number for the current request becomes the current track of next request, and this process is repeated till the last request is processed.

4 0
3 years ago
If Scheme were a pure functional language, could it include DISPLAY ? Why or why not?​
VARVARA [1.3K]

Answer:

When Scheme is a pure functional language, it cannot include the function DISPLAY. Since the pure functional languages will return the same value whenever the same expression is evaluated, and the DISPLAY would be the output and thus it cannot be part of the purely functional language. Thus in the pure functional language we can evaluate the expressions with the same arguments and it returns the same value since there is no state to change.

Explanation:

4 0
3 years ago
The process of creating a set of instructions that tell a computer how to perform a task is called:
zlopas [31]
It is known as a command
8 0
3 years ago
C. to which cache block will the memory address 0x000063fa map
irina [24]
It depends on the <span>mapping techniques. Do you have a particular one in mind. The options are associative mapping, direct mapping and set associative mapping.</span>
4 0
3 years ago
Other questions:
  • Who<br> invented the term “debugging”?
    14·2 answers
  • When did economies begin?
    11·2 answers
  • Meaning of page break​
    8·1 answer
  • Write 3 functions in the starter code below such that: add_to_dict(): takes a dictionary, a key, a value and adds the key,value
    15·1 answer
  • Assume you want to write a code to calculate the addition of two numbers digit by digit. Provide the running time for your algor
    13·1 answer
  • Powerful IT security systems are needed to defend against what appears to be authorized access to a network or application. Sele
    6·1 answer
  • What is GIGO ?<br>plz answer me​
    7·1 answer
  • How do you create multiple columns in Word?
    12·1 answer
  • Aspire is a test you take to prepare for the<br> A. PSAT<br> B. SAT<br> C. ACT<br> D. FAFSA
    11·1 answer
  • Which type of address is the ip address 232. 111. 255. 250?.
    15·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!