FUNDAMENTALS OF COMPUTER

Detailed explanation-1: -Yes, an algorithm should always stop after a finite number of steps, otherwise we would call it a procedure or process or computation specification. A procedure that doesn’t halt for certain inputs can be considered partial algorithms. Algorithms are more useful, since they terminate for any input.

Detailed explanation-2: -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.

Detailed explanation-3: -finiteness: if we trace out the instructions of an algorithm, then for all cases the algorithm will terminate after a finite number of steps; effectiveness: every instruction must be sufficiently basic that it can in principle be carried out by a person using only pencil and paper.

Detailed explanation-4: -Finiteness: An algorithm must be finite. Finiteness in this context means that the algorithm should have a limited number of instructions, i.e., the instructions should be countable. Effectiveness: Because each instruction in an algorithm affects the overall process, it should be adequate.

Detailed explanation-5: -Algorithms halt in a finite amount of time Algorithms should be composed of a finite number of operations and they should complete their execution in a finite amount of time.