1. which of the following is true of algorithms?\na. algorithms may have an infinite set of instructions\nb…

1. which of the following is true of algorithms?\na. algorithms may have an infinite set of instructions\nb. algorithms must be expressed using a programming language\nc. every algorithm can be constructed using combinations of sequencing, selection, and iteration\nd. every problem can be solved with an algorithm

1. which of the following is true of algorithms?\na. algorithms may have an infinite set of instructions\nb. algorithms must be expressed using a programming language\nc. every algorithm can be constructed using combinations of sequencing, selection, and iteration\nd. every problem can be solved with an algorithm

Answer

Brief Explanations:

  • Option A: Algorithms must have a finite set of instructions to terminate.
  • Option B: They can be expressed in natural - language, pseudocode etc., not just programming languages.
  • Option C: Sequencing (order of steps), selection (if - else decisions), and iteration (loops) are fundamental building blocks for constructing algorithms.
  • Option D: There are undecidable problems that cannot be solved by an algorithm.

Answer:

C. Every algorithm can be constructed using combinations of sequencing, selection, and iteration