Previous Section
 < Free Open Study > 
Next Section


Index

T

Tables, 13
Tail recursion, 434, 613
Template classes, 211
Templates, 126
in C++, 210-222, 262
defined, 210
Terminals, 3
Terminating conditions
with searches, 152-153
Test architecture
model of, 46
Test cases, 59
specifying, 35
verification of, 49
Test-data generators, 3
Test driver, 40, 45
code for, 47-48
for fraction class, 52
and test case verification, 49
Test driver program
algorithm for, 47
Testing, 19, 20
C++ data structures, 45-49
ListType class, 517
path, 37
state of stream, 27
Testing and verification, 3
Testing phase
software changes in, 5
Test plans, 38-39
for ADT Sorted List, 156
Binary Search Tree ADT, 503
for Divide function, 39-42
for fraction class, 56
for ItemType, 143-145
for LargeInt operation, 391-392
for queue operations, 240-241
in real estate listings case study, 188
for specialized list ADT, 378
for Stack ADT, 208-210
for user-defined string I/O class, 111-116
Text control operations, 85
Text editors, 3
this pointer, 391
Three-Question Method, 407
and debugging recursive routines, 432
QuickSort verified with, 441
RevPrint verified with, 415-416
ValueInList verified with, 411
throw operation, 206
throw reserved word, 96
throw statement, 34, 96
Tilde (~)
and class destructor, 225
Time-driven simulation, 247
Time limits, 260
Timeliness
and quality software, 6
Timer object, 249
TimerType class, 251
Toolboxes, 3
Top-down approach
with testing, 45
Top-down design, 12, 14, 17
Top-down methodology, 4
Top elements of stack
popping, 290
Top function, 204
and dynamic storage allocation, 291-293
Top operation, 197, 198
Trailer nodes, 349, 392
Trailers
linked lists with, 348-349
Transformer operations, 125
Transformers, 71
Traversals, 505
in binary search tree, 461
of graphs, 552
inorder, 483, 484, 490
postorder, 485, 490, 553
preorder, 490
ResetTree, GetNextItem and, 493-496
shortest-path, 561
specialized list ADT, 374, 378
testing, 503
three, 493
visualizing, 492
Tree node
node terminology for, 464
Trees, 117, 159, 456-460, 579
complete, 508
copying, 485-490
degenerate, 505
as directed graphs, 549
full, 508
general, 547
inorder traversal of, 483, 484, 490
input order and shape of, 476
points about recursion with, 468
postorder traversal of, 485, 490, 553
preorder traversal of, 490
shape of and insertion order, 476-477
and unsorted array, 610
TreeType class, 463, 464
true value, 35
try block, 96, 206
try-catch statement, 34, 96, 97
try clause, 96
Two-dimensional arrays, 82-85
application level, 84
implementation level, 84-85
logical level, 82-83
as parameters, 83-84
Two-element subarrays, 608
Type conflicts, 49
typedef statement, 84, 285
TYPE MISMATCH error message, 23


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