in index building case study,
510
in real estate listings case study,
175
in simulation case study,
249
Scope resolution operator (::),
18,
87
and definition of member functions,
94
and implementation of derived class,
244
choosing good hash function,
633-637
and complexity of hashing,
637
SEI Software Engineering Process Group
Conference,
33
number of comparisons required to sort
arrays with,
593
Self-organizing (or self-adjusting) lists,
621
SEMICOLON EXPECTED error message,
23
Sequential array-based list representation,
132
Sequential implementations
Big-O comparison of sorted list operations
for,
326
Sequential lists
hashed list compared with,
625
in static and dynamic storage,
359
ServerList ADT specification,
252-253
with assignment operator,
357
output from one run of program simulation,
261
Single-source shortest-path problem,
559-563
Singly linked linear list structure,
334
Size of problem
and order of magnitude,
159
in writing recursive functions,
408
Skewed binary search tree,
546
Smaller-Caller Question,
407,
408
and RevPrint function,
415
and ValuelnList function,
411
Software errors
importance of early detection of,
23
specification (partial) for,
146-147
Sorted List ADT algorithms
comparison of Unsorted List ADT
algorithms,
164-167
Sorted List ADT as linked data
structure
comparing sorted list implementations,
324-326
and DeleteItem function,
324
Sorted list implementations
four insertion cases,
323
retrieving items that are not there,
319
other efficiency considerations,
615-617
testing sorting algorithms,
615
Space considerations/requirements
and sorting algorithms,
608,
617
inserting at front and rear,
377
operation to be tested and description of
action for,
379
Stack ADT as linked data structure
comparison of stack implementations,
295-296
airline routes stored in,
554
implementing as linked structure,
280-296
popping first element on,
293
shallow copy
versus deep copy of,
352
default constructor in,
225
dynamic storage allocation for,
280
Standard Template Library,
17,
124
Statically allocated arrays,
358
Static array implementation
Big-O comparison of queue operations for,
306
for program with three functions,
422
stdexcept
hierarchy of error classes in,
97
Storage
requirements for queue implementations,
305
Stream insertion operator,
484
differences between classes and,
90
in large ADT implementation case study,
381,
382-383
and sorting algorithms,
591
and sorting efficiency,
588
and sorting with pointers,
618
of component selector,
73
for copy constructor,
353
for declaring pointer pointing to integer
value,
214
and one-dimensional arrays,
78
for overloading a symbol,
168
for two-dimensional arrays,
82