Question

Исключи из предложенных сочетаний слов те, которыеневозможны в информатике:1) Линейный алгоритм; 2) Циклический алгоритм;3) Круговой алгоритм; 4) Разветвляющийся алгоритмНУ СРОЧНО НАДО)

Answer 1

НЕТ!!!! НЕ ПРАВИЛЬНО!!! Кругового не бывает! Потому что круговой это и есть циклический! Ответ: 3

Answer 2

So, let's analyze the given combinations of words and determine which ones are not possible in computer science:

1) Линейный алгоритм (Linear algorithm): This combination of words is possible in computer science. A linear algorithm refers to an algorithm that executes a sequence of instructions in a straight line, without any loops or branches.

2) Циклический алгоритм (Cyclic algorithm): This combination of words is possible in computer science. A cyclic algorithm refers to an algorithm that contains loops or repetitive structures, allowing the execution of a set of instructions multiple times.

3) Круговой алгоритм (Circular algorithm): This combination of words is not commonly used in computer science. There is no widely recognized concept of a "circular algorithm" in the field. It is possible that this term is used in a specific context or by a particular author, but it is not a standard term in computer science.

4) Разветвляющийся алгоритм (Branching algorithm): This combination of words is possible in computer science. A branching algorithm refers to an algorithm that includes conditional statements or branches, allowing the execution of different sets of instructions based on certain conditions.

Based on the analysis, the combination of words "Круговой алгоритм" (Circular algorithm) is the one that is not commonly used in computer science.