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
Have you ever thought about the handling of our files in operating system? Why do we contain a hierarchical file system? How do files saved & deleted under hierarchical directories

Q. By giving an example show how multidimensional array can be represented in one the dimensional array.

File organisation might be described as a method of storing records in file. Also, the subsequent implications approaching these records can be accessed. Given are the factors invo

Ask question #Minima binary search tree is used to locate the number 43 which of the following probe sequences are possible and which are not? explainum 100 words accepted#

The best algorithm to solve a given problem is one that requires less space in memory and takes less time to complete its execution. But in practice it is not always possible to

Q. Define a sparse matrix. Explain different types of sparse matrices? Show how a triangular array is stored in memory. Evaluate the method to calculate address of any element ajk

Define the term 'complexity of an algorithm; Complexity of an algorithm is the calculate of analysis of algorithm. Analyzing an algorithm means predicting the resources that th

Write a detailed description of a function that takes in an integer as an argument, then prints out the squares of all positive integers whose squares are less than the input. (The

Q. Perform implementation of a queue using a singly linked list L. The operations INSER and DELETE should take O (1) time.

Complexity is the rate at which the needed storage or consumed time rise as a function of the problem size. The absolute growth based on the machine utilized to execute the program