Previous Section
 < Free Open Study > 
Next Section


L

leaf node
tree node that has no children
length
the actual number of values stored in a list or string
lifetime
the period of time during program execution when an identifier has memory allocated to it
linear probing
resolving a hash collision by sequentially searching a hash table beginning at the location returned by the hash function
linear time
for an algorithm, when the Big-O work expression can be expressed in terms of a constant times N, where N is the size of the problem
linked list
a list in which the order of the components is determined by an explicit link field in each node, rather than by the sequential order of the components in memory
listing
a copy of a source program, output by a compiler, containing messages to the programmer
literal value
any constant value written in a program
local variable
a variable declared within a block; it is not accessible outside of that block
logarithmic order
for an algorithm, when the Big-0 work expression can be expressed in terms of the logarithm of N, where N is the size of the problem
logging off
informing a computer-usually through a simple command-that no further commands follow
logging on
taking the preliminary steps necessary to identify yourself to a computer so that it accepts your commands
logical order
the order in which the programmer wants the statements in the program to be executed, which may differ from the physical order in which they appear
loop
a method of structuring statements so that they are repeated while certain conditions are met
loop control variable (LCV)
a variable whose value is used to determine whether the loop executes another iteration or exits
loop entry
the point at which the flow of control first passes to a statement inside a loop
loop exit
the point when the repetition of the loop body ends and control passes to the first statement following the loop
loop invariant
assertions about the characteristics of a loop that must always be true for a loop to execute properly; the assertions are true on loop entry, at the start of each loop iteration, and on exit from the loop, but are not necessarily true at each point in the body of the loop
loop test
the point at which the loop expression is evaluated and the decision is made either to begin a new iteration or skip to the statement immediately following the loop


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