Previous Section
 < Free Open Study > 
Next Section


Index

R

Radix, 638
radix key, 640
RadixSort
algorithm for, 639
Radix sort, 637-642
Random-number generator, 256, 257, 260
Random probing, 631
Readability, 6
Real estate listings case study, 173-188
Records, 72-77
application level, 75
implementation level, 75-77
logical level, 73-74
myCar, 73
Recursion, 439, 446, 517
with binary search trees, 504
classic example of, 401-404
depth of, 429
description of, 400-401
removing, 432-436
for simplifying solutions, 411-412
workings of, 420-429
Recursive algorithms, 401, 404, 407, 416, 446
Recursive binary search tree operations, 464-496
class constructor and destructor, 484-485
copying a tree, 485-490
DeleteItem function, 477-482
InsertItem function, 471-477
IsFull and IsEmpty functions, 465
LengthIs function, 465-469
Print function, 483-484
traversals, 490-496
Recursive calls, 400, 405, 407, 424, 446, 616
depth of, 438
overhead problems with, 436
to QuickSort, 440, 609
to ValueInList, 409, 410
Recursive definition, 401, 407
Recursive functions, 432, 446, 464
iterative functions contrasted with, 405, 406
MergeSort as, 602
tracing function of, 429-432
writing, 408-411
Recursive functions verification
with Three-Question Method, 407-408
Recursive linked list processing, 412-416
Recursive (or general) case, 404, 407
Recursive programming, 404-407
Recursive routines
debugging, 432
Recursive solutions
base case(s) for, 446
deciding on use of, 436-438
Reference
passing pointers by, 475
Reference parameters, 28, 74, 75, 79
Regression testing, 20
Rehash function, 629
Rehashing, 629-631, 633, 643
collisions handled with, 630
ReheapDown function, 611, 612, 613, 615
ReheapDown operation, 534, 535, 536, 538, 539, 544, 546
ReheapUp operation, 536, 537, 538, 541, 545
Relational operators, 40
and FindItem, 336
in large ADT implementation case study, 384-386
overloading, 127, 189
RelationType, 90, 188
Reliability
increasing, 58
Remainder (%) operator, 236, 626
Remove operation, 227
Requirements, 4
Requirements analysis, 58
Requirements definition, 2
Requirements elicitation, 2
Requirements verification, 50
Reserved words, 2
ResetList function, 126, 134, 142, 143
testing, 146
and Unsorted List ADT, 307, 315
ResetList operation, 131, 463
Reset operation, 461
ResetTree function, 493
ResetTree operation, 463
Resources
and class, 85
Responsibilities, 17, 170, 172, 189
Responsibilities of class
on CRC card, 13
Responsibility algorithms, 170, 172-173, 189
in real estate listings case study, 178-181
Retesting
and module modifications, 58
Retrieve function, 469
RetrieveItem, 125, 127, 130, 143, 335, 460, 628
algorithm for, 138, 139, 140
in comparison of Unsorted List ADT and Sorted List ADT, 165
testing, 145
RetrieveItem function, 469-471, 623, 629
and Sorted List ADT, 318-319
and Unsorted List ADT, 311-313
RetrieveItem operation, 137, 505, 577
improving, 150-151
Retrieve operation
tracing, 471
Retrieving items
in sorted lists, 151
in unsorted lists, 138
Return n, 207
Return statements, 136
Reusability, 6, 11, 17, 117
RevPrint function, 414
recursive, 414
recursive and nonrecursive versions for, 437-438
verifying with Three-Question Method, 415-416
writing nonrecursively, 434-436
Right child, 456, 464
Right subtree, 457, 459, 460, 465, 469, 492
Ring queue, 238
Robustness, 27-28
Root, 456
Root node, 459, 460
and heap building, 611, 612
maximum value of heap located in, 533, 609
of subtree, 457
"Round-trip gestalt design," 12
Rows
two-dimensional arrays stored in, 83
"Rule of the big 3," 358
Run time, 212
and dynamic storage allocation, 423
Run-time binding, 368
Run-time debuggers, 44
runtime-error class, 98
Run-time errors, 24-25, 291
Run-time stacks, 426, 427, 428, 433, 446


Previous Section
 < Free Open Study > 
Next Section
Converted from CHM to HTML with chm2web Pro 2.85 (unicode)