Previous | Next | Table of Contents | Index | Program List | Copyright

Ada 95 Problem Solving and Program Design Index: G-L

G

Garbage collector, Section 14.1
GCD (greatest common denominator), Section 13.3
General_Access_Types, Section 15.3
Generic array parameters, Section 11.3
Generic component (package or subprogram), Chapter 11
Generic sorting program, Section 11.4
Generic subprogram parameters, Section 11.3
Generic type parameters, Section 11.3
Geometric figures, Section 12.5
Geometry (body), Section 12.5
Geometry.IO (body of Child Package), Section 12.5
Geometry.IO child package, Section 12.5
Geometry.IO (spec. for Child Package), Section 12.5
Geometry (spec), Section 12.5
Get_Natural_Token, Section 7.5
Get operations, behaviors of, Section 9.3
GPA (grade point average), Section 4.5
Grammar errors, Section 2.11
Grow_Money, Section 6.3

H

Hand trace, Section 4.3
Hard disks, Section 1.2
Hardware defined, Section 1.2
Head and tail pointers, Section 14.3
Hello_Initials, Section 2.2
Hello_Name, Section 2.2
Hello, Section 2.2
Heterogeneous arrays, Section 15.4
Heterogeneous defined, Section 8.5
Hierarchical records, Section 8.4
High-level languages, Section 1.5
Histogram, Section 9.4
Histogram-plotting program (case study), Section 9.4
Home_Budget, Section 8.7
Home budget problem (case study), Section 8.7
Homogeneous defined, Section 8.5
Hot line, software support, Section 11.2

I

Ichbiah, Jean, Section 2.1
Identifier names, choosing, Section 2.4
Identifiers, Section 2.2
   invalid, Section 2.4
   predefined, Section 2.2
   user-defined, Section 2.4
   valid, Section 2.4
IF and the CASE statements, comparison of, Section 7.6
IF and WHILE statements, Section 6.10
IF statements, Section 4.1
   and Boolean expressions, Section 4.1
   multiple alternative, Section 4.5
   nested, Section 4.5
   selecting alternative, Section 4.1
   writing a multiple-alternative, Section 4.5
Inch_to_CM, Section 2.3
Indentation conventions, Section 4.5
Indexes
   array, Section 8.5
   using subscript, Section 8.6
Infinite loops, Section 14.7
Infinite recursion, Section 14.7
Information hiding, Section 10.1
Inheritance, Chapter 15
IN operator, Section 5.6
Input data, Section 1.6, Section 5.3
Input operations, Section 2.8
Input/output
   operations for enumeration types, Section 3.4
   statements, Section 2.8
Input tokens, Section 2.8
InsertInOrder, Section 14.4
Integer, subtypes of, Section 2.10
Integer data type, Section 2.10
Integers
   defined, Section 2.8
   nonnegative, Section 2.3
   objects, Section 2.10
   sum of (case study), Section 5.1
   values, Section 2.3
Internet defined, Section 1.2
Invalid identifiers, Section 2.4
IsBalanced, Section 14.6
ISO (International Standards Organization), Section 2.1
Iterations
   and recursive procedures compared, Section 13.5
   WHILE loops with zero, Section 6.2

L

Languages
   assembly, Section 1.5
   high-level, Section 1.5
   high-order, Section 1.5
   machine, Section 1.5
   natural, Section 1.5
   programming, Section 1.5
Laptops, Section 1.1
Libraries, Section 2.2
   setting up, Section 1.7
   using math, Section 4.6
LIFO (last-in, first-out) structure, Section 14.6
Line_Length, Section 9.6
Line lengths in a text file (case study), Section 9.6
Linked data structures, Section 14.1
Linked list operations, Section 14.2
   iterative implementation of, Section 14.2
   miscellaneous, Section 14.2
   recursive implementations of, Section 14.2
Linked list packages
   generic version of, Section 14.5
   operations in the generic, Section 14.5
Linked Lists
   debugging programs with, Section 14.7
   with head and tail pointers, Section 14.3
   heterogeneous, Section 15.6
   implementing stacks using, Section 14.6
   ordered insertions in, Section 14.4
Linked structure, creating a, Section 14.1
Linkers, Section 1.6
List correspondence, rules for parameter, Section 6.6
List of numbers (case study), Section 5.3
Lists_Generic, Section 14.5
Lists, named association in actual parameter, Section 6.6
Literals
   defined, Section 2.10, Section 7.1
   enumeration, Section 3.4
   numeric, Section 7.1
   single character, Section 2.11
   string, Section 2.11
   and tokens, Section 2.10
Local variables, Section 4.7
Logic or algorithm errors, Section 2.11
LOOP and EXIT statements, Section 6.4
Loop forms
   initial, Section 6.2
   miscellaneous, Chapter 6
   revised, Section 6.2
Loops
   counter-controlled, Section 6.1
   counter defined, Section 5.1
   counting, Section 5.1
   data value in a, Section 6.2
   event-controlled, Section 6.1
   flag-controlled, Section 6.2
   FOR, Section 8.6
   infinite, Section 14.7
   initialization, Section 6.2
   invariants, Section 6.3
   nested, Section 5.4
   sentinel-controlled, Section 6.2, Section 6.2
Lovelace, Countess of (Augusta Ada Byron), Section 2.1


Previous | Next | Table of Contents | Index | Program List | Copyright

Copyright © 1996 by Addison-Wesley Publishing Company, Inc.