COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Unambigous
|
|
|
Input
|
|
|
Output
|
|
|
Finiteness
|
Detailed explanation-1: -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. Feasibility − Should be feasible with the available resources.
Detailed explanation-2: -Output specified: An algorithm should have 1 or more well-defined outputs and should match with the expected output.
Detailed explanation-3: -All algorithms must satisfy the following criteria: Zero or more input values. One or more output values.
Detailed explanation-4: -A good algorithm should produce the correct outputs for any set of legal inputs. A good algorithm should execute efficiently with the fewest number of steps as possible. A good algorithm should be designed in such a way that others will be able to understand it and modify it to specify solutions to additional problems.
Detailed explanation-5: -An algorithm should have one or more inputs externally and it should produce one or more output.