Hubbard J.R. — Theory and Problems of Fundamentals of Computing with C++ :: Электронная библиотека попечительского совета мехмата МГУ

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

Авторизация

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

Hubbard J.R. — Theory and Problems of Fundamentals of Computing with C++

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

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

Название: Theory and Problems of Fundamentals of Computing with C++

Автор: Hubbard J.R.

Аннотация:

This powerful study tool is the best tutor you can have if you want top grades and thorough understanding of the fundamentals of computing with C++, the computing language taught at 83% of all colleges. This student-friendly study guide leads you step-by-step through the entire computer science course, giving you 420 problems with fully worked solutions and easy-to-follow examples for every new topic. You get complete explanations of data abstraction, recursion, Standard C++ container classes, searching, sorting algorithms, and other complex concepts, simplified and illustrated so they're easy to grasp. You also get additional practice problems to solve on your own, working at your own speed. This superb study guide covers the entire course, from logic to libraries. If you're taking introduction to computer science, this book will be your best friend. It's perfect for independent study, too!

Язык:

Рубрика: Computer science/Языки программирования/

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

ed2k: ed2k stats

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

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

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

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID

Предметный указатель

Hollerith, Herman      2 12 15
Homer’s method      5 14
Hopper, Grace      10
IAS      13 15
IBM      2 10
IDE      12 13 15
Identifier      26
implementation      137
Implicit argument      152 156
Induction      54
inequality operator      229
infinite loop      61
Infix representation      282
initialization list      149
initialized      6
initializer      29
Inorder traversal algorithm      280 289 293
Input device      15
input operator      27
input stream      26
Insensitive to input      318
Insert() function      229
insertion operator      24
Insertion sort      307
Insert_left() function      296
Instantiate      226
Institute for Advanced Study      2
int type      30
INTEGER      16
Integer overflow      35
Integrated Development Environment      12
Intel Corporation      3
INTERFACE      137
Internal node      276 293
Internet      3
iostream      24
iostream.h      11
Is_balanced() function      298
Is_complete() function      298
Is_empty() function      157 295 296
Is_full() function      157 298
Is_leaf() function      295
Is_root() function      294 295
iterative      255
Iterator      229 283 285
Jacquard, Joseph Marie      2 12 15
Java programming language      10 16
KB      13 15
Kemeny, John      10
Key      228 329
Keyword      26
Kilobyte      16
Kurtz, Thomas      10
Leaf      277 293 312
Leap_year      172
LeaveQ function      163 176
Leaves() function      295 297
Left child      278
Leftchild() function      295 296
Leibniz wheel      2
Leibniz, Gottfried Wilhelm      2 12 15
less than operator      229
Level      277
Level order traversal algorithm      279 289 293
lg      54
Linear algorithm      308 319
Linear open addressing      332
Linear probing      333 335
Linear time      3 7
Link-time error      12
Linux      8
LIST      236
List class      226 228
Literal      28
Load      9
Log() function      33
Logical error      12 16 35
Logl0 function      33
Long type      30
ls      10
lvalue      25 77
Machine language      11 16
Macintosh      8
MacOS      8
Main memory      4
Main() function      24
MAP      228
Map class      228
Mark I      2
Mask      235
Mathematical induction      54
Mauchly, John W.      2 12 15
MAX() function      239
Max_element() function      239
Maze      267
MB      4 13 15
Megabyte      4 16
Megaherz      3
member function      142
Memory      4
Merge sort      308 310 317
method      142
Method of finite differences      2 13
MHz      13 15
Microprocessor      3
MIN() function      239
Min_element() function      239
MODE      238
modulus operator      27
MS - DOS      8
MultiMap class      228
Multitiset class      228
Murphy’s Law      33
Mutator function      157
Mutual recursion      262 269
NAME      26
Nanosecond      3
Natural mapping      278 292
negation operator      294
Netscape      8
newline character      24
NeXTStep      8
Next_permutation() function      239
Nibble      22
Node      276
Nth_element() function      239
O(n lgn)      310 311 316 317
O(N)      308
O(n2)      305
Object      76 141
Object module      11
Octal numeral      266
Offset      98
Opcode      8
Operand      8 28
Operating System      8 16
Operator      145
Operator, assignment      228 297
Operator, equality      229
Operator, inequality      229
Operator, less than      229
Operator, negation      294
Operator, subscript      228
Order      276
OS      8 11 13 15
OS/2      8
Output device      15
output stream      26
Overflow      35 38 153
overloaded      145 152

