Algorithm - programming language, Basic Computer Science

Algorithm: Once a problem has been defined precisely, a procedure or process must be designed to produce the required output from the given input. Since a computer is a machine that does not possess problem-solving judgmental capabilities, this procedure must be designed as a sequence of simple and unambiguous steps. Such a procedure is known as an  algorithm.   

The steps that comprise an algorithm must be organized in a logical, clear manner so that the program that implements this algorithm is similarly well structured. Number of steps in the algorithm should be finite, they should be executed in finite amount of time and they should give the desired output.  

Algorithms  are designed using three basic methods of control:   

a)  Sequential  :  Steps are performed in a strictly sequential manner, each step being executed exactly once. 

b)  Decision/Selection  :  One of several alternative actions is selected and executed. 

c)  Repetition : One or more steps is performed repeatedly.  Any algorithm can be constructed using basic methods of control.   

Posted Date: 10/23/2012 3:32:15 AM | Location : United States

Related Discussions:- Algorithm - programming language, Assignment Help, Ask Question on Algorithm - programming language, Get Answer, Expert's Help, Algorithm - programming language Discussions

Write discussion on Algorithm - programming language
Your posts are moderated
Related Questions
is there any oppurtunity for a mca to teach mcasubjects online

can u write my assignment for me

TYPES OF PC:  In general,  basic function of all the computers is same i.e. Computers accept data as input, perform operations on these data and generates the desired output t

Padovan sequence

Question 1 What are the various steps involved in pre-production design? Question 2 What are the different kinds of perspectives used in a layout? Question 3 Descr

what is ms words in parts ms words in life?

1. In discussing software algorithms for mutual exclusion, we noted that optimizing compilers and out-of-order execution by processors could invalidate most of these algorithms bec

what is the meaning of data definition