COMPUTER SCIENCE AND ENGINEERING
ALGORITHMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
State
|
|
|
Statement
|
|
|
Conditions
|
|
|
Function
|
|
|
Instruction
|
Detailed explanation-1: -The state represented in an algorithm is a set of variables. At any place, the value of the variables are substituted and evaluation is done. Concept: Algorithms.
Detailed explanation-2: -An algorithm has the following properties: finiteness-the process terminates, the number of steps are finite. definiteness-each step is precisely stated. effective computability-each step can be carried out by a computer.
Detailed explanation-3: -An algorithm is a set of commands that must be followed for a computer to perform calculations or other problem-solving operations. According to its formal definition, an algorithm is a finite set of instructions carried out in a specific order to perform a particular task.
Detailed explanation-4: -A CONDITIONAL is a type of step in an algorithm where a decision must be made. Computers follow logical instructions and they need to know how to handle different decisions so that programs can proceed no matter what the outcome of those selections may be.