Navigation
index
How to Think Like a Computer Scientist: Learning with Python 2nd Edition documentation
»
Index
Index
Symbols
|
A
|
B
|
C
|
D
|
E
|
F
|
G
|
H
|
I
|
J
|
K
|
L
|
M
|
N
|
O
|
P
|
Q
|
R
|
S
|
T
|
U
|
V
|
W
Symbols
"hello world!"
``for`` loop
``is`` operator
``join``
``range`` function
``split``
A
abecedarian series
abstract data type (ADT)
abstraction
accumulator
algorithm
,
[1]
,
[2]
,
[3]
,
[4]
aliases
alternative execution
ambiguity
argument
,
[1]
argv
assignment
,
[1]
multiple
tuple
assignment operator
assignment statement
,
[1]
,
[2]
attribute
,
[1]
B
base case
,
[1]
binary operator
binary tree
block
,
[1]
body
,
[1]
,
[2]
,
[3]
,
[4]
,
[5]
,
[6]
,
[7]
boolean expression
,
[1]
boolean function
,
[1]
boolean value
,
[1]
bracket operator
branch
,
[1]
bug
,
[1]
byte code
C
cargo
chained conditional
,
[1]
character
character classification
child
child class
class
class attribute
client
clone
command line
command line argument
command prompt
comment
,
[1]
comparison of strings
comparison operator
compile
,
[1]
composition
,
[1]
,
[2]
(of functions)
composition of functions
compound data type
compound data types
compound statement
,
[1]
body
header
computation pattern
concatenate
concatenation
,
[1]
condition
,
[1]
conditional
chained
conditional branching
conditional execution
conditional statement
conditionals
nested
constant
constant time
continue statement
counter
counting pattern
cursor
,
[1]
D
data structure
data structures
recursive
data type
,
[1]
dead code
,
[1]
debugging
,
[1]
decrement
default value
,
[1]
definition
function
delimiter
,
[1]
,
[2]
development plan
,
[1]
dictionary
,
[1]
dir function
directory
docstring
,
[1]
doctest
dot notation
,
[1]
,
[2]
dot operator
dot product
Doyle, Arthur Conan
E
element
,
[1]
,
[2]
,
[3]
,
[4]
elif
else
embedded reference
encapsulate
encapsulation
encode
enumerate
escape sequence
,
[1]
eureka traversal
evaluate
event
event loop
event-driven program
exception
,
[1]
,
[2]
,
[3]
executable
expression
,
[1]
,
[2]
boolean
F
factorial
fibonacci
FIFO
file
file system
float
,
[1]
flow of execution
,
[1]
for loop
,
[1]
for loop traversal (for)
formal language
,
[1]
frame
,
[1]
fruitful function
function
,
[1]
,
[2]
argument
composition
len
parameter
function call
function composition
,
[1]
function definition
,
[1]
function frame
function type
functional programming style
fundamental ambiguity theorem
G
generalization
generalize
generic data structure
graphics
H
hand trace
handle an exception
handling an exception
header
helper
high-level language
,
[1]
hint
Holmes, Sherlock
I
if
if statement
immutable
,
[1]
,
[2]
,
[3]
immutable data type
implementation
import
,
[1]
import statement
,
[1]
in
in operator
(in)
increment
incremental development
,
[1]
index
,
[1]
,
[2]
negative
indexing ([])
infinite loop
,
[1]
infinite recursion
,
[1]
infix
inheritance
initialization (of a variable)
initialization method
inorder
input
instance
instantiate
int
,
[1]
integer
integer division
,
[1]
Intel
interface
interpret
,
[1]
invariant
item assignment
iteration
,
[1]
,
[2]
,
[3]
J
Jython
K
key
,
[1]
key-value pair
,
[1]
keyboard input
keyword
,
[1]
L
leaf
len function
length function (len)
level
linear time
link
linked list
linked queue
Linux
list
,
[1]
,
[2]
,
[3]
,
[4]
list comprehension
,
[1]
list traversal
literalness
local variable
,
[1]
,
[2]
logarithm
logical operator
,
[1]
loop
,
[1]
,
[2]
,
[3]
,
[4]
,
[5]
loop body
loop variable
low-level language
,
[1]
lowercase
M
Make Way for Ducklings
mapping type
,
[1]
McCloskey, Robert
method
,
[1]
,
[2]
mode
modifier
,
[1]
modifiers
module
modulus operator
,
[1]
multiple assignment
,
[1]
mutable
,
[1]
,
[2]
mutable data type
mutable type
N
namespace
naming collision
natural language
,
[1]
negative index
nested conditionals
nested list
nested loop
nesting
newline
,
[1]
Newton's method
node
non-volatile memory
None
,
[1]
NoneType
O
object
,
[1]
object code
object-oriented language
object-oriented programming
objects and values
operand
,
[1]
operations on strings
operator
,
[1]
in
logical
modulus
operator overloading
optional parameter
,
[1]
order of operations
overflow
P
parameter
,
[1]
parent
parent class
parse
,
[1]
,
[2]
pass
pass statement
path
pattern of computation
Pentium
planned development
Poetry
polymorphic
portability
portable
postfix
postorder
precondition
prefix notation
preorder
print statement
,
[1]
Priority Queue
priority queue
problem solving
program
,
[1]
program development
program tracing
programming language
Programs
prompt
,
[1]
Prose
prototype development
provider
pure function
,
[1]
pure functions
pydoc
Python Library Reference
Python shell
Q
Queue
queue
queueing policy
R
raise
random
range
recursion
,
[1]
recursive call
,
[1]
recursive data structure
recursive definition
,
[1]
redundancy
return
,
[1]
return statement
,
[1]
return value
,
[1]
root
rules of precedence
,
[1]
runtime error
,
[1]
,
[2]
,
[3]
S
safe language
scaffolding
,
[1]
scalar multiplication
script
semantic error
,
[1]
semantics
,
[1]
sequence
siblings
side effect
singleton
slice
,
[1]
slicing ([:])
source code
stack diagram
,
[1]
stack trace
standard library
state diagram
,
[1]
statement
,
[1]
assignment
if
pass
return
statement block
step size
str
string
string comparison
(>, <, >=, <=, ==)
string formatting
string module
string operations
string slice
strings and lists
subexpression
syntax
,
[1]
syntax error
,
[1]
T
tab
,
[1]
table
tail recursion
,
[1]
TDD
temporary variable
,
[1]
Test-driven development
test-driven development (TDD)
text file
token
,
[1]
trace
traceback
,
[1]
tracing a program
traversal
,
[1]
traverse
trichotomy
triple quoted string
tuple
,
[1]
assignment
return value
tuple assignment
,
[1]
two-dimensional table
type
conversion
type conversion
,
[1]
U
underscore character
unit testing
,
[1]
uppercase
V
value
,
[1]
,
[2]
boolean
None
variable
,
[1]
local
,
[1]
temporary
variable name
veneer
volatile memory
W
while
while loop
while statement
whitespace
,
[1]
wrapper
wrapping code in a function
,
[1]
Navigation
index
How to Think Like a Computer Scientist: Learning with Python 2nd Edition documentation
»
Index