FUNDAMENTALS OF COMPUTER

Detailed explanation-1: -Since an algorithm is a collection of operations or instructions, we must know the correct order in which to execute the instructions. If the order is unclear, we may perform the wrong instruction or we may be uncertain which instruction should be performed next.

Detailed explanation-2: -The order of growth of an algorithm is an approximation of the time required to run a computer program as the input size increases. The order of growth ignores the constant factor needed for fixed operations and focuses instead on the operations that increase proportional to input size.

Detailed explanation-3: -Answer: b) Algorithms are step-by-step rules for reaching a particular solution. Explanation: Algorithm is defined as step-vise procedure of solving and gaining a definite answer for a particular problem.

Detailed explanation-4: -An important aspect of any algorithm is that it is correct: it always produces the expected output for the range of inputs and it eventually terminates.

Detailed explanation-5: -It is crucial that the steps in an algorithm are performed in the right order-otherwise the algorithm will not work correctly.