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
that will determine the volume of the sphere or the volume of cone or volume of pyramid depending on the choice of the user

Assertions and Abstract Data Types Even though we have defined assertions in terms of programs, notion can be extended to abstract data types (which are mathematical entities).

In this section, we will discuss about Sequential file organization. Sequential files have data records stored in a particular sequence. A sequentially organized file might be stor

Define the term array. An array is a way to reference a series of memory locations using the same name. Each memory location is represented by an array element. An  array eleme

red black tree construction for 4,5,6,7,8,9

write an algorithm for multiplication of two sparse matrices using Linked Lists

Using stacks, write an algorithm to determine whether the infix expression has balanced parenthesis or not Algorithm parseparens This algorithm reads a source program and

Q. Which are the two standard ways of traversing a graph?  Explain them with an example of each.  Ans:   T he two ways of traversing a graph are written below

Draw trace table and determine the output from the below flowchart using following data (NOTE: input of the word "end" stops program and outputs results of survey):  Vehicle = c

Write a procedure (make-stack) that produces independent stack objects, using a message-passing style, e.g. (define stack1 (make-stack))  (define stack2 (make-stack)) W