Scribd
Upload
49 views

Answer:: 1. Define An Algorithm. What Are The Properties of An Algorithm ?

An algorithm is a step-by-step procedure for solving a problem or making a decision. Algorithms have properties of finiteness, definiteness, inputs, outputs, and effectiveness. Specifically, an algorithm must terminate after a finite number of steps, each step must be unambiguous, an algorithm accepts inputs and produces outputs, and the instructions in an algorithm must be possible to perform in a finite time period.

Uploaded by

Abhishek Ranjan
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
49 views

Answer:: 1. Define An Algorithm. What Are The Properties of An Algorithm ?

An algorithm is a step-by-step procedure for solving a problem or making a decision. Algorithms have properties of finiteness, definiteness, inputs, outputs, and effectiveness. Specifically, an algorithm must terminate after a finite number of steps, each step must be unambiguous, an algorithm accepts inputs and produces outputs, and the instructions in an algorithm must be possible to perform in a finite time period.

Uploaded by

Abhishek Ranjan
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

1. Define an algorithm. What are the properties of an algorithm ?

Answer: Algoritham 1, a step-by-step method of solving a problem or making decisions, as in making a diagnosis. 2. an established mechanical procedure for solving certain mathematical problems. Properities of the algorithm ) Finiteness: - an algorithm terminates after a finite numbers of steps. 2) Definiteness: - each step in algorithm is unambiguous. This means that the action specified by the step cannot be interpreted (explain the meaning of) in multiple ways & can be performed without any confusion. 3) Input:- an algorithm accepts zero or more inputs 4) Output:- it produces at least one output. 5) Effectiveness:- it consists of basic instructions that are realizable. This means that the instructions can be performed by using the given inputs in a finite amount of time.

You might also like