COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Which of the following is a characteristic of an algorithm?
|
|
Finiteness
|
|
|
Ambiguous
|
|
|
Dependent
|
|
|
Impossible
|
Explanation:
Detailed explanation-1: -Finiteness: An algorithm must be finite. Finiteness in this context means that the algorithm should have a limited number of instructions, i.e., the instructions should be countable. Effectiveness: Because each instruction in an algorithm affects the overall process, it should be adequate.
Detailed explanation-2: -An algorithm is a finite sequence of instructions for performing a task. By finite we mean that there is an end to the sequence of instructions.
Detailed explanation-3: -Answer: The algorithm doesn’t stop in a finite number of times. The algorithm doesn’t display the output.
There is 1 question to complete.