Overloading      77
Parallel processing      4
Parallelizable algorithms      317
parameter list      67
Parent      276 278
Parent() function      295 296
Partition      310
Pascal programming language      10
Pascal, Blaise      2 10 12 15
Path      10 276
path name      16
PC      13 15
Permutation      267
Pivot element      310
Plain file      9
POINTER      31
Pop()      155
Pop_back() function      229
Pop_front() function      229
Post increment operator      28
Postcondition      140
postfix increment operator      28
Postfix representation      282
Postorder traversal algorithm      279 280 289 293
Pow() function      33
Pre - Standard C      24 52
Pre increment operator      28
Precompiler directive      25
Precondition      71 140
Predicate      72
prefix increment operator      28
Prefix representation      281
Preorder traversal algorithm      279 289 293
Preorder() function      296
Principle of Mathematical Induction      54
Priority queue class      22 8
Procedural abstraction      137 156
Programming language      10
Prototype      67
Proving correctness      54
Prune() function      296
Push()      155
Push_back() function      229
Push_front() function      229
Quadratic algorithm      308
QUEUE      156 163 232
Queue class      226 228
Quick sort      310 311
RAM      13 15
Random      157
Random_shuffle() function      239
Real number      16
Recurrence formula      254
Recurrence relation      255 313
Recursion      254
recursive binary search      321
recursive call      265
Reference      31
Reference parameter      74 82
reference type      182
Reflect() function      297
Relative frequency      93
Remove() function      239 245
Remove_copy() function      245
Replace() function      239 243
Return by reference      76 82
Return statement      69 82
Reverse Polish notation      282
Reverse() function      239 246
Right      278
Ritchie, Dennis      10
ROM      13 15
Root      16 276 293 312
Root Directory      10
Rotate() function      239 246
Roundoff errors      35
Run-time error      11 16 34
Schickard, Wilhelm      2 12 15
Search() function      239 242
secondary storage device      16
segmentation fault      184
Selection sort      306 3 17
Sentinel      53
Sequential search algorithm      3 19
Set class      228
Short type      7 30
Sibling() function      297
Sign bit      7
signed type      30
Silicon Valley      3
SIMM      4 13 15
sin() function      33
Size() function      229 296
Solaris      8
sort      303 313
Sort() function      239
source code      16
Sqrt() function      33
STACK      154 231
Stack class      226 228
Standard C++ library      24 32
Standard Library      287
std namespace      24
STORE      9
strcat()      111
strchr()      111
strcmp()      111
strcpy()      111
String      240
strlen()      111
Stroustrup, Bjarne      12 15 29
Structured programming      13 7
Subdirectory      10
subscript operator      228
Subtree      276
Swap() function      229 239
Swap_ranges() function      239 244
syntax errors      33
table      228
tally      93 15
template      226
template class      239
Template parameter      227
Terabyte      16
Test driver      70
this      152
Threaded tree      291
tilde      10
Token      25
Towers of Hanoi      263 268
TRAVERSE      279
TREE      276
Unary operator      28
Uncle() function      297
Underflow      38
Unicode      7 29
uninitialized      6
Unique() function      239 246
Univac      2 13 15
UNIX      8 16 94
User name      10
Vacuum tubes      3
Value parameter      74 82
Vector      234 239
vector class      228
VLSI      3
Void function      69 82
Void type      30
von Neumann, John      2 12 15
VRAM      16

1 2 3

О проекте