Definition of algorithm, Data Structure & Algorithms

Definition of Algorithm

Algorithm must have the following five characteristic features:

1.      Input

2.      Output

3.      Definiteness

4.      Effectiveness

5.      Termination.

Thus, an algorithm can be described as a sequence of definite & effective instructions, which terminates along the production of correct output from the given input.

Posted Date: 4/4/2013 5:39:19 AM | Location : United States







Related Discussions:- Definition of algorithm, Assignment Help, Ask Question on Definition of algorithm, Get Answer, Expert's Help, Definition of algorithm Discussions

Write discussion on Definition of algorithm
Your posts are moderated
Related Questions
You are given two jugs, a 4-gallon one and a 3-gallon one. Neither has any measuring marker on it. There is a tap that can be used to fill the jugs with water. How can you get exac

Thread By changing the NULL lines in a binary tree to special links known as threads, it is possible to perform traversal, insertion and deletion without using either a stack

Algorithm for determining strongly connected components of a Graph: Strongly Connected Components (G) where d[u] = discovery time of the vertex u throughout DFS , f[u] = f

what is folding method?

If a Dequeue is implemented via arrays, then this will suffer with the similar problems which a linear queue had suffered. Program 8 gives the array implementation of Dequeue.

1. In computer science, a classic problem is how to dynamically store information so as to let for quick look up. This searching problem arises frequently in dictionaries, symbol t

#quCreate a flowchart to show the process that will allow the implementation of Queue, Enqueue, and Dequeue operations.estion..

Define neotaxonomy. Discuss how electron microscopy can help in solving a zoological problem faced by taxonomist.

Binary Search Tree usage: Write a program to compare the time taken for a search in a skewed tree, a balanced tree, and a random tree. Speci cally, your program should do the

Explain the Interfaces in Ruby Recall that in object-oriented programming, an interface is a collection of abstract operations that cannot be instantiated. Even though Ruby i