The 2E Class Blog

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 Definition of variable is the representing of what we are counting. The definition of loop is the sequence of steps that will repeat some numbers 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 test the corner cases they try to know if the algorithm functions with 0 persons in a room. The branch is a new condition that you establish in a new line (line4) when an Algorithm doesn't function.

                           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.