Insertion sort
Inserting element in its proper place among those already considered (keeping them sorted).
merging
Combining two sorted files to make one larger
sorted file.
searching
Retrieving some particular information from a large amount of previously stored information.
selection sort
It works by repeatedly “selecting” the smallest
remaining element.
shell sort
А simple extension of insertion sort which gets around this problem by allowing exchanges of elements that are far apart.
stack
A section of memory and its associated registers used for temporary storage of information in which the item most recently stored is the first to be retrieved.
time-staggered queue
a list of data items, commands, etc., stored so as to be retrievable in a definite order, usually the order of insertion regulated by time.
queue
A sequence of stored data or programs awaiting processing. A data structure from which the first item that can be retrieved is the one stored earliest.
quicksort
The basic algorithm was invented in 1960 by C. A. R. Hoare, and it has been studied by many people since that time. It is a “divide-and-conquer” method for sorting. It works by partitioning a file into two parts, then sorting the parts independently.
IDIOMS
take (great) pains = be at pains (synonym)
(всячески) стараться, не жалеть сил, прилагать все усилия
Translate the following sentences into Russian.
The utilities use different algorithms that emphasize storage efficiency at the expense of speed.
The compression program uses some variation of a scheme generally called LZ (after its creators, Lempel and Ziv) adaptive dictionary-based algorithm.
In 1830, Charles Babbage invented-on paper-the Analytical Engine, which was different from its predecessors because, based on the results of its own computations, it could make decisions such as sequential control, branching, and looping.
The software simultaneously repositions the transported pixels and the polygons they form to warp the emerging image so the pixels move steadily toward the positions they occupied in the picture from which they came.
Translate the following sentences into English.
Чип хранит характеристики разных музыкальных инструментов в виде набора математических описаний называемых алгоритмами.
Центральный процессор все ставит в режим ожидания, что позволяет записать адрес возврата в стек.
Операционная система ставит эту операцию в очередь для последующего выполнения в указанное время (см. регулируемая временем очередь выполнения задач) в соответствии с запросами которые передаются на запоминающее устройство.
Цифровая подпись обычно создается путем вычисления свёртки сообщения или значения хеш-функции.
SPEAKING
SECTION
Answer the following questions.
What is an algorithm?
When people refer to a "computer algorithm," what exactly are they talking about?
What kinds of problems can be solved by algorithm?
How implementation of simple versions of basic algorithms can help?
Name sorting algorithms and explain where you can use them.
What have you learnt about searching methods?
Prepare
a presentation on the topic being discussed.
BACKGROUND
TO WRITING
TEXT FEATURES
Organization Of The Text
Explain the following terms in italic. Where can we apply them?
а) Introduction > Main Body > Conclusion
b) Abstract > Contents > Introduction > Main Body > Case Study > Discussion > Findings > Conclusion > Acknowledgements > Bibliography/References > Appendices
c) Dedication > Foreword > Preface > Index
Text Features are parts of the text that draw your attention to the important information.
