COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
TRUE
|
|
|
FALSE
|
|
|
Either A or B
|
|
|
None of the above
|
Detailed explanation-1: -Unambiguity, fineness, effectiveness, and language independence are some of the characteristics of an algorithm. The scalability and performance of an algorithm are the primary factors that contribute to its importance.
Detailed explanation-2: -Output: The algorithm must specify the output and how it is related to the input. Definiteness: The steps in the algorithm must be clearly defined and detailed. Effectiveness: The steps in the algorithm must be doable and effective. Finiteness: The algorithm must come to an end after a specific number of steps.
Detailed explanation-3: -Description. Use the INPUT statement to halt program execution and prompt the user to enter a response. Data entered at the terminal or supplied by a DATA statement in response to an INPUT statement is assigned to variable. Input supplied by a DATA statement is echoed to the terminal.
Detailed explanation-4: -An algorithm must be a systematic method for producing a specified result. An algorithm must contain a loop. A loop in an algorithm must also include a test for finiteness.