Previous Section
 < Free Open Study > 
Next Section


Index

L

LargeInt class, 380-381
instance of, 387
Large Integer ADT, 392
Large integers
representing with linked lists, 380
Larger integer ADT implementation case study, 379-392
Last In, First Out (LIFO), 197, 199, 261, 284, 426, 446
Leaf, 471
Leaf node, 456, 465
deleting, 477, 478
Left child, 456, 464
Left subtree, 457, 459, 460, 465, 469, 492
Length
of list, 124
length data member, 505
LengthIs function, 125, 143, 460, 465-469, 505
linked implementation and Big-O measure for, 316, 317
testing, 144, 146
LengthIs operation, 131, 373
and Unsorted List ADT, 307, 310
length member
of ListType, 626
and Unsorted List ADT, 307
Length of list
and Big-O notation, 160
Length property, 100
LESS, 127, 147, 151, 188
Level
of node, 458
Library data structure, 66-68, 69-71
Life-cycle verification activities, 59
Lifetime of variable, 224
Linear doubly linked list, 345
Linear linked lists, 334, 456
traversing, 483
traversing in reverse, 344-345
Linear lists
binary search trees compared with, 504-506
Linear probing, 625-629
chaining schemes compared with, 633
collisions handled with, 626
hash program with, 628
rehashing with, 629
Linear relationships, 124
in linked list data structures, 334
LinearSearch, 620
Linear search, 137, 165
binary search compared with, 155, 166
rate of growth with binary search and, 622
Linear searching, 620
advantages/disadvantages with, 621
Linear structures, 456
traversing, 493
Linear time, 161
Linked implementation
Big-O comparison of queue operations for, 306
Big-O comparison of sorted list operations for, 326
Big-O comparison of unsorted list operations for, 317
for graphs, 569-571
in terms of Big-O, 295, 296
Linked-list algorithm, 633
Linked-list representation, 133
Linked lists, 392
as array of records, 358-367
deleting from, 325
design notation, dynamic pointers, array-of-records "pointers" and, 367
and FindItem, 619
with headers and trailers, 348-349
implementing in array, 361-362
large integers represented with, 380
linear searching in, 620
recursive processing of, 412-416
in static and dynamic storage, 360
Linked queue representation, 297
Linked sorted lists
and implementing priority queues, 532
Linked structures, 222
stacks implemented as, 280-296
LISP, 124, 401
List ADT, 438, 461
List design terminology, 133
List item
finding, 335
List notation
C++ code compared with, 311
List of servers, 252
List operations
Big-O comparison of, 506
comparison of, 164-167
Lists, 117, 124, 159, 188, 327
deleting items from, 140
empty, 136
end cases in, 145
with headers and trailers, 334
inserting items into, 139
and linked structure, 365
traversing, 483
ListType class, 364, 367, 415, 513
ListType constructor, 577
Local identifier, 87
Local scope, 87
Local variable
lifetime of, 224
location
for array-based implementation, 133
and InsertItem operation, 147
Location of parameter, 74
location variable, 140, 143
Logarithmic time, 161
Logical errors, 28, 31
Logical level, 68, 188
for binary search trees, 460-462
for graphs, 546-552
for heaps, 533-536
for one-dimensional arrays, 77-79
for pointer types, 214-221
for priority queues, 530-531
for queues, 225-227
for records, 73-74
for sets, 571-573
for Sorted List ADT, 146
for sorting algorithms, 588
for stacks, 196
for two-dimensional arrays, 82-83
for user-defined string I/O class, 100
Logical perspective, 124
Logical view, 117
Logic errors, 24
Looping, 2
Looping construct, 406
Loops, 433
Loose coupling, 11
Low-level design, 2, 33


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