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

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

blank
blank
blank
Красота
blank
Hubbard J.R. — Theory and Problems of Fundamentals of Computing with C++
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!


Язык: en

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

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

ed2k: ed2k stats

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

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

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

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
abacus      1
Absolute file name      10
Absolute frequency      93
Abstract data type      153 154
Abstraction      137
Access function      157
Activation frame      256
Ada Augusta Byron      10
Adaptor      248
Add      9
Adjacent_find() function      239 241
Aiken, Howard H.      2 12 13 15
Algorithm      1 10 16 239
Algorithm, inorder traversal      293
Algorithm, level order traversal      293
Algorithm, postorder traversal      293
Algorithm, preorder traversal      293
Almost complete binary tree      278
ALU      8 15
ampersand      182
Analytical engine      2 10
Ancestor      276 293
Ancestors() function      297
Anonymous enumeration type      94
Arabic numerals      5
Argument      73
argument passing      74
Arithmetic and logic unit      8
Arithmetic operator      27
ARPANET      3
Array      31 239
ASCII      8 12
Assembly language      9
Assert()      72 149 155
Assign() function      228
assignment operator      151 152 228 297
assignment operators      28
Assignment oprator      25
assignment statement      25
associative array      228
Asterisk      182
Asymptotic analysis      54
At() function      228 240
AUX      8
AVL tree      323 333 335
Babbage, Charles      10 12 15 17
Babylonian Algorithm      1 14
Back() function      228
Backus - Naur Form      264
Backus, John      10 12 15
BASIC programming language      10
Basis      254
Begin() function      228
Berners - Lee, Tim      3
Big O classification      54
Binary logarithm      54
Binary numeral      14 266
Binary operator      28
Binary search      259 266 267 320 334
Binary search tree      322 333 334
Binary tree      277 283
Binary tree iterator      291
Binary_search() function      239
Binomial coefficient      267
Bitwise copy      1 87
BNF grammar      264 266
Body of a function      24
bool type      29 30
Boolalpha flag      30
Boolean      29
booting the system      8 16
Bubble sort      303 304 305 316 317
built-in types      31
BYTE      4
C programming language      10
C++ programming language      10 16
Calling tree      258
Cascade assignment      187
CD      10
CD - ROM      12 15
Ceil() function      33
Census      2
CERN      3
Char type      31
character code      8
Child      276
Chinese glyph characters      7
cin      11 26
class      141
class implementation      145 156
Class interface      145
class invariant      147
class template      227 239
Class, deque      228
Class, list      226 228
Class, map      228
Class, multimap      228
Class, multiset      228
Class, priority_queue      228
Class, queue      226 228
Class, set      228
Class, stack      226 228
Class, vector      228
Clear() function      297
clock speed      3
Clustering      332 333 335
Cmath file      33
COBOL programming language      10 12 15
Collision resolution      328 332
comma operator      209
compile-time      12
compile-time error      16
Compiler      11
Complete binary tree      278 286 288
complexity      305 306 307 308 310 31 1 316
Computer      1
Computer program      16
Const parameter      82
Const reference parameter      74
Const value parameter      74
Constant      29
constructor      149 157
container      226
Container class      226
copy constructor      151
copy() function      239 243
core memory      3
correctness      54
count() function      239 241
Counting      1
cout      11 24 26
CPU      3 8 15
Current directory      10
dangling pointer      190
Data abstraction      141 156
Data abstraction, data type      7
Data abstraction, date class      171
Days_in_month      172
Debugger      12 36
Decimal numeral      14
default argument      73
Default constructor      151
default value      73 150
Defoliate() function      297
DELETE      155
DEPT      276
Depth() function      295 297
Deque      176
deque class      228
derived types      31
Descendant      276 293
Descendants() function      297
destructor      151 157
Dice      158
Difference Engine      2 13 17
digit      1
dir      10
Direct access      230
Directory file      9
Divide and conquer      317 320 322
Dynamic      187
dynamic array      155
Eckert, J. Presper      2 12 1 5
Egyptians      1
Empty() function      229
End() function      228
end-of-file      94
ENIAC      2 13 15
Enter() function      163 176
enumeration constant      287
Enumeration type      31 94
EPROM      16
Equal() function      239 242
equality operator      229
Erase() function      229
Erase_left() function      297
Euclidean algorithm      80 267
Excess      127
Exp() function      33
Explicit argument      152
EXPONENT      7
Expression      28
Expression tree      281
extraction operator      27
Fetch-execute cycle      9
fibonacci      81 257 267
FILE      9
File System      9
Fill() function      239 244
Find() function      239 240
finger      1
Finite differences      13
Flag      101
Floating-point overflow      38
Floating-point representation      8
Floating-point underflow      35
floor() function      33
Forest      292 293
FORTRAN programming language      10 13 15
FRACTION      7
Fragmented memory      240
FreeBSD      8
Frequency tally      93
friend      143 164
Front() function      228
Full binary tree      277 293
Function      67
Function declaration      67 82 144
Function definition      67 82 144
function template      140 226
Function, adjacent_find()      239 241
Function, ancestors()      297
Function, assign()      228
Function, at()      228 240
Function, back()      228
Function, begin()      228
Function, binary_search()      239
Function, clear()      297
Function, copy()      239 243
Function, count()      239 241
Function, defoliate()      297
Function, depth()      295 297
Function, descendants()      297
Function, empty()      229
Function, end()      228
Function, enter()      163 176
Function, equal()      239 242
Function, erase()      229
Function, erase_left()      297
Function, fill()      239 244
Function, find()      239 240
Function, front()      228
Function, grandparent()      297
Function, grow_left()      296
Function, height()      295 296 297
Function, insert()      229
Function, insert_left()      296
Function, is_balanced()      298
Function, is_complete()      298
Function, is_empty()      157 295 296
Function, is_full()      157 298
Function, is_leaf()      295
Function, is_root()      294 295
Function, leave()      163 176
Function, leaves()      295 297
Function, left_child()      295 296
Function, max()      239
Function, max_element()      239
Function, min()      239
Function, min_element()      239
Function, next_permutation()      239
Function, nth_element()      239
Function, parent()      295 296
Function, pop_back()      229
Function, pop_front()      229
Function, preorder()      296
Function, prune()      296
Function, push_back()      229
Function, push_front()      229
Function, random_shuffle()      239
Function, reflect()      297
Function, remove()      239 245
Function, remove_copy()      245
Function, replace()      239 243
Function, reverse()      239 246
Function, rotate()      239 246
Function, search()      239 242
Function, sibling()      297
Function, size()      229 296
Function, sort()      239
Function, strcat()      111
Function, strchr()      111
Function, strcmp()      111
Function, strcpy()      1 1 1
Function, strlen()      111
Function, swap()      229 239
Function, swap_ranges()      239 244
Function, uncle()      297
Function, unique()      239 246
Fundamental operations      228
Fundamental types      30
GB      13 15
GCD      259
generic algorithm      239
Gigabyte      16
Golden Mea      267
GrandparentQ function      297
Greatest common divisor      258
Grow_left() function      296
Hardware      3
Hash table      324 333 335
Heap      311 312
Heap property      312
Heap sort      313 316
Heapify      313
Height      276 277 293
Height() function      295 296 297
Hexadecimal numeral      14 266
Hindu - Arabic numerals      5
histogram      238
1 2 3
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2024
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте