 |
Литература: Программирование и ремонт Импульсные блоки питания Неисправности и замена Радиоэлектронная аппаратура Микросхема в ТА Рубрикатор ТА Кабельные линии Обмотки и изоляция Радиоаппаратура Гибкие диски часть 2 часть 3 часть 4 часть 5 Ремонт компьютера часть 2 Аналитика: Монтаж Справочник Электроника Мощные высокочастотные транзисторы 200 микросхем Полупроводники ч.1 Часть 2 Алгоритмические проблемы 500 микросхем 500 микросхем Сортировка и поиск Монады Передача сигнала Электроника Прием сигнала Телевидиние Проектирование Эвм Оптимизация Автомобильная электроника Поляковтрансиверы Форт Тензодатчик Силовые полевые транзисторы Распределение частот Резисторные и термопарные Оберон Открытые системы шифрования Удк
[289]
дметный указатель
0-1 knapsack problem, 336 | /г-строка, 101 |
cl 103 | /г-универсальное хеширова- |
O-notation, 32 | ние, 244 |
О-обозначение, 32 | ra-ary relation, 80 |
S7-notation, 32 | ra-set, 78 |
-обозначение, 32 | га-местное отношение, 80 |
O-notation, 30 | o-notation, 33 |
О-обозначение, 30 | о-обозначение, 33 |
©,103 | Delete, 198, 246 |
П, 76 | Insert,198, 246 |
U, 76 | Maximum, 198, 246 |
G, 75 | Minimum, 198, 246 |
N, 75 | Persistent-Tree-Insert, |
R, 75 | 281 |
Z, 75 | Predecessor, 198, 246 |
-notation, 33 | RB-Enumerate, 291 |
-обозначение, 33 | Randomized-Quicksort, 260 |
\, 76 | Random, 159 |
C, 76 | Search, 198, 246 |
C, 76 | Successor, 198, 246 |
0, 75 | nil, 14 |
rf-ary heap, 151 | nil, 95 |
d-ичная куча, 151 | «разделяй и властвуй» метод, |
fc-ary tree, 96 | 312 |
fc-coloring, 97 | |
-combination, 102 | absorption laws, 77 |
fc-permutation, 102 | activity-selection problem, 332 |
fc-string, 101 | acyclic subgraph, 354 |
fc-subset, 78 | adjacent vertex, 87 |
fc-substring, 101 | algorithm, 11 |
/г-universal hashing, 244 | algorithm/correctness of, 12 |
/г-ичное дерево, 96 | algorithm/greedy, 331 |
/г-подстрока, 101 | algorithm/randomized, 159 |
/г-раскраска, 97 | ancestor, 93 |
ancestor/proper, 93
antisymmetric relation, 81 argument, 83, 84 arithmetic series, 44 associative laws, 76 asymptotic efficiency, 30 asymptotic notation, 30 asymptotically nonnegative
function, 31 asymptotically tight bound, 31 attribute of an object, 14 average-case running time, 18 axioms of probability, 106
balanced tree, 266 balls, 129
Bayess theorem, 110 Bernoulli trials, 117 bijection, 84
binary character code, 338 binary entropy, 104 binary heap, 140 binary relation, 80 binary search, 23 binary search tree, 247 binary tree, 95, 214 binary-search-tree property, 247 binomial coefficients, 103 binomial distribution, 118 binomial expansion, 103 bins, 129
bipartite graph, 90 birthday paradox, 127 bit vector, 223 bitonic tour, 326 black-height, 267 Booles inequality, 111 boolean function, 104 bound/asymptotically tight, 31 boundary, 321 bucket, 178 bucket sort, 138, 178 Build-Heap, 151 Build-HeapBuild-Heap[], 151
calling the subroutine, 16
canonical form, 352 cardinality, 78 Cartesian product, 79 Catalan number, 263 Catalan numbers, 306 ceiling, 35 certain event, 106 chaining, 224 child, 94 chord, 322 circular list, 205 closed interval, 292 code/Huffmen, 341 codeword, 338 codomain of a function, 83 coefficient, 35 coin, 108
coin changing, 354 collision, 224 coloring, 97
common subsequence, 316 common subsequence/longest, 316
commutative laws, 76 comparison sort, 170 compatible activities, 331 complement, 77 complete fc-ary tree, 96 complete graph, 90 computational problem, 11, 12 conditional probability, 109 conditionallyindependent
events, 111 connected component, 88 connected graph, 88 continuous uniform probability
distribution, 108 contraction, 349 convex polygon, 321 correctness of an algorithm, 12 cost, 340
countably infinite set, 78 counting, 100 counting sort, 138, 173 counting/probabilistic, 133 cycle, 87
cycle/simple, 88
dag, 90 data, 137
de Morgans laws, 77 deadline, 351 decision trees, 170 degree, 35, 94 depth, 94 deque, 204 descendant, 93 descendant/proper, 93 deviation, 116 dictionary, 197 difference, 76 digraph, 86
direact addressing, 221
direct addressing, 221
directed graph, 86
directed version (of an undirected graph), 89
discrete probability distribution, 107
discrete random variable, 112
disjoint sets, 77
distribution/binomial, 118
distribution/geometric, 117
distributive laws, 77
divide-and-conquer approach, 19
division method, 230 domain of a function, 83 double hashing, 238 doubly linked list, 205 dynamic order statistics, 284 dynamic programming, 303 dynamic set, 197
early task, 351 edge, 86
edit distance, 328 element, 75 elementary event, 106 empty binary tree, 95 empty set, 75, 76 empty stack, 202
endpoint, 292 entropy/Shannon, 104 equal functions, 83 equal sets, 75 equivalence class, 81 equivalence relation, 81 euclidian travelling-salesman
problem, 326 Eulers constant, 242 event, 106
event-driven simulation, 149 events/conditionally independent, 111 events/independent, 109 events/mutually independent, 109
events/pairwise independent, 109
exchange property, 346 executing the subroutine, 16 expectation, 113 expected value, 113 expexted running time, 18 exponential, 36 exponential series, 44 extension, 347 exterior, 321 external node, 94 external path length, 97
factorial, 38 failure, 117 fair coin, 108 father, 94
Fibonacci numbers, 39, 71 field of an object, 14 FIFO, 201 finite sequence, 83 finite set, 78 fixed-length code, 338 flipping a fair coin, 108 floor, 35 forest, 90, 91 formal power series, 71 fractional knapsack problem, 336