Главная    Ex Libris    Книги    Журналы    Статьи    Серии    Каталог    Wanted    Загрузка    ХудЛит    Справка    Поиск по индексам    Поиск    Форум   
blank
Авторизация

       
blank
Поиск по указателям

blank
blank
blank
Красота
blank
Shen A. — Algorithms and Programming
Shen A. — Algorithms and Programming

Читать книгу
бесплатно

Скачать книгу с нашего сайта нельзя

Обсудите книгу на научном форуме



Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter


Название: Algorithms and Programming

Автор: Shen A.

Аннотация:

The purpose of this textbook, primarily aimed at first-year undergraduates in Programming, is, firstly, to teach students how to write a correct program, together with the proof of its correctness; and secondly, to show several basic methods of constructing effective algorithms. A well-structured problem/solution format is used, and the theory is presented as a sequence of problems. Solutions are concise, but ample explanations are given. All significant aspects of programming are covered.


Язык: en

Рубрика: Computer science/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Год издания: 2008

Количество страниц: 230

Добавлена в каталог: 12.02.2014

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
Adelson-Velsky, G.M.      165
Aho, A.V.      59 150 211 212
Alphabet      134 176
Angle detector      40
Array      15
Array with minimal element      96
Automaton, finite      73 133 143
Automaton, finite nondeterministic      148
AVL-tree      165
Axiom (of a grammar)      176
B-tree      174
Backtracking      49
Backtracking, recursive      107
Baur, W.      19
Binary search      25
Binomial coefficient      47 114
Bipartite graph      130
Boyer — Moore algorithm      140
Brudno, A.L.      17
Calculator, stack      122
Catalan numbers      44 48 116
Chords of a circle      46
Code, Gray      38
Coherent      201
Comments, nested      74
Comments, removal      73
Common element (in sorted arrays)      23
Complement of a regular set      150
Compound symbols, replacement      73
Conflict, reduce/reduce      204 208 210
Conflict, shift/reduce      204 208 210
Connected component, directed graph      95 111 127
Connected component, undirected graph      110
Connected graph      88
Context-free grammar      176
Context-free language      176
Context-free language, polynomial decidability      179
Convex hull      68 92
Cormen, T.      212
Cost matrix      126
Cycle, Euler (along all the edges)      88
Decimal fraction, period      12
Decimal number, printing      9 12 120
Decimal number, printing, recursive      100
Decimal number, reading      74
Deo, N.      175 212
Deque, array implementation      87
Deque, pointer implementation      91
Derivation in a grammar      176
Derivation, leftmost      191
Derivation, rightmost      198
Descendant of a vertex      101
Determinization      149
Dijkstra algorithm (shortest path)      125 127
Dijkstra, E.W.      5 14 28 212
Dimentman, A.M.      31
Diophantine equation      5 7
Directed graph      88
Division      3
Division, fast      14
Dutch flag      28
Dynamic programming      114 115 179
Dynamic programming, shortest path      124
Edge of a graph      110
Error, index out of bounds      21 26 27 61 63
Euclid's Algorithm      4 5
Euclid's algorithm, binary      6
Even permutation      27
Exchange      18
Expression      178
Expression, regular      146
Extension, inductive      29
Factor      178
Factorial      3
Factorial, recursive program      98
Factorization      8
Fast computation      3
Fast multiplication      20
Fibonacci numbers      3 116 165
FIFO      85
Finite automaton      73 133 143
Finite automaton, nondeterministic      148
First(X)      182 193
Floyd algorithm      125 150
Floyd, R.W.      13
Foll(X)      182
Follow(X)      193
Ford — Bellman algorithm      124
Function, inductive      29
Garey, M.R.      59 212
Gaussian integers      9
GCD      4
Generated string      176
Generation      34 42 104
Grammar for expressions      178
Grammar, context-free      176
Grammar, LALR(1)      211
Grammar, left-recursive      194
Grammar, LL(1)      193
Grammar, LR(0)      204
Grammar, LR(1)      210
Grammar, SLR(1)      208
Graph, bipartite      130
Graph, connected      88
Graph, connected component      95 110 127
Graph, directed      88
Graph, edge      110
Graph, shortest paths      124
Graph, undirected      110
Graph, vertex      88 110
Gray code      38
Greatest common divisor      4
Gries, D.      18 23 26 31 212
Hanoi, Towers of nonrecursive solution      118
Hanoi, Towers of recursive solution      100
Hash function      151
Hash function, universal family      156 157
Hashing      151
Hashing with open addressing      151
Hashing, running time, upper bound      155
Hashing, universal      155
Hashing, using lists      154
Height      158
Hoare sorting      67 111
Hoare sorting, nonrecursive      121
Hoare, C.A.R.      111 121
Hopcroft, J.      59 212
Horner's rule      18
Inductive extension      29
Inductive function      29
Integer points in a circle      10
Intersection of regular sets      150
Intersection of sorted arrays      23
Inverse permutation      27
Johnson, D.S.      59 212
Knapsack problem      59 118
Knuth — Morris — Pratt algorithm      136
Knuth, D.E.      136
Kushnirenko, A.G.      18 19 29 86 87 212
LALR(1)-grammar      211
Landis, E.M.      165
Language, context-free      176
Language, not context-free      178
LCM      5
Lead$(K\to V)$      193
Least common multiple      5
Lebedev, G.V.      212
Left context of the rule      199
Left(K)      199
Left(K, t)      208
LeftCont$(K \to U, t)$      208
LeftCont$(K\to U)$      199
Leiserson, C.      212
letter      176
LIFO      85
Lipski, W.      212
Lissowski, Andrzei      119
LL(1)-grammar      193
LL(1)-parsing      191
LR(0)-grammar      204
LR(1)-grammar      210
LR-process      198
Matijasevich, Yu.V.      13 136
Matrix multiplication, optimal order      117
Matrix product      126
Median, search      71 112
Memoization      118
Merge of sorted arrays      22
Minimal element, search      70
Monotone sequences, generation      36 105
Morris, J.H.      136
Multiplication of polynomials      19
Multiplication, fast      20
Nearest sum      23
Nievergelt      1 175 212
Nonassociative operation      118
Nondeterministic finite automaton      148
Nonterminal      176
NP-completeness      59
Number of common elements      20
Number of different elements      16 17 68
Number of partitions      47
Open addressing      151
Operation, non-associative      118
Ordered tree      159
Parentheses      46
Parentheses, correct expressions      80 176
Parsing, general context-free language      179
Parsing, LL(1)      191
Parsing, LR(1)      198
Parsing, recursive-descent      181
Partitions, generation      37 106
Partitions, number of      47
Pascal      21
Pascal triangle      47 115
Pascal, B.      115
Paths, number of      127
Pattern matching      133 142 143
Period of a decimal fraction      12
Permutation, even      27
Permutation, inverse      27 43
Polygon, triangulation      46
Polynomial, derivative      19
Polynomial, multiplication      19 20
Polynomial, value      18
Positions tree      49
Postfix notation      122
Power, computation      1
Power, quick computation      2
Power, recursive computation      99
Pratt V.R.      136
Prefix      134
prime factors      8
Priority queue      97
Problem, knapsack      59 118
Problem, NP-complete      59
Product, non-associative      46
Production rule      176
Programming, dynamic      114 115 179
Queens problem      49
QUEUE      85
Queue, array implementation      85
Queue, made of two stacks      86
Queue, pointer implementation      90
Queue, priority      97
Quicksort algorithm      67 111
Quicksort algorithm, nonrecursive      121
Rabin — Karp algorithm      142
Recursion      98
Recursion, elimination      114
Recursive procedure      98
Recursive-descent parsing      181
Reduce      198
Regular expression      146
Regular set      147
Regular set, complement      150
Regular set, intersection      150
Reingold, E.M.      175 212
Remainder      3
Reverse Polish notation      122
Rivest, R.      212
Rotation, left, right      166
Rotation, small, big      166
Search of a shortest path      124
Search of a substring      133 136 139 140 142
Search of the k-th element      112
Search of the minimal element      70
Search, binary      25
Search, breadth-first      96 128
Search, depth-first      129
Search, k-th element      71 164
Search, majority representative      71
Search, one of substrings      145
Sequences, generation      33
Set, bit array implementation      93
Set, data types      93
Set, list implementation      94
Set, regular      147
Set, representation      151 154
Set, tree representation      158
Sethi, R.      150 211 212
Shift      198
Simulation, event queue      97
Sipser, M.      212
Situation for a grammar      200
SLR(1)-grammar      208
Sorting, Heapsort      63 97
Sorting, Hoare (quicksort)      67 111
Sorting, lower complexity bound      69
Sorting, Merge      61 67
Sorting, n log n      61
Sorting, number of comparisons      69
Sorting, quadratic      60
Sorting, quicksort, nonrecursive      121
Sorting, radix      70
Sorting, topological      107 130
spelling checker      157
STACK      79
Stack calculator      122
Stack of postponed tasks      119
Stack, array implementation      79
Stack, pointer implementation      83
Stack, two in an array      82
State(s)      201
Strassen, V.      19
String      134
String, coherent with a situation      201
String, generated by a grammar      176
String, having all possible substrings of length n      90
Subsequence, common      31
Subsequence, increasing      31
Subsequence, test      30
Subsets of given cardinality, generation      35
Subsets, generation      34
Substring      134
Substring, search      136 139 140 142
Subtree      158
Suffix      134
Summand      178
Symbol, initial      176
1 2
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2017
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте