
1. The fundamental characteristics that every algorithm must meet are:
a) An algorithm must be precise and indicate the order of execution of each step.
b) The algorithms have three different parts: input, process and output.
c) An algorithm must be well defined, that is, if its execution is followed twice, the same logical sequence must be obtained.
d) All the previous options.
2. The types of algorithms can be:
a) According to the types of data.
b) According to the expected result.
c) According to its system of signs, functions and strategy.
d) None of the above options.
3. An algorithm can be defined as:
a)
Algorithm is a set of instructions that specify the sequence of
operations to be performed, in order, to solve a specific system or
class of problem.
b) An algorithm is the application of logical steps, not sequential or methodically applied to solve a problem in question.
c) An algorithm is called a set that is neither ordered nor structured, which allows a task to be carried out.
d) An algorithm is a sequence of operations that are not very detailed and ambiguous that lead to solving problems.
4. The most important advantages of an algorithm can be:
a) They usually require prior and above all technical knowledge.
b) Modifications to modules are more difficult.
c) The problem is more easily understood by dividing it into simpler parts called modules.
d) It allows blind confidence in a logical method to solve a problem.
5. The usual methods to represent an algorithm are:
a) Flow diagram.
b) Formulas and pseudocode language.
c) N-S diagram (Nassi-Schneiderman).
d) All the previous options.
Evaluation Criteria:
• This exam can be applied via Skype / Video Conference or Zoom.
• Read the questions carefully.


0 Comentarios
Si necesitas la solución de algún Trabajo o Ejercicios enviala al correo saemaster10@gmail.com con la fecha que la necesitas y te responderemos el costo de la realización