What do we mean by algorithm? What are the characteristics of a good and relevant algorithm? An algorithm is "a step-by-step procedure for finishing some task'' An algorithm can be specified in many ways. For example, it can be written down in English (or French, or any other language). However, we are interested in algorithms which have been specifically specified using an appropriate mathematical formalism--such as a programming language. Each and Every algorithm should have the following five characteristics: 1.Input characteristics: The algorithm should be taking zero or more input. 2. Output characteristics: The algorithm should be producing one or more outputs. 3. Definiteness characteristics: All the steps of algorithm should be defined unambiguously. 4. Effectiveness characteristics: A person should be able to calculate the values involved in the process of the algorithm using paper and pencil. 5. Termination characteristics: An algorithm must terminate after a finite number of steps which means it should not be infinite.   Posted Date: 7/9/2012 9:47:44 PM | Location : United States

Ask an Expert

Your posts are moderated

Write your message here..

Related Questions

Basic datastructures, sample infosys campusconnect questions sample infosys campusconnect questions

A tree having ''m'' nodes has (m-1) branches. prove., Q. Prove the hypothes... Q. Prove the hypothesis that "A tree having 'm' nodes has exactly (m-1) branches".      Ans: A tree having m number of nodes has exactly (m-1) branches Proof: A root

Properties of a red-black tree, Any binary search tree must contain followi... Any binary search tree must contain following properties to be called as a red-black tree. 1. Each node of a tree should be either red or black. 2. The root node is always bl

Graph, Multilist Representation of graph Multilist Representation of graph

Write the algorithm of the quick sort, Ans. An algorithm for the quick... Ans. An algorithm for the quick sort is as follows: void quicksort ( int a[ ], int lower, int upper ) { int i ; if ( upper > lower ) { i = split ( a, lower, up

Binary tree with depth 3, Q. Construct a complete binary tree with depth 3 ... Q. Construct a complete binary tree with depth 3 for this tree which is maintained in the memory using the linked representation. Make the adjacency list and adjacency matrix for t

A binary tree in which levels except possibly the last, A binary tree in wh... A binary tree in which if all its levels except possibly the last, have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is called as

Deletion and insertion from queues, explain deletion and insertion in a que... explain deletion and insertion in a queue

Stack, infix to revrse polish infix to revrse polish

B – trees, B-trees are special m-ary balanced trees utilized in databases s... B-trees are special m-ary balanced trees utilized in databases since their structure allows records to be added, deleted & retrieved with guaranteed worst case performance. A B-