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
valentinak56 [21]
1 year ago
13

Part of an algorithm which is repeated for fixed number of times is classified as.

Computers and Technology
1 answer:
AleksandrR [38]1 year ago
7 0

The part of an algorithm which is repeated for a fixed number of times is classified as iteration.

Iteration is basically a repeated execution of the same set of instructions in sequence until a certain condition is met.  For loop is the type of iteration in which a block of instructions repeated again and again for the fixed number of times. Upon completion of the previous iteration, the next iteration starts. The iteration process stops only when the given termination condition matches.

For example, this is the syntax of for loop:

for(initialize; condition; increment);

for (int num=0; num<5; num++)

In this for loop, iteration is carried out for 5 times, starting the value of num from 0 and repeatedly iterates with an increment of one in num until the value of num is less than 5 i.e. 4. This loop terminates once the value of num becomes 5 and, in result the condition num < 5 fails to match anymore.

Therefore, the part of an algorithm which is repeated for fixed number of times is classfied as iteration.

You can learn more about itreation at

brainly.com/question/28134937

#SPJ4

You might be interested in
I'm using assembly language. This is my assignment. I kinda confused about how to write code for this assignment. Can anyone exp
Brut [27]

Answer:

oid changeCase (char char_array[], int array_size ) {

__asm{

   mov eax, char_array;    

   mov edi, 0;

readArray:

   cmp edi, array_size;

   jge exit;

   mov ebx, edi;          

   shl ebx, 2;

   mov cl, [eax + ebx];    

check:

   //working on it

   cmp cl, 0x41;      

   jl next_indx;

   cmp cl, 0x7A;      

   jg next_indx;

   cmp cl, 'a';

   jl convert_down;

   jge convert_up;

convert_down:

   or cl, 0x20;        //make it lowercase

   jmp write;

convert_up:

   and cl, 0x20;      

   jmp write;

write:

   mov byte ptr [eax + ebx], cl    

next_indx:

   inc edi;

exit:

   cmp edi, array_size;

   jl readArray;

mov char_array, eax;

}

}

Explanation:

  • Move char_array to eax as it is base image .
  • Use ebx as offset .
  • Use ecx as the storage register .
  • check if cl is <= than ASCII value 65 (A) .
6 0
4 years ago
​Lisa mentions that a program is developed to interact with other programs, and she wants to begin by testing the programs indiv
Ronch [10]

QC TESTER(quality testing process) is the name of this process.

To name this process call QC TESTER

<u>Explanation:</u>

Any software development environment their will QC testing (quality testing process) where end user will do or simulate complete testing of software make the software bug free.

After QC tester confirm the program as bug free then only software implementation team ready for implementation process. QC tester is important role in software development environment to find a bug on function, data input entry and monitor result from software and inform to software team with list of bug results.

This process will take place to and from between QC tester and software developer team till software become bug free.  

6 0
3 years ago
How could you insert a new row between rows 20 and 21?
podryga [215]
Highlight the row(20), then click on the insert cells button under the home ribbon.
3 0
3 years ago
Read 2 more answers
what is the largest possible number of internal nodes in a redblack tree with black height k? what is the smallest possiblenumbe
Elina [12.6K]

Answer:

A Red Black Tree is a type of self-balancing(BST) in this tree ,each node is red or black colored. The red black tree meets all the properties of the binary search tree, but some additional properties have been added to a Red Black Tree.

A Red-Black tree's height is O(Logn) where (n is the tree's amount of nodes).

In a red-black tree with black height k

The maximum number of internal nodes is 2^{2k} -1.

The smallest possible number is 2^{k} -1.

7 0
3 years ago
Consider an online shopping portal that allows a customer to browse and purchase different products. The products are arranged u
o-na [289]
Way too much to read bye
7 0
3 years ago
Read 2 more answers
Other questions:
  • In Web design, What kind of tag is referred to as fixed ?<br>​
    7·1 answer
  • In Modern operating system, the __ feature has dramatically improved user productivity.
    11·1 answer
  • What will be the values of ans, x, and y after the following statements are executed? int ans = 35, x = 50, y =50; if ( x &gt;=
    7·2 answers
  • 1. In your own words, describe the purpose of a for a loop.
    11·1 answer
  • The color gradient is
    6·1 answer
  • Consider the classes below: public class TestA { public static void main(String[] args) { ​ int x = 2; ​ int y = 20 ​ int counte
    6·1 answer
  • What are the advantages to using a linked implementation as opposed to an array implementation?
    8·1 answer
  • the increase and decrease font button and the change text colour button (as shown in the picture )are include in which group ?​
    6·1 answer
  • Complete the sentence with the correct response.
    9·1 answer
  • You are designing an exciting new adventure game and you want to attempt to explain where items that are carried by the player a
    6·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!