The theory of algorithms. Test. (79 Issues).

The list of questions:
"Abstraction of potential realizability" does not apply to:
"Abstraction of potential realizability" - is:
"Every algorithm corresponds to a task for which it was built," - whether the converse is true?
... Are tools designed for immediate implementation of the algorithm on a computer
Compilation chart of one cycle is executed in the following (bigger) sequence
Abstract algorithmic models (non-existent deleted):
Algorithm - is:
The algorithm in the alphabet A is defined as:
The algorithm involves branching if:
The algorithm is called a linear:
The algorithm is called cyclic:
An algorithm for solving some subtasks are usually carried out repeatedly, is called:
The algorithm can be called ...
Basic algorithmic structures which should always be used in the design of algorithms for linear computational processes.
Basic algorithmic structures which should always be used in the design of algorithms for computing branching processes.
Basic algorithmic structures which should always be used in the design of algorithms for computing cyclic processes.
At what point in the program description of the procedure can be located?
Counting on who or what should be built algorithm?
External memory Turing machine:
The internal memory of the Turing machine:
All algorithmic tasks can be divided into the following classes (delete highlight):
Computable function - is:
Two algorithms A1 and A2 in some alphabet are called equivalent if:
For any number of states of the Turing machine:
To solve the problem on a computer perform the following steps in the following order
If these problems include a set of values \u200b\u200bof the magnitude and the variation of their known, ...
If these problems include a set of values \u200b\u200bof the magnitude and the variation of unknown, ...
Write an algorithm in the form of graphic symbols called
Record algorithm using algorithmic language is called
There matrix A [n, m] (n = m). What type should be the primary Started th formula for solving the problem of determining the arithmetic mean of the elements on the main diagonal
There is a matrix A [n, m] (n, m - the even). What type should have a basic working formula for the solution of the problem of determining the elements of each odd column of the right half of the matrix
The class of tasks is determined by a Turing machine:
Composition of Turing machines are:
Specific Turing machine is specified:
Constructive mathematics is different from the classic:
The mathematical formulation of the problem - formulation of the problem as a problem of a branch of mathematics in the following order
Matrix A [n, m] (t - a multiple of four) is divided vertically into two halves. Determine the sum of the elements of each column of the left and even the elements of each column of the right half of the matrix A. The sequence of solving the problem
A Turing machine is:
A Turing machine consists of (insert extra component):
A set is called solvable if:
Can we, without solving the problem, prove that it is algorithmically unsolvable:
The general definition of an algorithm - a "method (method) for solving the problem, recorded by certain rules, providing ..."
Operand - is:
The operator is called:
Define the term "algorithm in the alphabet A":
Defines the parameters of the normal algorithm A.Markova are:
The main components of a structured approach to programming
Under construction ... understand the algorithm for solving the problem, the result of which is to identify the stages of data processing, the formal record of the content of these stages and determination of the order of their implementation
Routines (procedure) is called:
Full state of the Turing machine, which uniquely identifies it
The concept of "normal algorithm" entered into constructive