The 2E Class Blog

                           Definition of an algorithm   Algorithm : Is a set of instructions for solvin a problem step by step The objetiv from this algorithm is count people, and the objetiv help you to now if this is the thing that can help you for resolv your problem Wath is a pseudo code : The pseudocode is the lenguage to expres the algorithm Definicion of variable:  A variable is a value Definition of loop: A loop is a sequence of steps that will repeat some number of times Definition of trdting an algorithm: It describes exactly how we will go about counting How to make algorithm: We start counting something startyng at zero, then for each one thing in the room we increment N by 1. So in the first trip througt the loop, we uptraid n from zero to 1 on the second trip thought that same loop. And so, by this algorithm end 2 Testing algorithm: They are correct We test corner cases: S...

1) Definition and Algorithm: "0,21 S.'' An Algorithm is a set of Instructions for solulving some problem step by step. 2) Definition of the Goal: ''0,30 S.'' The Goal of an Algorithm is about counting how mutch people is in the room. 3) Pseudo code: ''0,43 S.'' The Pseudo code is the language to express the Algorithm. 4 )Definition of variable : ''0,57 S.'' The Definition of variable is the representing of what we are counting. 5) Definition of loap: ''1,17 S.'' The Definition of loap is a sequence of steps that will repeat some numbers of times. 6) Definition of triding an Algorithm: ''1,38 S.'' It describes how we will count. 7) How to make algorithm: ''2,02 S.'' We start counting something at zero, and then for each person in the room we will increment N by 1, so with the first trip we will start counting at zero. And the second trip trough the same lo...

Definition of algorithm: i n computer science, an algorithm is a series of instructions, for solving problems step by step. The goal of an algorithms is the purpose of an algorithm, in this example it is counting persons in a room. Pseudo code   is  an english like instruction set the sintaxis that resembles the programing language The variable is the thing that I would like to measure. In this case the variable N is the quantity of persons in the same room. How to test the algorithm ? First, in the line 1 stablish a variable to be measured, in the line 2 is for each person is in the room we count 1, and finally int he line 3 you must say how we are going to count the variable. The loop is a sequence of steps that will be repeated a number of times. Testing algorithm : You must establish if the algorithm works so you bang on it a bit testing corner cases or specific cases.  The corner case is a case that is not typical. To te...

1.  Algorithm:    an Algorithm is a set of instructions for solving a problem step by step. 2. Goal: the goal is about to count people in the room. 3. Pseudo code: the pseudo code is the language of programming. 4. Variable: variable is a letter that is equal to zero. 5 Loop: a loop is a sequence of steps that will repeat some number of times. 6. How to test an algorithm: it describe how we will go about counting. 7  How to make an algorithm: we start counting something starting at zero then for each one in the room we increment N by 1. so in the first trip trough the loop, we uptraid N from zero  to 1 on the second trip thought that same loop. 8 Testing algorithm: if you want to count people in a room, and in the room are 3 people, the result will be 3. If the answer isn't 3, then the algorithm is wrong.  9 We test corner cases: Suppose that are zero people in the room, we initialize N equal to zero but this time line doesn't execut...

DEFINITION in informatics an algorithm is a series of instructions to solve a problem, typically algorithms are executed exclusively by computers, but humans also have algorithms                                                              EXAMPLE Examples are user manuals, which show algorithms for using a device, or instructions that a worker receives from his employer. ... In terms of programming, an algorithm is a sequence of logical steps that allow solving a problem.                     

1.An Algorithm is a set of instructions for solving some Problems step by step. 2.The goal of a Algorithm is about counting how much people is in the room. 3.The pseudo code is the language to express the Algorithm. 4.The definition of variable is the representing of what we are counting. 5.The definition of loap is the sequence of steps that will repeat some numbers of times. 6.It describe how will go about counting. 7.We start counting something starting at zero then for each on in the room we increment N by 1.So in the first trip of the trough of the loop. we uptraid n from zero to 1. 8.If there are 5 people in the room the results have to be 5 if it isn´t like that then this Algorithm is wrong 9.The corner case is a case that is not typical.To test the corner cases they try to know if the Algorithm functions with 0 persons in a room 10.Only executes if there is 1 person in the room ,that can not be paired with some one else.

Algorithm: Algorithm is an instruction for solve a problem step by step Definition of the goal: Is what you will to do and complete Pseudo code: English lenguange to understand the programm lenguage Definition of variable: A variable is a value Definition of loap: a sequense of steps that will repeat some numbers of times Definition of testing algorithm: It describe how we will go about counting How to make an algorithm: We start counting something starting at zero then for each on in the room we increment N by 1. So in the first trip of the trough of the loop, we uptraid n from zero to 1 on the second thought that same loop. And so, by this algorithm end in 2 Testing algorithm: When the final result is the same that the number you will count its correct We test corner cases: Spous there are 0 persons in the room. We start intializing N to 0, but the N by 1 doesnt execute at all. Since there isnt a person in the room, and so N remains to 0 Definition of branch: Its an...

