- Arts & Culture 4552
- Books in Foreign Languages 202
- Business & Economics 4689
- Computers 2357
- Dictionaries & Encyclopedias 675
- Education & Science 80647
- Abstracts 1266
- Astrology 14
- Astronomy 13
- Biology 40
- Chemistry 3388
- Coursework 3778
- Culture 30
- Diplomas 2710
- Drawings 1709
- Ecology 31
- Economy 330
- English 1254
- Entomology 2
- Ethics, Aesthetics 29
- For Education Students 21579
- Foreign Languages 118
- Geography 19
- Geology 17
- History 231
- Maps & Atlases 41
- Mathematics 6113
- Musical Literature 5
- Pedagogics 221
- Philosophy 190
- Physics 13016
- Political Science 131
- Practical Work 112
- Psychology 490
- Religion 51
- Russian and culture of speech 103
- School Textbooks 70
- Sexology 67
- Sociology 53
- Summaries, Cribs 917
- Tests 21577
- Textbooks for Colleges and Universities 209
- Theses 185
- To Help Graduate Students 19
- To Help the Entrant 110
- Vetting 343
- Works 57
- Информатика 9

- Engineering 2996
- Esoteric 1168
- Fiction 3165
- For Children 420
- House, Family & Entertainment 2528
- Law 2883
- Medicine 1225
- Newspapers & Magazines 332
- Security 315
- Sport, Tourism 993
- Website Promotion 681

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

Refunds: 0

Uploaded:

**26.08.2014**

Content: 40826153319373.rar (73,45 kB)

# Seller

RD.Pro information about the seller and his itemsSeller will give you a gift certificate in the amount of **28** RUB

# Description

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

# Additional information

The concept of the algorithm in some alphabet of A.Markovu:

Statement of the problem is an important preparatory work before the creation algorithm and includes the following steps

Building a chart of tasks performed in the following sequence

... When the successive phases of calculations is given in any form of natural language

... When the graphic image is formed of the logical structure of the algorithm

The program for solving the problem on a computer is

Algorithmization process is divided into the following stages (specify extra):

The work of the Turing machine can be described by a set of rules (insert extra):

The property of the algorithm, which is called ... is the possibility of dividing the computing process into individual elementary operations.

Property of the algorithm, which is called ... means a set of instructions that must be precise and eliminating ambiguity in the interpretation

The property of the algorithm, which is called ... is possible to obtain information after the application of rules resulting from

Property of the algorithm, which is called ..., it means that algorithm must be suitable for solving all the problems of this type

The substantive problem statement (statement of the problem, are set out in terms of a certain subject area) includes the following main points

Compare the features of the solution of the two kinds of word processing tasks - tasks that comes to processing text arrays and tasks that need to operate with the texts themselves

The strict definition programming looks like a "process of compiling a computer program, that is an ordered sequence of actions implementing the algorithm for solving a problem." What is the concept in this definition is the primary

The essence of such properties as the discrete algorithm is that:

The essence of such properties as mass algorithm is that:

The essence of such properties as the definition of the algorithm is that:

The essence of the properties of the algorithm as it is clear is that:

The essence of such properties as the effectiveness of the algorithm is that:

Tact Turing machine is considered to be:

Turing thesis:

Specify the most comprehensive list of ways to write algorithms:

Specify the correspondence between the names and definitions of stages of formulation of the problem

The formalization of the problem - provide baseline data and methods for solving the problem in a way that can be implemented by means of programming languages, in the following order

Formal execution of the algorithm - it's ...

The steps of the algorithm are (delete superfluous)

Elementary operators may be of the following types:

# Feedback

0Period | |||

1 month | 3 months | 12 months | |

0 | 0 | 0 | |

0 | 0 | 0 |

**28 RUB**