Previous Section
 < Free Open Study > 
Next Section


Index

A

Abstract data types, 17, 24, 66, 85, 117, 261
and data structure, 68
and exceptions, 97
graphs as, 547
and lists, 124
operator categories for, 71-72
sets as, 571
Abstract data type sorted list, 146-156
application level for, 147
implementation level for, 147, 149-156
logical level for, 146
test plan for operations in, 156
Abstract data type unsorted list, 125-146
and abstract data type operations, 125-126
and generic data types, 126-128
logical level for, 125
Abstraction, 4, 9-10, 11, 13, 58, 66, 72-85, 133
Acceptance tests, 19, 59
Accessing function
and built-in composite data types, 75
and one-dimensional arrays, 81
Accessor function, 71, 72
Action responsibilities, 173
Activation record, 423, 424, 425, 426, 427, 428, 430, 433
Active data structure, 90
Actual parameter, 211, 368
Ada, 82
Addition, 65, 381, 383
Add operation, 227
Address of operator, 215
AddVertex operation, 566
Adjacency lists, 569
Adjacency matrices, 563, 569
Adjacent vertices, 549
ADT Sorted List
test plan for, 156
ADT Unsorted List
test plan for operations in, 145
Airline example
breadth-first strategy in, 556-559
depth-first strategy in, 553-556
Algorithms, 3, 4, 24
AddEdge, 567
analysis of, 158
BinarySearch, 416
binary search, 151-156
BubbleSort, 594
BuildHeap, 612
collision-handling, 625-633
comparison of, 157-164
Copy Constructor, 353-354
CountNodes version 1, 466
CountNodes version 2, 467
CountNodes version 3, 467
CountNodes version 4, 468
Delete, 628
DeleteItem, 314, 342
DeleteNode, 480
DepthFirstSearch, 553
Dequeue, 300, 544
Enqueue, 298, 544
Findltem, 336
FindNode, 497
folding, 636
InsertionSort, 599
InsertItem, 313, 320, 321, 339, 499, 599
MergeSort, 601
and palindromes, 230-232
for Pop, 280
Print function, 484
for Push, 280
RadixSort, 639
recursive, 400, 404, 407, 416, 446
ReheapDown, 539
ReheapUp, 541
responsibility, 170, 172-173, 189
RetrieveItem, 311, 318
RevPrint, 413
SelectionSort, 589
ShortestPath, 560
sorting, 438, 588
SortNodes, 613
splitting, 444
for test driver program, 47
traversals, 491
Algorithm Sum1, 162, 163
Algorithm Sum2, 162, 163
Ampersand (&), 79
and parameter passing, 74
and passing-by-reference, 338
Analysis of algorithms, 158
Ancestors, 91, 457
Angle brackets (<>)
system-supplied header files enclosed in, 88
Application level, 188
for binary search trees, 463
for graphs, 552-563
for heaps, 536, 542-545
for one-dimensional arrays, 80
for pointer types, 221-222
for priority queues, 531
for queues, 229-232
for records, 75
for sets, 574
for Sorted List ADT, 147
for stacks, 199-204
and two-dimensional arrays, 84
for unsorted list ADT, 131-132
for user-defined string I/O class, 103-105
Application (or user) level, 68, 69, 71
Application perspective, 124
Arcs, 547
Arguments to constructors
passing, 136
Arithmetic operations, 65
Array-based implementation
for graphs, 563-568
Array-based list implementation
notes on, 143
Array-based lists
and Findltem, 619
linear searching in, 620
in static and dynamic storage, 359
Array-based sorted lists
and implementing priority queues, 532
Array declaration statement, 80
Array descriptor, 80
Array implementations
Big-O comparison of sorted list operations for, 326
Big-O comparison of unsorted list operations for, 317
comparing, 241
Array indexes, 143, 622
Array-of-records implementation
for linked structures, 362-367
Array representation
heap values in, 538
Arrays, 72, 116
changing contents of, 612
deallocating, 225
dynamically allocated, 222-225
in dynamic storage, 224
effect of HeapSort on, 614
hash function used for locating element in, 624
with linked list of values and free space, 363
merging sorted, 603-606
and radix sorts, 638
SelectionSort and number of comparisons required for sorting, 593
sorting with pointers, 619
with three lists, 364
use of, 360-367
Array-size
in rehash function, 629
Arrow operator (->), 222
Assertions, 29
Assignment operation, 65
Assignment operation implementation
and shallow copying, 352, 353
Assignment operator (=), 24
overloading, 357-358, 392, 485
Assumptions
in detailed specification, 9
Asterisk (*)
and passing-by-reference, 338
as postfix/prefix symbol, 214, 216
Atomic data type, 571
AttachNewNode, 501
AttachNewNode(revised), 501
ATTEMPT TO DEREFERENCE NULL POINTER message, 291
Automated teller machine
software development for, 8
Auxiliary functions, 365, 366
Average, 126


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