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

Necessary nurses records, Necessary Nurses Records The software shoul...

Necessary Nurses Records The software should generate all registers/reports in detail summary for various permutations and combinations of options. A powerful SQL (Structure

Opening documents situated on different computers - network, Opening Docume...

Opening Documents Situated on Different Computers In order to work with documents situated on other computers, you need sufficient rights to access the folder in which it is

Database, #after writing the script of rebuilting indexed on db server it g...

#after writing the script of rebuilting indexed on db server it gave output command executed succesfully does this mean i m done

What is a search engine? explain its various parts, Question 1 What are th...

Question 1 What are the dos and don'ts of Internet Reporting? Question 2 Write a long note on the later years of journalism in USA Question 3 What is a search engi

Characterizations of artificial intelligence, Characterizations of Artifici...

Characterizations of Artificial Intelligence Artificial Intelligence is a typical science to describe, because it has fuzzy borders with, psychology, computer science, mathemat

GNF, what does it means

what does it means

Differentiate Preemptive and Nonpreemptive Scheduling?, The Scheduling algo...

The Scheduling algorithms can be divided into two parts with respect to how they deal with clock interrupts. 1) Nonpreemptive Scheduling: A scheduling

Why assembly language is good?, Because it is enormously low level, assembl...

Because it is enormously low level, assembly language can be optimized enormously well. Therefore assembly language is used where the extreme performance is needed for applications

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