Definition of algorithm , Basic Computer Science

Definition of  Algorithm 

An algorithm is a design or plan of obtaining a solution to a problem. The solution is presented by listing all steps in which they are carried out.
i) determine the correctness of the various steps.

ii) reduce the number of steps, if possible.

iii) increase the speed of solving the problem.

Suppose you want to calculate simple interest, if principal, time and rate of interest are given . The algorithm for solving this problem is given below.

Algorithm :
1. Read principal, time and rate of interest into three locations labelled as P,T,R.
2. Calculate S.I = PTR/100 (where S.I meens Simple interest)
3. Print S.I
4. Stop

Posted Date: 8/29/2012 4:02:46 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
Where can I find power supply HIPRO HP-W460GC33 for Silicon Graphics Fuel computer

Question 1 Briefly explain Registers Question 2 What are complier and interpreter? Question 3 Explain the process of installing Windows XP Question 4 Wr

Software interruptions can be thoroughly activated by the assembler invoking the number of the preferred interruption with the INT instruction. The use of interruptions aids us in

TELECOMMUNICATIONS STANDARDS: They are defined internationally by the CCITT (Consultative Committee for International Telegraphy and Telephones), but to deal with the rapidly

what is cpu

what does it means

FCFS algorithm also known as: • First-In-First-Out (FIFO) • Run-Until-Done • Run-to-Completion • Possibly, First-Come-First-Served algorithm is the easiest scheduling algorithm i


how do you let kids learn on it