An algorithm is a defined set of step-by-step procedures or a set of rules to be followed to perform a specific task or solve a problem. Here are the characteristics that describe an algorithm:
Unambiguous rules: Each step of an algorithm must be clearly defined and unambiguous. There should be no confusion in interpreting the instructions.
Definiteness: The algorithm should have a clear starting and stopping point, leading to a precise output after a finite number of steps.
Finiteness: Algorithms must terminate after a finite number of steps. They cannot run indefinitely.
Input and Output: An algorithm should take zero or more inputs and produce at least one output.
Therefore, the correct answer is "Unambiguous rules," as it directly reflects the essential characteristic of an algorithm being precise and clear in its steps.
References
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, "Introduction to Algorithms," MIT Press.
Donald E. Knuth, "The Art of Computer Programming," Addison-Wesley.
