Chapter: Problem Solving and Python Programming : Algorithmic Problem Solving

Study Material, Lecturing Notes, Assignment, Reference, Wiki description explanation, brief detail

Algorithm

It is defined as a sequence of instructions that describe a method for solving a problem.

ALGORITHM

 

It is defined as a sequence of instructions that describe a method for solving a problem. In other words it is a step by step procedure for solving a problem.

 

Properties of Algorithms

v   Should be written in simple English

v   Each and every instruction should be precise and unambiguous.

v   Instructions in an algorithm should not be repeated infinitely.

v   Algorithm should conclude after a finite number of steps.

v   Should have an end point

v   Derived results should be obtained only after the algorithm terminates.

 

Qualities of a good algorithm

The following are the primary factors that are often used to judge the quality of the algorithms.

Time To execute a program, the computer system takes some amount of time. The lesser is the time required, the better is the algorithm.

Memory To execute a program, computer system takes some amount of memory space. The lesser is the memory required, the better is the algorithm.

Accuracy Multiple algorithms may provide suitable or correct solutions to a given problem, some of these may provide more accurate results than others, and such algorithms may be suitable.

Example

Write an algorithm to print „Good Morning”

Step 1: Start

Step 2: Print “Good Morning”

Step 3: Stop

 

Study Material, Lecturing Notes, Assignment, Reference, Wiki description explanation, brief detail


Copyright © 2018-2020 BrainKart.com; All Rights Reserved. Developed by Therithal info, Chennai.