Previous Section
 < Free Open Study > 
Next Section


Index

B

bad-alloc exception, 294
Balanced binary search tree, 546
Balanced program, 202
Base address
of array, 79
of record, 76
for two-dimensional arrays, 83
Base case, 404, 407, 405, 414, 441, 446
Base-Case Question, 407
and RevPrint function, 415
and ValueInList function, 411
Base class, 91, 92, 94, 242
BASIC, 401
Beck, K. B., 13
Behavior responsibilities, 172
Big-O notation, 132, 159-160, 189, 438, 504
and comparison of rates of growth, 161
in comparison of Unsorted and Sorted List ADT algorithms, 164-167
and depth of recursion, 429
and implicit representation, 578
Insertion Sort in terms of, 600
Queue ADT implementations comparisons and, 304-306
radix sorts analyzed in terms of, 642
selection sort algorithm analyzed in terms of, 592
ShortBubble algorithm analyzed in terms of, 597
and sorted list implementations comparisons, 324-326
sorts compared in terms of, 643
Stack ADT implementations comparisons and, 295, 296
unsorted list operations comparison and, 316-317
Binary operators
overloading, 358
Binary search, 165, 189, 392
efficiency with, 622, 643
linear search compared with, 155, 166
of phone book, 151-152
rate of growth with linear search and, 622
recursive version of, 416-417
Binary search algorithm, 151-156
and Big-O notation, 165
iteration trace of, 155
trace of, 154
Binary Search Tree ADT, 463, 501
Binary search trees, 392, 456, 460, 517, 622, 643. See also Recursive binary search tree operations
application level, 463
Big-O comparison between linear lists and, 505-506
deletions from, 480
and implementing priority queues, 532
insertions into, 472
linear lists compared with, 504-506
location of maximum value in, 482
logical level, 460-462
priority queue implemented with, 546
searching, 496-499
specification for, 461-462
storage of in array with dummy values, 509
traversals in, 461
tree parameter as pointer within, 474
two, 466
Binary transformer, 71, 125
Binary trees, 456, 457, 460, 517, 546, 610
with array representation, 507
examples with, 509
nonlinked representation of, 506-509
with ten nodes, 458
traversing, 483
visualizing traversals, 492
Binding, 420
Binding time, 92, 420
Bit strings
exclusive-ORing of, 636
Bit vector representation, 574
Black-box testing, 36, 145
for ADT Unsorted List implementation, 144
and LargeInt operation, 391
Blueprints, 13
Booch, Grady, 17-18
Boolean flags, 44, 376, 616
Boolean function
writing, 408-410
Boolean operators
and explicit representation, 574
Bottom-up approach
with testing, 45
Bottom-up design, 12
Boundary condition, 36
Bounded time, 160
Braces ({})
in set notation, 547
Brackets ([])
and deallocating arrays, 225
Brainstorming, 170-171, 189
in index building case study, 510
in real estate listings case study, 173-174
in simulation case study, 249
Branches, 37
checking out, 38
Branching statements, 432
Branching structures, 406, 579. See also Graphs; Heaps; Trees
Breadth-first search, 556, 558, 559
BreadthFirstSearch function
code for, 558-559
Breadth-first strategy, 553
BubbleSort, 600, 616
ode for, 594-595
Bubble sort, 588, 593-597
analyzing, 595-597
snapshot of, 595
BubbleUp function, 595, 596, 597, 616
Buckets
and chaining, 631-633
collisions handled by hashing with, 632
Budget
and software, 6
Buffer, 229
Bugs, 95
origin of, 21
Built-in composite data types
implementing, 75
Built-in types
and abstraction, 72-85


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