Index

A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W

A

abbreviated assignment
abecedarian series
abstract data type (ADT)
accumulator
algorithm, [1], [2], [3]
deterministic
aliases, [1], [2]
Alice in Wonderland download
alternative execution
ambiguity
animation
argument, [1]
assignment, [1]
tuple
assignment statement, [1], [2]
assignment token
attribute, [1], [2], [3], [4], [5]

B

bar chart
base case, [1]
binary
binary operator
binary search
binary tree
bits
bitwise and
bitwise or
bitwise xor
block, [1]
body, [1], [2], [3]
Boolean algebra
Boolean expression, [1]
Boolean function, [1]
Boolean value, [1]
branch, [1]
break statement
breakpoint
bug, [1]
builtin scope
bump

C

call graph
canvas, [1]
cargo
chained conditional, [1]
character
chatterbox function
child
child class
chunking, [1]
class, [1]
class attribute
client
clone, [1]
Collatz 3n + 1 sequence
collection, [1]
comment, [1]
comparison of strings
comparison operator, [1]
compile
composition, [1], [2]
(of functions)
composition of functions
compound data type, [1], [2]
compound statement, [1]
body
header
computation pattern
concatenate
concatenation, [1]
condition, [1]
conditional
chained
conditional branching
conditional execution
conditional statement, [1]
conditionals
nested
constant time
constructor
continue statement, [1]
control flow, [1], [2]
copy
deep
shallow
counter
counting pattern
cursor

D

data representation
data structure, [1], [2]
recursive
data type, [1]
database
dead code, [1]
debugging, [1], [2]
decrement
deep copy
deep equality, [1]
default value, [1]
definite iteration
definition
function, [1]
recursive
del statement, [1]
delimiter, [1], [2], [3]
deserialization
deterministic algorithm
development plan, [1]
dictionary, [1], [2]
dir function
directory, [1], [2], [3]
docstring, [1], [2]
dot notation, [1]
dot operator, [1]
dot product
download Alice in Wonderland
Doyle, Arthur Conan
duplicate removal

E

Eight Queens puzzle
element, [1], [2]
elif
else
email sending
embedded reference
encapsulate
encapsulation
encode
enumerate
equality
deep
shallow
escape sequence, [1]
eureka traversal
evaluate
event
exception, [1], [2], [3]
handling
expression, [1]
Boolean

F

fibonacci numbers
field width
FIFO (First In, First Out)
file, [1], [2]
text, [1]
file handle
file system, [1]
float, [1], [2]
floor division, [1]
flow of execution, [1], [2]
for loop, [1], [2], [3], [4]
for loop traversal (for)
formal language, [1]
formatting
strings
fractal
Cesaro torn square
Sierpinski triangle
frame
frame rate
fruitful function, [1]
fully qualified name
function, [1], [2], [3]
argument
composition
len
parameter
pure
function call
function composition, [1], [2]
function definition, [1], [2]
function tips
function type
functional programming style
fundamental ambiguity theorem

G

generalization, [1]
generalize
generic data structure
global scope
gravity
gzip

H

hand trace
handle, [1], [2]
handle an exception
handler
handling an exception
header line
help
helper
high-level language, [1]
Holmes, Sherlock

I

if
if statement
immediate mode
immutable, [1], [2]
immutable data value, [1], [2], [3]
implementation
import statement, [1], [2], [3], [4]
in and not in operator (in, not in)
in operator
increment
incremental development, [1]
indefinite iteration
index, [1], [2], [3]
negative
indexing ([])
infinite loop, [1]
infinite recursion, [1]
infix
inheritance
initialization (of a variable)
initializer method
input
input dialog
instance, [1], [2]
instantiate
int, [1], [2]
integer
Intel
interface
interpret
interpreter
invariant
invoke, [1]
is operator
item, [1], [2]
item assignment
iteration, [1], [2]

J

join
JSON
justification

K

