Difference between definiteness and effectiveness of an algorithm
Answers
Answer:
Explanation:For algorithms, efficiency refers to the amount of resources which is necessary for solving a problem. ... Effectiveness is not a characteristic of an algorithm. Effectiveness is a criteria that every algorithm must satisfy (besides others, like definiteness and finiteness).
Answer:
A set of instructions designed in a specific notation with a particular rule set is called an algorithm. In an algorithm, a step-by-step instruction set is defined to get a desired output. Definiteness of an algorithm is defined as the precision maintained in each step clearly to avoid any kind of ambiguity. While Effectiveness of an algorithm ensures that each step of the algorithm should be executed in a finite time. It means each step should be practically feasible to implement.
Explanation:
Definiteness -
X = 1
In above instruction, the value of x remains constant, thus it shows definiteness.
Toss a coin, if head X = 1, if tail x =2
In above instruction, there are two possible values of X, hence this ambiguity removes the definiteness of the algorithm.
Effectiveness -
X = 1/Y + 1/Z
In above instruction, value of X can be determined in a finite time. This is called effectiveness.
X = 1/Y + 1/Z.......... n(1/n)
In above instruction, the value of X changes in a loop upto N number of times, so there is no effectiveness.