Question

an algorithm should involve finite number of steps to reach to a solution
true or false..​

Answer 1

Answer: yes, this is true that an algorithm requires finite number of steps for reaching the solution

Answer 2

Answer:

An algorithm should involve a finite number of steps to reach a solution

True

Explanation:

estimate the following are the steps needed for an exertion riding a bike

1) remove the bike from the platform,

2) set on the seat of the bike,

3) start hawking,

4) exercise breaks whenever demanded and

5) break on reaching the destination.

allow us currently find the Greatest Common Divisor( GCD) of the two

Figures 45 and 54.

remark GCD is the largest number that divides both the

given figures.

Step 1 determines the figures( divisors) which can divide the

given Figures

Divisors of 45 are 1, 3, 5, 9, 15, and 45

Divisors of 54 are 1, 2, 3, 6, 9, 18, 27,

and 54

Step 2 also determines the largest common figure from these

two lists.

thus, GCD of 45 and 54 are 9

Hence, it's crystal clear that we require to succeed in a sequence

of steps to negotiate the assignment.

Such a finite sequence of steps needed to pick up the asked product is called an algorithm. It'll direct to the asked result in a finite quantum of time if succeeded rightly. The algorithm has a definite start and a finite end and consists of a limited number of steps.

#SPJ3