Navigation
index
How to Think Like a Computer Scientist: Interactive Edition
»
logout
|
Index
Symbols
|
A
|
B
|
C
|
D
|
E
|
F
|
G
|
H
|
I
|
J
|
K
|
L
|
M
|
N
|
O
|
P
|
R
|
S
|
T
|
U
|
V
|
W
Symbols
3n + 1 sequence
A
abecedarian series
abstraction
activecode
algorithm
,
[1]
,
[2]
,
[3]
deterministic
aliases
,
[1]
,
[2]
alternative execution
ambiguity
argument
,
[1]
assignment
,
[1]
tuple
assignment statement
,
[1]
,
[2]
assignment token
attribute
,
[1]
,
[2]
B
bar chart
base case
,
[1]
block
,
[1]
body
,
[1]
,
[2]
,
[3]
boolean expression
,
[1]
boolean function
,
[1]
boolean value
,
[1]
branch
,
[1]
bug
,
[1]
byte code
C
call graph
canvas
,
[1]
chained conditional
,
[1]
character
chatterbox function
chunking
class
,
[1]
,
[2]
clone
,
[1]
close
codelens
collection
collection data type
command line
comment
,
[1]
comments
comparison of strings
comparison operator
,
[1]
compile
,
[1]
composition
,
[1]
(of functions)
compound data type
,
[1]
compound statement
,
[1]
body
header
computation pattern
concatenate
concatenation
,
[1]
condition
conditional
chained
conditional branching
conditional execution
conditional statement
,
[1]
conditionals
nested
constructor
control flow
,
[1]
counter
counting pattern
cursor
,
[1]
D
data structure
,
[1]
recursive
data type
,
[1]
dead code
,
[1]
debugging
,
[1]
decrement
deep copy
deep equality
,
[1]
default value
,
[1]
definite iteration
definition
function
,
[1]
recursive
del statement
,
[1]
delimiter
deterministic
deterministic algorithm
dictionary
,
[1]
dir function
docstring
,
[1]
documentation
dot notation
,
[1]
Doyle, Arthur Conan
E
element
,
[1]
elif
else
enumerate
equality
deep
shallow
escape sequence
,
[1]
eureka traversal
evaluate
exception
,
[1]
,
[2]
executable
expression
,
[1]
,
[2]
boolean
F
float
,
[1]
,
[2]
flow of execution
,
[1]
,
[2]
for loop
,
[1]
,
[2]
,
[3]
,
[4]
,
[5]
for loop traversal (for)
formal language
,
[1]
fractal
Cesaro torn square
Koch
Sierpinski triangle
fruitful function
,
[1]
function
,
[1]
,
[2]
argument
composition
len
parameter
function call
function composition
,
[1]
function definition
,
[1]
,
[2]
function type
functional decomposition
G
generalization
generalize
H
handle an exception
header line
high-level language
,
[1]
Holmes, Sherlock
I
if
if statement
immutable
,
[1]
,
[2]
,
[3]
immutable data type
import statement
,
[1]
in and not in operator (in, not in)
in operator
increment
incremental development
,
[1]
indefinite iteration
index
,
[1]
,
[2]
,
[3]
negative
indexing ([])
infinite loop
infinite recursion
,
[1]
initialization (of a variable)
initializer method
input
input dialog
instance
,
[1]
,
[2]
instantiate
int
,
[1]
,
[2]
integer
integer division
,
[1]
Intel
interpret
,
[1]
invoke
,
[1]
is operator
item assignment
iteration
,
[1]
,
[2]
J
join
K
key
,
[1]
key-value pair
,
[1]
keyword
,
[1]
Koch fractal
L
len function
length function (len)
lifetime
,
[1]
Linux
list
,
[1]
append
nested
,
[1]
list index
list traversal
,
[1]
literalness
local variable
,
[1]
,
[2]
logarithm
logical operator
,
[1]
,
[2]
loop
loop body
loop variable
,
[1]
low-level language
,
[1]
M
Make Way for Ducklings
mapping type
,
[1]
matrix
,
[1]
McCloskey, Robert
memo
method
,
[1]
,
[2]
modifier
,
[1]
module
,
[1]
,
[2]
,
[3]
modulus
modulus operator
,
[1]
,
[2]
mutable
,
[1]
,
[2]
mutable data type
,
[1]
,
[2]
N
natural language
,
[1]
negative index
nested conditionals
nested list
,
[1]
,
[2]
nested loop
nesting
newline
,
[1]
Newton's method
None
,
[1]
O
object
,
[1]
,
[2]
,
[3]
,
[4]
object code
object-oriented language
object-oriented programming
,
[1]
objects and values
open
operand
,
[1]
operator
,
[1]
comparison
in
logical
,
[1]
modulus
optional parameter
,
[1]
order of operations
P
parameter
,
[1]
,
[2]
optional
parse
,
[1]
pass statement
pattern
pattern of computation
Pentium
poetry
portability
portable
print function
problem solving
program
,
[1]
,
[2]
programming language
,
[1]
prompt string
prose
pseudo-random number
pure function
Python shell
R
raise
random number
random number generator
range
range function
read
readline
readlines
reassignment
,
[1]
rectangle
recursion
,
[1]
infinite
recursive call
,
[1]
recursive data structure
recursive definition
,
[1]
redundancy
refactor
reference diagram
return statement
return value
,
[1]
rules of precedence
,
[1]
runtime error
,
[1]
,
[2]
,
[3]
S
safe language
scaffolding
,
[1]
semantic error
,
[1]
semantics
,
[1]
sequence
,
[1]
sequential
shallow copy
shallow equality
,
[1]
shell mode
side effect
,
[1]
slice
slicing ([:])
source code
split
standard library
state
,
[1]
state snapshot
,
[1]
statement
,
[1]
assignment
del
,
[1]
if
import
pass
statement block
str
,
[1]
string
string comparison
(>, <, >=, <=, ==, !=)
string module
string operations
strings and lists
style
subscript operator
syntax
,
[1]
syntax error
,
[1]
T
tab
,
[1]
table
temporary variable
,
[1]
terminal
terminating condition
token
,
[1]
traversal
,
[1]
traverse
triple quoted string
truncation
tuple
,
[1]
assignment
return value
tuple assignment
turtle
turtle module
type conversion function
type converter functions
U
underscore character
unit tests
unreachable code
V
value
,
[1]
,
[2]
,
[3]
boolean
variable
,
[1]
local
,
[1]
temporary
variable name
W
whitespace
wrapping code in a function
Navigation
index
How to Think Like a Computer Scientist: Interactive Edition
»
logout
|