√лавна€    Ex Libris     ниги    ∆урналы    —татьи    —ерии     аталог    Wanted    «агрузка    ’удЋит    —правка    ѕоиск по индексам    ѕоиск    ‘орум   
blank
јвторизаци€

       
blank
ѕоиск по указател€м

blank
blank
blank
 расота
blank
Bentley J. Ч More programming pearls
Bentley J. Ч More programming pearls



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



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


Ќазвание: More programming pearls

јвтор: Bentley J.

јннотаци€:

What do topics ranging from organic chemistry to Napoleon's campaigns have to do with computer programming? This collection of essays demonstrates the many varied aspects of programming, showing how programming can be both a fun and elegant science.
Some of the essays cover programming techniques, like how profilers can provide insight into the dynamic behavior of programs, and methods for making data files self-describing. These techniques deal with real programs and they are realistically illustrated, using the C and Awk languages. Bentley also provides the reader with some tricks of the programmer's trade, like a collection of rules of thumb and hints for finding simple solutions to hard problems.
These essays also originally appeared in the author's column in Communication of the ACM, and have been substantially revised, incorporating new sections, problems, and reader comments.


язык: en

–убрика: Computer science/јлгоритмы/

—татус предметного указател€: √отов указатель с номерами страниц

ed2k: ed2k stats

√од издани€: 1988

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

ƒобавлена в каталог: 10.11.2005