key, [1], [2]
key:value pair, [1], [2]
keyword, [1]

L

leaf
len function
length function (len)
level
lifetime, [1]
linear
linear search
linear time
link
linked list
linked queue
Linux
list, [1], [2]
append
nested, [1]
list index
list traversal, [1]
literalness
local scope
local variable, [1], [2]
logarithm
logical operator, [1], [2]
loop, [1]
loop body, [1]
loop variable, [1]
low-level language, [1]

M

Make Way for Ducklings
mapping type, [1], [2]
matrix, [1]
McCloskey, Robert
memo, [1]
Merge algorithm
meta-notation, [1]
method, [1], [2], [3]
middle-test loop
mode, [1]
modifier, [1], [2], [3]
module, [1], [2], [3]
modulus operator, [1]
mutable, [1], [2]
mutable data value, [1], [2], [3]

N

namespace, [1]
naming collision
natural language, [1]
negative index
nested conditionals
nested list, [1], [2]
nested loop
nesting
newline, [1]
Newton's method
node
non-volatile memory, [1]
None, [1], [2]
normalized

O

object, [1], [2], [3]
object code
object-oriented language
object-oriented programming, [1]
objects and values
operand, [1]
operations on strings
operator, [1]
comparison
in
logical, [1]
modulus
operator overloading
optional parameter, [1]
order of operations

P

parameter, [1], [2]
optional
parent
parent class
parse, [1], [2]
pass statement
path, [1]
pattern
pattern of computation
Pentium
physics
pixel
poetry
polymorphic
portability
portable
post-test loop
postfix
postorder
pre-test loop
precondition
prefix notation
preorder
print function
Priority Queue
priority queue
probe
problem solving
Processing
processing
proficiency
program, [1], [2]
program development
program tracing
programming language
promise, [1], [2]
prompt
prose
provider
pure function, [1]
Python shell

Q

Queue
queue
queueing policy

R

raise
random numbers
range
range function, [1]
rectangle
recursion, [1]
infinite
recursive call, [1]
recursive data structure
recursive definition, [1]
redundancy
refactor
refactoring code
return
return a tuple
return statement, [1]
return value, [1]
root
rules of precedence, [1]
runtime error, [1], [2], [3]

S

safe language
scaffolding, [1], [2]
scalar multiplication
scope
builtin
global
local
script
search
binary search
search: linear search
semantic error, [1]
semantics, [1]
sequence, [1], [2]
serialization
shallow copy
shallow equality, [1]
short-circuit evaluation, [1]
shuffle
siblings
side effect, [1]
single-step
singleton
sketch
slice, [1], [2]
slicing ([:])
socket, [1]
sort
merge sort
source code
split
Spyder
single stepping
stack diagram
state
state snapshot, [1]
statement, [1]
assignment
continue
del, [1]
if
import, [1]
pass
return
statement block
statement: break
step size
str, [1]
string, [1]
string comparison
(>, <, >=, <=, ==, !=)
string formatting
string module
string operations
string slice
strings and lists
style
subexpression
sublist, [1]
subscript operator
substring
syntax, [1]
syntax error, [1]

T

tab, [1]
table
temporary variable, [1]
terminating condition
test suite
Test-driven development
test-driven development (TDD)
text file, [1], [2], [3]
token, [1], [2]
trace
traceback
tracing a program
traversal, [1]
traverse
trichotomy
triple quoted string
truncation
truth table
try ... except
try ... except ... finally
tuple, [1]
assignment
return value
tuple assignment
turtle module
two-dimensional table
type
conversion
type conversion, [1]
type converter functions

U

underscore character
unit testing
unit tests
unreachable code

V

value, [1], [2], [3], [4]
Boolean
variable, [1]
local, [1]
temporary
variable name
variables local
veneer
void function
volatile memory, [1]

W

web server in Python
while loop
while statement
whitespace
wrapper
wrapping code in a function, [1]