
Index
& operator, 197–198
‘*’ operator, 198
A
accumulators, 83
activity ratio, 448–449
acyclic graph, 368
adjacency matrix, 368
adjacent node, 368
advanced data structures, 459–492
algorithm, 78–90
analysis of, 85–86
Big-Oh notation, 86–90
design of, 78
stepwise renement, 80–81
using control structures, 81–85
ways to develop, 78–80
archival le, 414
arithmetic operators, 13–14
unary arithmetic operators, 13–14
array of pointers, 208
arrays, 34, 93–149
applications of, 138–149
multi-dimensional arrays, 130–134
one-dimensional array, 94–130
pointers and, 203–207
representation in physical memory,
134–138
two-dimensional arrays, 136–137
assignment operator, 18–19
AVL trees, ...