Definition of algorithm , Basic Computer Science

Assignment Help:

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


Related Discussions:- Definition of algorithm

Project, My son has a project assignment he has problem with. The only thin...

My son has a project assignment he has problem with. The only thing is, it is due in 20 mins. can someone be able to help him? if so, how much is the fee?

The central processing unit (cpu), THE CENTRAL PROCESSING UNIT (CPU): T...

THE CENTRAL PROCESSING UNIT (CPU): The CPU is the heart of any computing system.  It executes the individual machine instructions, which make up a program. The CPU is formed fr

Server programs, Server Programs:   Server programs are dedicated compu...

Server Programs:   Server programs are dedicated computer programs that run as services and serve the needs or requests of other programs. These services may run on a dedicated

Find job, I want assignment writingjob

I want assignment writingjob

Computer architecture, Consider a CPU that implements two parallel fetch-ex...

Consider a CPU that implements two parallel fetch-execute pipelines for superscalar processing. Show the performance improvement over scalar pipeline processing and no-pipeline pro

Problem solving using a computer, PROBLEM SOLVING USING A COMPUTER The ...

PROBLEM SOLVING USING A COMPUTER The following steps are required for solving a problem using a computer system:     Problem Definition     Program Planning (Preparati

Algorithms, 1. In each of the following situations, indicate whether f = O...

1. In each of the following situations, indicate whether f = O(g), or f = O(g), or both (in which case f = T(g)). Briefly explain why. (a) f(n)=10n5 +8n2,g(n)=20n4 +7n3 +300 (b) f

#algorithm, #to determine whether given year is leap year or not

#to determine whether given year is leap year or not

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd