Question

2. Fill in the blanks.
Finite
Pseudo code
Primitives
Identification
Flowcharts
a.
Basic operations used for writing algorithms are known as ......
b. Algorithms are composed of a
...... number of operations and should complete their
execution in a finite amount of time.
C. The steps in an algorithm must be clearly defined in a
d.
are a better way to communicate the logic of a system to everyone.
of the processes and decision points reduces the task into a series of smaller
steps of more manageable size.
e.​

Answer 1

Answer:

(a) Primitive Operations

(b) division by zero or finding the square root of a negative

(c) Specific number.

(d) Effective Communication

Explanation:

(a) Algorithms have unambiguous operations

The operation "Sort these numbers" is ambiguous to a computer because the computer has no basic operations for sorting. Basic operations used for writing algorithms are known as primitive operations or primitives.

(b) To be useful, an algorithm must meet certain requirements: Algorithms have computable operations. Each step in an algorithm must be something that is possible to do. For computers, many mathematical operations such as division by zero or finding the square root of a negative number are also impossible.

(c) 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.

(d) The imparting or exchanging of information by speaking, writing, or using some other medium” and “means of sending or receiving information, such as telephone lines or computers.”

Hope it helps!

Mark me as brainliest