Question

An Algorithm has____number of inputs

Answer 1

Answer:

0 or more inputs

Explanation:

An algorithm must possess the following properties:

finiteness: The algorithm must always terminate after a finite number of steps.

definiteness: Each step must be precisely defined; the actions to be carried out

must be rigorously and unambiguously specified for each case.

input: An algorithm has zero or more inputs, taken from a specified set of

objects.

output: An algorithm has one or more outputs, which have a specified

relation to the inputs.

effectiveness: All operations to be performed must be sufficiently basic that they

can be done exactly and in finite length.