Добавил:
Upload Опубликованный материал нарушает ваши авторские права? Сообщите нам.
Вуз: Предмет: Файл:
ss.docx
Скачиваний:
38
Добавлен:
11.11.2019
Размер:
3.27 Mб
Скачать
  1. Find and learn Russian equivalents for the following words and expressions:

    1) general-purpose methods

    2) heap data structure

    3)divide-and-conquer algorithm

    4) insertion sort

    5) adjacent elements

    6) shell sort

    7) bubble sort

    8) quicksort

    9) string processing

    10) variable-length coding

    11) a message digest

  2. Find and learn English equivalents for the following words and expressions:

  1. структура данных в программировании

  1. очередь по приоритету

  1. древовидная сортировка, пирамидальная сортировка

  1. косвенная/нелинейная динамически распределяемая память

  1. сортировка методом выбора (наименьшего или наибольшего элемента)

  1. поразрядная сортировка

  1. продольное кодирование

  1. одноразовый (шифровальный) блокнот

  1. выпуклая оболочка

  1. связующее дерево (алгоритм, позволяющий установить множество параллельных независимых маршрутов между несколькими локальными сетями или сегментами таких сетей)

  1. значение хеш-функции

KEY CONCEPTS

algorithm

A procedure, rule, or formula for solving a problem. A computer program is essentially an elaborate algorithm that goes through a series of steps to arrive at a specific outcome.

branch

A sequence of program instructions to which the normal sequence of instructions relinquishes control, depending on the value of certain variables.

decomposition

Also known as factoring, refers to the process by which a complex problem or system is broken down into parts that are easier to conceive, understand, program, and maintain.

hash function

It is any well-defined procedure that converts a large, possibly variable-sized amount of data into a small datum, usually a single integer that may serve as an index to an array (cf. associative array). The values returned by a hash function are called hash values, hash codes, hash sums, checksums or simply hashes.

Hash functions are mostly used to speed up table lookup or data comparison tasks—such as finding items in a database, detecting duplicated or similar records in a large file, finding similar stretches in DNA sequences, and so on. A hash function may map two or more keys to the same hash value. In many applications, it is desirable to minimize the occurrence of such collisions, which means that the hash function must map the keys to the hash values as evenly as possible. Depending on the application, other properties may be required as well.

Соседние файлы в предмете [НЕСОРТИРОВАННОЕ]