characteristics of algorithm

Avatar 37a3bd7bc7328f0ead2c0f6f635dddf60615e676e6b4ddf964144012e529de45 Uma asked over 3 years ago

    1       1 Answer Now Comment Report
6 Answers
Avatar 37a3bd7bc7328f0ead2c0f6f635dddf60615e676e6b4ddf964144012e529de45 veeru answered almost 3 years ago

1. Each and every instruction should be precise and unambiguous i.e. each and every instruction should be clear and should have only one meaning. 2. Each instruction should be performed in finite time. 3. One or more instructions should not be repeated infinitely. It means that the algorithm must terminate ultimately. 4. After the instructions are executed, the user should get the required results.

    0       0 Comment Report
Important Note – Preparing for IT?
CAKART provides Indias top faculty each subject video classes and lectures – online & in Pen Drive/ DVD – at very cost effective rates. Get video classes from CAKART.in. Quality is much better than local tuition, so results are much better.
Watch Sample Video Now by clicking on the link(s) below – 
For any questions Request A Call Back  
Avatar 37a3bd7bc7328f0ead2c0f6f635dddf60615e676e6b4ddf964144012e529de45 narahari answered about 3 years ago

How can we say that an algorithm is good or not??? For that we have two main characteristics which is the indication of a good algorithm. Two main characteristics of a good algorithm are: 1. Running Time: A good algorithm should have shortest running time when compared with others. 2. Space Utilization: Lesser the amount of space an algorithm uses, the better.

    0       0 Comment Report
Open uri20170510 32134 tcchcu?1494421832 Jitendra Suthar answered about 3 years ago

Hiiii Uma, **An algorithm has following characteristics:** 1. Each and every instruction should be precise and unambiguous i.e. each and every instruction should be clear and should have only one meaning. 2. Each instruction should be performed in finite time. 3. One or more instructions should not be repeated infinitely. It means that the algorithm must terminate ultimately. 4. After the instructions are executed, the user should get the required results. Regards,

    0       0 Comment Report
Avatar 37a3bd7bc7328f0ead2c0f6f635dddf60615e676e6b4ddf964144012e529de45 veeru answered about 3 years ago

1. An algorithm must have a beginning and an end 2. The non ambiguity requirement for each step of an algorithm cannot be compromised. 3. The range of inputs for which an algorithm works has to be specified carefully 4. The same algorithm can be represented in several different ways 5. Several algorithms for solving the same problem may exist 6. Algorithms for the same problem can be based on very different ideas and can solve the problem with dramatically different speeds

    1       0 Comment Report
Avatar 37a3bd7bc7328f0ead2c0f6f635dddf60615e676e6b4ddf964144012e529de45 lochan answered over 3 years ago

**CHARACTERISTICS OF ALGORITHMS** The following are the major characteristics in the design of algorithms 1. An algorithm must have a beginning and an end 2. The non ambiguity requirement for each step of an algorithm cannot be compromised. 3. The range of inputs for which an algorithm works has to be specified carefully 4. The same algorithm can be represented in several different ways 5. Several algorithms for solving the same problem may exist 6. Algorithms for the same problem can be based on very different ideas and can solve the problem with dramatically different speeds 7. It must terminate at a reasonable period of time. Thanks

    0       0 Comment Report
Avatar 37a3bd7bc7328f0ead2c0f6f635dddf60615e676e6b4ddf964144012e529de45 Diya Bhattacharya answered over 3 years ago

An algorithm has following characteristics: 1. **Precision**: Each and every step should be stated precisely and unambiguously. 2. **Finiteness**: Each instruction should be performed in finite time i.e. it must terminate in due time. 3. .**Uniqueness**: The instructions should not be repetitive and must only depend on the input and the result of the previous or preceding steps. 4. **Input**: An algorithm has zero or more but only finite, number of inputs. 5. **Output**: An algorithm must produce one or more outputs. 6. **Effectiveness**: Effective means each of the operation to be performed in an algorithm must be sufficiently basic that it can, in principle,be done exactly and in a finite length of time, by a person using pencil and paper. 7. **Result-Oriented**: After the instructions are executed, the user should get the required results.

    0       0 Comment Report
Get Notifications
Videos
Books
Notes
Loading
SIGN UP
Watch best faculty demo video classes

These top faculty video lectures will
help u prepare like nothing else can.