[3] Algorithms

[5.2] What is a primitive?

A collection of primitives along with a collection of rules stating how the primitives can be combined to represent more complex ideas constitutes a programming language.

[5.2] What is a primitive?

A primitive is a well-defined set of building blocks from which algorithm representations can be constructed, removing problems of ambiguity.

[5.1] What is a process?

A process Is the activity of executing a program. 1

[5.1] What is a program?

A program is a formal representation of an algorithm designed for computer application

[5.1] What is a flip-flop algorithm?

Algorithms executed by circuits such as the flip-flop, where each gate performs a single step of the overall algorithm). These steps are ordered by cause and effect, as the action of each gate propagates throughout the circuit.

[5.1] What is an algorithm?

An algorithm is an ordered set of unambiguous, executable steps that defines a terminating process. The steps in an algorithm must have a well-established structure in terms of the order of their execution.

[5.1] What are the requirements of an algorithm?

Effective, unambiguous, and terminating process. Effective is the term used to capture the concept of being executable or doable. Unambiguous means that the information in the state of the process must be sufficient to determine uniquely and completely the actions required by each step. A terminating process means that the execution of an algorithm must lead to an end.

[5.2] What are semantics?

Semantics refers to the meaning of the primitive.

[5.2] What is syntax?

Syntax refers to the primitive's symbolic representation.

[5.1] What is a parallel algorithm?

The steps do not necessarily have to be executed in a sequence consisting of a first step, followed by a second. Parallel algorithms contain more than one sequence of steps, each designed to be executed by different processors in a multiprocessor machine. The algorithm's structure is that of multiple threads that branch and reconnect as different processors perform different parts of the overall task.

[5.2] What are higher-level primitives?

Usually, a collection of "higher-level" primitives, each being an abstract tool constructed from the lower-level primitives, is used to represent algorithms for computer execution. The result is a formal programming language in which algorithms can be expressed at a conceptually higher level than in a machine language.

[5.2] What is pseudocode?

Pseudocode is a notational system in which ideas can be expressed informally during the algorithm development process. A pseudocode must have a consistent, concise notation for representing recurring semantic structures.