Number

A number is a fundamental building block of Mathematics. Many types of numbers exist, including natural numbers, integers, decimals, and fractions.

Quiz (1 point)

Which of the following is NOT a number?

Number is used as input in the following functions:

x^m

log_bx

the element at index i of stack x

result of storing value at index idx of stack x

set index idx of remaining stack x to value with visited : parsed

remaining elements after x is popped at index i

popped value from stack x at index i

stack after popping a value from stack x at index i

length of remaining stack x with count count

output of the index_compute function where the input stack is s, value is n, and index is i

index of value n in x with current index i

remainder of x divided by y

x in bits

f(x)

derivative of x

limit of f as x approaches c

x squared

instruction #i is add dst=dst src1=src1 src2=src2

an add instruction with dst: dst src1: src1 and src2: src2

instruction #i is beq left=left right=right imm=imm

a BEQ instruction that compares left and right with immediate imm

instruction #i is jump imm=imm

a jump instruction with to: imm

instruction #i is jumpr addr=addr

jump register instruction with addr: addr

instruction #i is addi dst=dst src=src imm=imm

an ADDI instruction with src: src imm: imm and dst: dst

subtract immediate instruction with dst: dst src: src and immediate: imm at i

subtract immediate instruction with dst: dst src: src and immediate: imm

instruction #i is store src=src addr=addr imm=imm

a STORE instruction with src: src address: addr and immediate: imm

instruction #i is load dst=dst addr=addr imm=imm

a LOAD instruction with dst: dst addr: addr and imm: imm

instruction #i is jal imm=jump_to

JAL instruction with jump to: jump_to

instruction #i is a NOP instruction

value of cell i at time t

byte at ID: id, cell #i at time t

the PC at time t

the PC at computer id and time t

there is a computer at location x: x y: y z: z and time: t

target = value

"if" map at time s

'while stack' at time s

"while" statement with condition test

"break" state at s

"continue" state at s

x is constant

the line at time s

the tab at time s

the expression at time s

statement at line l, tab s

expression state at time s

expression state with parent stack: parent_stack arguments: arg_stack values: value_stack line: line tab: tab

expression state with expression stack: expr_stack values: value_stack line: line tab: tab

return value

Value Stack at time s

parent stack at time s

arguments stack at time s

Return Value at time s

there is a function named name with parameters params at line line

Class Map at time time

there is a class named name at line line

there is a method named method_name with parameters params at line line

stack at time s

Argument Values at time s

Variables Map at time s

Parameters List at time s

Function Variables Map at time s

program context where Local Variables Map: variables, Expression Stack: expr_stack, Values Stack: values_stack, Line: line, Tab: tab, and Control Map: control_map

result of storing value at key: key in map: vars

output of function store_compute where input key is key, value is value, map is vars, and processed map is visited

pair (key, value)

entry key: value

expression left + right

expression left - right

expression left * right

expression left == right

expression left > right

expression left < right

Python reference index

Python Object Store at time t

Control Map at time t

map map_a does not contain a for loop entry at line: line and tab: tab

number of characters read at t

cursor x at time t

cursor y at time t

display text at x: x, y: y, and time: t

interrupt at index: i time: t

interrupt at computer: id index: i time: t

disk bytes read at time t

disk byte at index: i time: t

the instruction at computer id and index i

network bytes read from computer: id at time t

Expression Stack at time s

Context Stack at time s

expression value at time s

towers of hanoi towers

move disk towers is even

move disk towers

move one towers

get subtowertower

get subtower maptower

find other one

towers of hanoi top disks towers

towers of hanoi top towers

Height of a tree tree and index index

node (value, left, right)

node (value, children)

result of inserting value to tree tree

output of the bst_insert function where input tree is tree, value is value and index is index

result of removing value from tree tree

pop value from tree tree

find referece to node index in tree tree

find parent index of tree

find nearest largertree

output of the halve stack function where input stack is s, other stack is other, and count is value

get adjacent nodes nodes

get adjacent nodes helpnodes

children of the node at backwards index index of tree tree in graph graph

get children help graph

result of adding elements to tree nodes as children of the node at backwards index index

spanning tree of graph graph starting at node root

output of the spanning_tree function where the input graph is graph, backwards index is index, and the spanning tree is tree

result of pushing nodes elements into tree tree where parent is index and parent distance is distance

shortest path from node value to every other node in graph graph

output of the shortest_path function where the input graph is graph, backwards index is index, and tree is tree

result of adding or updating children pairs of the node at backwards index index in tree tree

edge (left, right, weight)

node (value, distance, index)

result of updating nodes children in tree tree with parent index index and parent distance distance

Number is used as output in the following functions:

x^m

area of quadrilateral ABCD

area of pentagon ABCDE

area of hexagon ABCDEF

the x coordinate of point A

the y coordinate of point A

popped value from stack x at index i

remainder of x divided by y

join lists x and y

f(x)

derivative of x

limit of f as x approaches c

x squared

value of cell i at time t

byte at ID: id, cell #i at time t

the PC at time t

the PC at computer id and time t

the line at time s

the tab at time s

return value

value at key in map vars

number of lines

number of characters read at t

cursor x at time t

cursor y at time t

display text at x: x, y: y, and time: t

interrupt at index: i time: t

interrupt at computer: id index: i time: t

disk bytes read at time t

disk byte at index: i time: t

network bytes read from computer: id at time t

char in decimal

find other one

height of tree n

Height of a tree tree and index index

find root index in tree

find parent index of tree

find nearest largertree

smallest value in tree

result of updating the root of tree with value

result of building the BST from nodes nodes and moves moves

result of AVL insert of tree tree and value value

result of merging stacks s1 and s2

output of the merge_stacks function where input stacks are s1 and s2, and merged stack is r

Comments

Please log in to add comments