Previous Section
 < Free Open Study > 
Next Section


Index

C

C++, 2
calculating array element address in, 82
character and string library functions in, 99
class in, 17
class constructor rules in, 136-137
class syntax in, 18-19
and exceptions, 34
lists in, 124
"one definition rule" in, 98
operator functions in, 168-169
parameter passing in, 74-75, 368
records in, 73
scope rules in, 87
shallow copying in, 352
strings recognized by, 49
templates in, 210-222, 262
this pointer in, 391
two-dimensional arrays stored in, 83
types in, 17
C++ class type
and higher-level abstraction, 85-90
C++ code
list notation compared with, 311
node design notation compared with, 289, 468
Cake baking
example of object classes in, 17
functional design for, 15, 16
Cardinality, 571, 577
Carnegie Mellon University
Software Engineering Institute at, 33
CarType
implementation-level view of, 76
CarType struct, 73
Case studies
building an index, 510-517
fraction class, 50-58
implementing larger integer ADT, 379-392
Quick Sort, 438-446
real estate listings, 173-188
simulation, 245-261
user-defined string I/O class, 100-116
Catch block, 96
catch clause
of try-catch statement, 96
catch keyword, 96
catch statement, 199
cctype, 99
Cells, 75, 76, 80
cerr, 207
Chaining
and buckets, 631-633
collisions handled by hashing with, 632
linear probing compared with, 633
Chains, 631, 634
Children, 91, 456
cin, 2, 25
Circular array-based queues, 626
Circular doubly linked lists, 374
Circular linked lists, 334-344, 335
deleting items from, 342, 343, 344
with external pointer pointing to rear element, 335
finding list item in, 335-339
inserting items into, 339, 341
Circular linked queues, 334
Circular lists, 327, 392
FindItem operation for, 337
inserting items into, 339-344
uses for, 344
Circularly linked queues, 303-304
Circular queues, 238
Class, Responsibility, and Collaboration cards. See CRC cards
Class constructors, 135
for GraphType, 565
for ListType, 367
rules for use of, 136-137
Class copy constructors, 334, 352-356
Class destructors, 225, 294, 358
Classes, 17, 72, 85, 116
deriving one from another, 93-95
differences between structs and, 90
implementation of, 87-89
as records, 73
reusability of, 17
scope of, 87
specification of, 86-87
Classes, Responsibilities, and Collaborations, 4
Class interface diagram
for CountedQueType class, 242, 243
Class name
on CRC card, 13
Class syntax, 18-19
Class template, 210
for FIFO Queue ADT, 300
Class type, 85
Clear-box strategy
for test plan for Stack ADT, 208
ClearMarks function, 555
Clear-(white-) box testing, 36, 144
Client of class, 97
CLIENT program
in real estate listings case study, 183-187
Closing special symbol, 200
Clustering, 629, 630
COBOL, 72, 401
Code
and checklist for deskchecking C++ program, 32
executing, 34
reusability of, 6
sorting and streamlining of, 616
for test driver, 47-48
Code coverage, 36-38, 39
Code-coverage test plan
for Divide function, 39-40, 42
Coding phase
software changes in, 5
Cohesion, 11
Collaborations
on CRC card, 13
Collection type, 116
Collect Queues, 640
Collisions, 625-633, 643
and buckets and chaining, 631-633
and clustering, 629
defined, 625
handling by hashing with buckets, 632
handling by hashing with chaining, 632
handling with linear probing, 626
hash function choices and minimizing of, 633-635
and linear probing, 625-629
and rehashing, 629-631
Columns
two-dimensional arrays stored in, 83
Combinations function, 436
calculating, 437
and recursion, 411-412
command function, 47
"Commenting out," 43
ComparedTo function, 127, 169, 369, 370
comparedTo operation, 167
Compilers, 3
Compile time, 212
Compile-time errors, 23-24, 49
Complete binary tree, 508
Complete directed graph, 550
Complete graphs, 549, 550
Completeness, 5
Complete undirected graph, 550
Complexity
of hashing, 637
management of, 10
reducing, 66, 117
Complexity bins, 168
Component (base) type, 571
Component selector
and one-dimensional arrays, 78, 79
and two-dimensional arrays, 83
Composite data types, 68, 72, 73, 82, 571
Composition (containment), 93
Concatenation, 100
Constant
in rehash function, 629
"Constant of proportionality" of algorithm, 616
Constant pointer expression, 221
const reserved word, 353
Constructor initializer, 244
Constructor operations, 125
for Unsorted List ADT, 135-136
Constructors, 71
Constructs
for program verification, 95-99
Container objects
in simulation case study, 252
Containers, 116, 124
Containment, 93
Copy
of parameter, 74
Copy constructor, 351, 352, 353-354, 358
Copy function
implementing, 355-356
Copying
trees, 485-490
Copy member function, 357
CopyStack operation, 350, 355
Copy structures, 350-358
class copy constructors, 352-355
copy function, 355-356
and overloading assignment operator, 357-358
shallow versus deep copies, 351-352
CopyTree function, 486, 487
Correctness, 5, 234
designing for, 28-34
Costs. See also Programming time
of fixing errors, 33
with program verification, 50
and software errors, 22, 23
CountedQueType class, 241-242
application of, 244-245
class interface diagram for, 242, 243
implementation of, 242, 244
CountedQueType object, 373
CountNodes function, 465, 466
CountNodes version 2, 467
CountNodes version 3, 467
CountNodes version 4, 468
cout, 2, 25
Crashes, 24, 27, 258
CRC cards, 13, 170, 189
blank, 14
for fraction class, 51
for GraphType, 551
in index building case study, 511
for ItemType, 127
for objects in simulation case study, 249-251
for SetType class, 572
for specialized list ADT, 373
for StrType class, 101
for UnsortedType, 128
c-str function, 49
C string, 49
cstring, 99
Cubic time, 161
Cunningham, W., 13
currentPos, 142
Current search area, 152
current variable, 590


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