ќперации: ѕоложить на полку | —копировать ссылку дл€ форума | —копировать ID
blank
ѕредметный указатель
Adams, J. L.      53
Aho, A. V.      vi 25 27 37 99 101 172
Alexander      47
Algol      15
Algorithm design      3Ч7 21 141Ч143 160Ч163
Algorithms      (see Searching Sorting)
Algorithms, analysis of      22 140 150Ч157 163Ч170 183 197 200Ч202
Algorithms, graph      20Ч24 184Ч186
Algorithms, selection      30Ч33 111 159Ч170 201
Analysis of Algorithms      22 140 150Ч157 163Ч170 183 197 200Ч202
Analysis, lexical      18 93Ч94
Analysis, numerical      147
Analysis, syntax      94Ч95
Anaya, T.      133
Appel, A. W.      155 199
Ardis, M.      63
arrays, associative      15Ч25 33 35 141 184Ч186
Assembly language      11 52 62 98 131 191
associative arrays      15Ч25 33 35 141 184Ч186
Audit trails      41
awk      7 11 15Ч25 28Ч36 91Ч92 97 100 115Ч118 141Ч142 172-173 185Ч187 190Ч191 199
Back of the envelope      52 57 69Ч76 78Ч79 189
Bar chart graphs      132Ч133 136 196
BASIC      97 127 130 190 192 195
Bears      53
Bell, C. G.      62
Bentley, J. C.      48
Bentley, J. L.      27 52 54 116 140 189
Bentley, J. W.      49
Bernstein, L.      57 60 64Ч65
bibliographies      37 38 98
Binary search      28Ч30 52 69 105 148Ч149 175 201
binary search trees      24 185 197
Bingaman, J.      133
Blood donors      45
Blue, J. L.      155 199
Blum, M.      201
Box-and-whiskers graphs      166
BPL      128Ч131 135
Brooks, F. P., Jr.      33 63Ч64 80 112
Buchanan, J.      118
bug reports      35
Bugs      6 8Ч10 28Ч36 67 131 139 187 192
Bugs, performance      8 32 140 168 200
Burstall, R. M.      198
C      3Ч7 10 71Ч72 153 171 183-184
Cadwallader Ч Cohen, J. B.      77
Campaign, NapoleonТs Russian      124Ч126
Cargill, T. A.      63
Carlson, R.      58
Chambers, J. M.      123 169 202
Changes, font      108
Changes, size      108
Chem      91Ч92
Chemical structure diagrams      91Ч92
Cleveland, G.      118
Cleveland, W. S. vi      60 119 123Ч124
COBOL      83
Code tuning      3Ч7 51 61 66Ч67 152Ч154 199 201
Comments      36 40Ч41 44 61 85 111 129
Compilers      35 49 61 67 71 84Ч87 91 93 98Ч99
Condon, J. H.      66
Confessions      27 31
Consistency      105
Conway, J. H.      25
Conyngham, J.      58
Corasick, M. J.      37
Correctness proofs      13 27 29Ч30 34Ч36 111 140Ч141 143Ч144 161-162 184
Crocker, S.      156
Darlington, J.      198
Data transmission      47Ч48 52
Data, self-describing      37Ч44 123
databases      38Ч40 69
Debugging      6 9 27Ч36 54Ч55 60-61 131 192
Denning, P. J. vi      50 73 75 190
Design      97 121 145
Design, algorithm      3Ч7 21 141Ч143 160Ч163
Design, document      49 101Ч114
Dewdney, A. K.      52
Diagrams, chemical structure      91Ч92
Dijkstra, E. W.      60
Direction-field graphs      106Ч107
Distance routines      53 147Ч157
Document design      49 101Ч114
Documentation      40 43 49 62 89 101
Domenici, P. V.      133
Donner, M.      60
Donors, blood      45
Dotchart graphs      119Ч120
Dragon Book      99
Duff, T.      41 57 61 64
Dull, B. C.      12
Edison, T. A.      52
elevators      49
Engineering techniques      (see Back of the envelope Comments debugging Design Documentation Graphs Money Prototypes Scaffolding Testing Tradeoffs)
experiments      42Ч44 71Ч72 164-167
expressions, regular      94 191
Fairley, R. E.      63
Farrar, P.      65
Feldman, S. I.      35 95Ч96
Figures, typesetting      105Ч107
Fingers, ring      45
Finite state machines      18Ч20 24
Flon, L.      18
Floyd, R. W. vi      137 139Ч145 170 197Ч201
Font changes      108
Forth      191
FORTRAN      12 67 83 188
FSMs      (see Finite State Machines)
Furbelow, G.      77Ч79
Garey, M. R. vi      59
Gerhart, S. L.      65
Glenn, J.      132
Gordius      47
Grap      116 164
Graph algorithms      20Ч24 184Ч186
Graphs, bar chart      132Ч133 136 196
Graphs, box-and-whiskers      166
Graphs, direction-field      106Ч107
Graphs, dotchart      119Ч120
Graphs, histogram      134
Graphs, pie chart      120
Graphs, scatterplot      90Ч91 116Ч118 194
Graphs, stem-and-leaf      118
Graphs, time-series      119
Graphs, ugly      122 136
Gries, D.      184
Grosse, E. H.      vi
Halpern, P.      58
Harrison, W. H.      118
Hart, G.      132
Hash search      197
Hawks      48
heaps      111Ч113 175 193
Heapsort      42 111Ч113 175 193
Hilfinger, P. N.      18
Hill, R.      64
Histogram graphs      134
Hoare, C. A. R.      160 170
Hofstadter, D.      69 75Ч76
Holzmann, G.      vi
Hopper, G. M.      62
Hot spots      5 7Ч8 13 51 53 61 67 147
Huber, A.      58
Huff, D.      124
Insertion sort      42 193
interactive programs      84 87 89Ч90 129Ч130
Invariants      143 161 167
Iteration      104
Jackson, M. A.      61
JCL      83
Jelinski, L. W.      vi 52 92 189
Johnson, D. S.      vi
Johnson, S. C.      94
Jones, D.      59
Jones, D. W.      61 64
Kahan, W.      200
Kennedy, J. F.      118
Kernighan, B. W.      vi 7 25 34Ч35 39 60 66 75 84Ч85 92Ч93 96 99 104 116 171Ч172 188 190 192Ч193
Kernighan, M. D.      192
Kleiner, B.      123
Knuth, D. E.      8 13 21 34 38 61 123 139 166 170 183Ч184 193 202
Lamport, L.      109 114
Lampson, B. W.      67
Languages, little      (see BPL Chem Grap Lex Make Pic Scatter Shell Tbl Yacc)
Languages, programming      (see Algol assembly language Awk Basic C Cobol Forth Fortran Lisp Pascal Snobol)
LATEX      109
Layout, page      108
Leas, D.      11
Least-squares regressions      117 194
Lemons, E. W.      59
Lesk, M. E.      93
Lex      93Ч98
Lexical analysis      18 93Ч94
Libraries, subroutine      33 41 84 88Ч90 154 167 175Ч182 198
Lisp      11 62
Little languages      (see BPL Chem Grap Lex Make Pic Scatter Shell Tbl Yacc)
Little, J. C. R.      73
LittleТs law      73Ч75 190Ч191
Machines, Finite State      18Ч20 24
Mairson, H. G.      184
make      95Ч96 98
Mallory, G. L.      114
Management, software      63Ч65 69 77Ч80
Martin, D.      58 62Ч63
Martin, R. L.      52 62
McKeeman, W. M.      62 65
Mcllroy, M. D. vi      156 197
Medians      160
Medians, weighted      169Ч170
Minard, C. J.      124 126
Minimalism      105 122
Misra, J.      184
Moler, C. B.      156
Mondale, W. F.      132
money      47Ч48 51 71 73 78Ч79 92 114 134
Monitors      (see Profilers)
Morrison, D.      156
Morrison, P.      70
Morton, M.      61
name-value pairs      37Ч44 95 188
Napoleon      124 126
NapoleonТs Russian campaign      124Ч126
Nelson, N. Ч P.      62
Newton iteration      148Ч157 198 200
Newton, I.      149 198
Nightspots, popular      73
Numerical analysis      147
Page format      108
page layout      108
Pairs, name-value      37Ч44 95 188
Parker, T.      67
parsers      94
Partial sorting      169
Partitioning routines      111 161Ч163 168
Pascal      13 72
Penicillin      91
Penzias, A. A.      vi
Percentiles      160
Performance bugs      8 32 140 168 200
Perlis, A. J.      62
Permutations, random      34 53 142Ч145 197
PIC      84Ч100
Pie chart graphs      120
Pigeons      48
Pike, R.      12 52 99 188
pipelines      9Ч10 40 90 111 115Ч118
PL      1 188
Plauger, P. J.      39 66 104
Popular nightspots      73
PostScript      191
Pratt, V. R.      201
Prime numbers      3Ч7 12 183
Priority queues      175
Pritchard, P.      184
Profilers      3Ч13 61 67 147 183Ч184
Program verification      (see Correctness)
Programming languages      (see Algol assembly Awk Basic C Cobol Forth Fortran Lisp Pascal Snobol)
Programs, interactive      84 87 89Ч90 129Ч130
Programs, spelling      18
Proofs, correctness      13 27 29Ч30 34Ч36 111 140Ч141 143Ч144 161-162 184
prototypes      11 23 30 35 51 64Ч65 89 92 141
Provenances      40Ч44
Pseudocolumns      129Ч130 135
Pythagorean Theorem      110
Quantiles      160
Queues      21Ч23 73 190Ч191
Queues, priority      175
Quick tests      4 32 75
Quicksort      42 160 175
Random numbers      139
Random permutations      34 53 142Ч145 197
Random samples      47Ч48 139Ч145 197Ч198
Reagan, R. W.      60 118 132Ч133
Recursion removal      31 141 145 163
recursion, tail      31 163
Regressions, least-squares      117 194
Regular expressions      94 191
Rice, J.      157
Rice, S.      110
Ring fingers      45
Ritchie, D. M.      59 119 171 193
Rivest, R. L.      170 200Ч201
Roosevelt, T.      118
Roueche, B.      55
Routines, distance      53 147Ч157
Routines, partitioning      111 161Ч163 168
run time      3Ч13 17Ч18 23Ч24 33Ч34 69 71Ч72 115 167
Russian campaign, NapoleonТs      124Ч126
Samples, random      47Ч48 139Ч145 197Ч198
Scaffolding      27Ч36 155 186Ч187 199
Scatter      90
Scatterplot graphs      90Ч91 116Ч118 194
Schapira, A.      65
Schryer, N. L.      51 59
Scribe      67 101
Search trees, binary      24 185 197
Search, binary      28Ч30 52 69 105 148Ч149 175 201
Search, hash      197
Search, sequential      175
Selection Algorithms      30 33 111 159Ч170 201
Selection sort      113
Self-describing data      37Ч44 123
Sequential search      175
Sethi, R.      vi 99 101
Shaw, M.      18 63 65
Shell      90
Simulations      37 41Ч43 134 139 157 166 168
Sites, R. L.      8 10 64
size changes      108
Snobol      16 91 97
Software engineering      (see Engineering Techniques)
Software management      63Ч65 69 77Ч80
Sort, heap      (see Heapsort)
Sort, insertion      42 193
Sort, quick      (see Quicksort)
Sort, selection      113
Sorting      9 17 42Ч44 47Ч49 98 111 113 160 175 191 193
Sorting, partial      169
Sorting, topological      20Ч23
1 2
blank
–еклама
blank
blank
HR
@Mail.ru
       © Ёлектронна€ библиотека попечительского совета мехмата ћ√”, 2004-2020
Ёлектронна€ библиотека мехмата ћ√” | Valid HTML 4.01! | Valid CSS! ќ проекте