Previous Section
 < Free Open Study > 
Next Section


Index

I

Ideaware, 3-4
Ideaware tools, 9
abstraction, 9-10
information hiding, 10-11
stepwise refinement, 11-12
visual, 13-14
Identifiers
in namespace, 98-99
if-else, 2
if statement, 236, 406, 432
ifstream, 26
if-then statement, 37
ILLEGAL ASSIGNMENT error message, 23
Ill-formed expressions, 200
Implementation
and classes, 85, 87-89
of design, 3
Implementation level, 68, 69, 70, 188
for binary search trees, 463-464
for graphs, 563-571
for heaps, 536-542
for one-dimensional arrays, 80-82
for pointer types, 222
for priority queues, 532-533
for queues, 233-241
for records, 75-77
for sets, 574-579
for Sorted List ADT, 147-156
for sorting algorithms, 588
for stacks, 204-210
for two-dimensional arrays, 84-85
for unsorted list ADT, 132-135
for user-defined string I/O class, 105
Implementation perspective, 124
Implementing test plan, 38
Implicit link implementation, 537, 542
Implicit links, 610
Implicit positional links
binary trees represented in array with, 506-507
Implicit set representation, 576-579
Inchworm effect, 320, 321, 335
#include "DateType.h" directive, 88
#include directive, 87
Incremental coding and testing, 256
Index building case study, 510-517
Indexes, 392, 611, 637
and arrays, 77, 78
conversion of key values to, 623
and current search area, 152
and one-dimensional arrays, 81, 82
and rehashes, 630
of vertices, 567
IndexIs function, 567
Indirect addressing, 217
Indirect recursion, 400
Inductive proofs, 408
Info(last), 133, 137, 139, 288
Info(location), 133, 147, 288, 311
Info member
of nodes, 282
Information hiding, 4, 10-11, 13, 58, 72, 95, 245
Inheritance, 91, 92, 95, 368
and accessibility, 245
for deriving one class from another, 369-372
and extensible data abstractions, 244
hierarchy, 91, 92
InitializeSimulationVariables, 256
Initializing variable in declaration
and shallow copying, 352, 353
InitServer operation, 259
inline specifier, 591
Inorder traversal, 483, 484, 490, 493
algorithm for, 491
generating, 492
Input
in real estate listings case study, 175
Input files, 46
Inputs/outputs
in detailed specification, 9
Input streams, 25
InsertEnd, 377
InsertFront, 377
Insert function, 418, 429-432, 471, 475
Inserting items
into circular lists, 339-342
into sorted lists, 147, 148, 189
into unsorted lists, 189
InsertionItem operation, 620
Insertion operator (<<), 26
Insertion order
and tree shape, 476-477
Insertion points
FindNode used for finding, 500
InsertionSort
code for, 599, 600
Insertion sort algorithm
analyzing, 600
example of, 598
snapshot of, 598
InsertItem function, 125, 140, 143, 335, 339, 460, 463, 501-502, 517, 600
algorithm for, 149
code for, 322, 324, 599
in comparison of Unsorted List ADT and Sorted List ADT, 165, 166
discussion about, 471-477
implementation of, 340, 342, 463
and linear probing, 626
simple version of, 624
and Sorted List ADT, 320-324
testing, 144, 145
and Unsorted List ADT, 307, 313
InsertItem operation, 147, 499, 505, 625
recursive version of, 418-419, 473
Insert operation, 227, 532
Inspections, 31, 59
Instance variable, 91
Instantiation, 211
Integer multiplication, 65
Integers, 64-65
black box for representing, 66
Integration testing, 44-45, 59
Interfaces, 85, 117
Interior nodes
deleting, 314
Internal tree function, 496
Intersection, 571
Intersection of sets, 577
Intersection operation, 577
INT-MAX, 36
INT-MIN, 36
int type variable, 65
is-a relationship, 91
IsEmpty function, 227, 460, 465
IsEmpty operation, 197, 234, 253, 334, 505, 545
IsFull function, 125, 137, 143, 460, 465
and Queue ADT, 300
and Stack ADT, 293-294
IsFull operation, 197, 227, 234, 505, 545
testing, 145
and Unsorted List ADT, 309
IsMarked function, 555
ISO/ANSI C++ Standard dictionary, 294
ItemType class, 127, 131, 169, 204, 210, 640
classes derived from, 369, 371
CRC card for, 127
declaring, 368-369
definition of in test plan, 143
and hash function, 623
ItemType type, 588, 589
Iteration, 432, 433-434
Iteration trace
of binary search algorithm, 155
Iterative algorithms, 401
Iterative functions
recursive functions contrasted with, 405, 406
Iterative insertion and deletion, 496-504
Iterative solutions
and recursive functions, 437
Iterator operations, 126, 142-143
Iterators, 71, 72


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