COMPUTER PROGRAMMING FUNDAMENTALS
WHAT IS PROGRAMMING
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Ambiguous.
|
|
|
Precise.
|
|
|
Finite number of steps.
|
|
|
Logical flow of control.
|
Detailed explanation-1: -Algorithms must terminate after a finite number of steps.An algorithm should not be infinite and always terminate after definite number of steps. There is no point in developing an algorithm which is infinite as it will be useless for us.
Detailed explanation-2: -Characteristics of an Algorithm Input − An algorithm should have 0 or more well-defined inputs. Output − An algorithm should have 1 or more well-defined outputs, and should match the desired output. Finiteness − Algorithms must terminate after a finite number of steps.
Detailed explanation-3: -Algorithms have unambiguous operations The operation “Sort these numbers” is ambiguous to a computer because the computer has no basic operations for sorting. Basic operations used for writing algorithms are known as primitive operations or primitives.
Detailed explanation-4: -Unambiguity, fineness, effectiveness, and language independence are some of the characteristics of an algorithm.