13. finite number of steps but sumtyms in infinite number of steps
An algorithm must terminate in :
1. one step
2. finite number of steps
3. finite number of steps but sumtyms in infinite number of steps
4. none.
-
UP 0 DOWN 0 0 7
7 Answers
113no ankit ...the ans is b...
waise which chapter is it frm?
1a list of five properties that are widely accepted as requirements for an algorithm:
1. Finiteness: "An algorithm must always terminate after a finite number of steps"
2. Definiteness: "Each step of an algorithm must be precisely defined; the actions to be carried out must be rigorously and unambiguously specified for each case"
3. Input: "...quantities which are given to it initially before the algorithm begins. These inputs are taken from specified sets of objects"
4. Output: "...quantities which have a specified relation to the inputs"
5. Effectiveness: "... all of the operations to be performed in the algorithm must be sufficiently basic that they can in principle be done exactly and in a finite length of time by a man using paper and pencil"
1algorithm is there in computers
before designing any program we write the steps in which that works .. these steps form an agorithm
1algorithm toh kuch nahi haen yaar..
jus d stepwise instruction u give to d comp..
so d ans is obviously b)...
as u ll never have infinite instruction:)