1)Defimition and Algorit ''0,21s'' 2)Definition of the goal ''0,30s'' 3)Pseudo code ''0,43s 4)Definition of variable ''0,57s'' 5)Definition of loap''1,17s' 6)Definition of testing Algorithm ''1,38s'' 7)How to make an algorithm''2,02s'' 8)Testing Algorithm'' 1)An Algorithm is a set of instructions for solving some problems,step by step. 2)Purpose of an algorithm,for example counting persons in a room. 3)English-like syntax that resembles a programming language 4)A variable calles n and initializes its value to zero. 5)A sequence of steps that will repeat some number of times. 6)In line 1 ,we initialize n to zero. For each of these two people we then increment n by 1 7)You must to to establish so you bang on it a bit  specific cases. 8)The corner case is a case that is not common .To test it you have to know if the algorithm works with 0 perso...

Algorithm: In computer science a algorithm is a set of instructions for solving a problem step by step. Definition of the goal: For solve a problem, for example, count people in a room. Pseudo code: Is a program language. Definition of variable: You must to select a variable, for example a letter. Definition of loop: A sequenst of steps that will repeat some numbers of time. How to make a algorithm: We count people in a room,  you must to select a default variable (n=0)   than for each person in the room, increment by 1 person.If are two persons, in the first trip increment 1 and in the next trip, increment 1 and we have 2, and so, by these algorithm end in 2. testing algorithm : if you will count people in a room, and in these room are 5 people, the result of the algorithm is 5. If are other result, the algorithm is wrong. we test corner case: when in a room are 0 people, the line 3 doesn't execute and the result is 0. Definition of branch: Is a extr...

algorithm:algorithm is an insturuction for solve a problem step by step goal:is what you will to do and complete pseudoucode:english lenguange to understand the programm lenguage variable:a variable is a value loap:a sequense of steps that will  repeat  some numbers of times testing algorithm when the final result is the same that the  number you will count its correct we test corner cases:spours there are 0 persons in the room. we start intializing n to 0,but the n by 1 doesnt execute at all. sinse there isnt a person in the room,and so n remains to 0 branch:its an algorithm thonly execute when the number you count isnt pair

Algorithm:The algorithm is a set of instructions for solving some problem step by step, the goal of the Algorithm is about counting, like how much people is in a room. The pseudocode, the pseudocode is a language to express the Algorithm. the defintion of variable, is the representing of what we are counting, and the definition of loap is a sequence of steps that will repeat some times. It describe how we will go about counting. We start counting something starting as zero then for each on in the room we increment N by 1.So in the first trip of the loop, we uptraid n from zero to. If there are 5 people in the room the results have to be five if it isn't like that then this Algorithm is wrong. The corner is a case that is not typical. To test the corner cases they try to know if the Algorithm functions with 0 persons in a room. Only executes if there is 1 person in the room , that can not be paired with some one else.

17/03/2020 1) Definition and Algorithm: "0.21 S." -  An Algorithm is a set of instructions for solulving some problem step by step. 2) Definition of the Goal: "0.30 S." -  The Goal of an Algorithm is about countig how mutch people is in the room. 3) Pseudo code: "0.43 S" -  The Pseudo code is the language to express the Algorithm. 4) Definition of variable: "0.57 S." -  The Definition of variable is the representig of what we are counting. 5) Definition of loap: "1.17 S." -  The Definition of loap is a sequence of steps that will repeat some numbers of times. 6) Definition of triding an Algorithm: "1.38 S." -  It describe how we will go about countig. 7) How to make algorithm: "2.02 S." -  We start counting something starting at zero then for each on the room we increment N by 1. So in the first trip of the trough of the loop , we uptraid n from zero to 1. 8) Testing Algorithm -  If there are 5 peopl...

1. An algorithm was a set of instructions for solving some Problem step by step. 2. The goal of an Algorihtm is about counting how much people is in the room. 3. The pseudo code is the language to express the Algorithm. 4. The definition of variable is the representing of what we are counting. 5. The definition of loap is a sequence  of steps that will repeat some numbers of times. 6. It describe how we will go about counting. 7. We start counting something starting at zero then for each on in the room we increment N by 1. So in the first trip of the trough of the loop, we uptraid n from zero to 1. 8. If there are 5 people in the room the results have to be 5 if it isn’t like that then this algorithm is wrong. 9. The corner case is a case that is not typical. To test the corner cases they try to know if the algorithm functions with 0 persons in a room. 10. Only executes if there is 1 person in the room, that can not be paired with some one else.