Previous Section
 < Free Open Study > 
Next Section


Index

G

Garbage, 220
Garbage collection, 220
General-Case Question, 407
and iteration, 433
and RevPrint function, 416
and ValueInList function, 411
General (or recursive) cases, 404, 407
and recursive solution, 446
and writing recursive functions, 408
Generic data types, 126–127, 210
Generic time-driven queuing system simulator, 247
getData function, 99, 131
getFreeServerID operation, 252
get function, 26
GetNextItem function, 126, 134, 142, 143, 145, 493
testing, 146
and Unsorted List ADT, 307, 315
GetNextItem operation, 131, 461
GetNode function, 362, 365
GetParameters function, 255
GetPredecessor operation, 481
GetToVertices function, 568
Global identifier, 87
Global namespace, 99
Global scope, 87
Global variable
lifetime of, 224
Graph ADT, 555
specification for, 551–552
Graphs, 117, 546–571, 579
adjacency list representation of, 569570
application level, 552–563
edges added to, 567
examples of, 548
of flight connections between cities, 564
implementation level, 563–571
logical level, 546–552
marking vertices on, 555
and sets, 571
undirected, 547
Graph theory, 547
GraphType class, 551
definition of, 565
GREATER, 127, 188, 321
Growth rates
comparison of, 161


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