The RAM model of Computation
Machine-independent algorithm design depends upon a
hypothetical computer called the “Random Access
Machine” or “RAM”
● Each simple operation (+, *, –, =, if, call) takes exactly one
time step.
● Loops and subroutines. The time it takes to run through a
loop or execute a subprogram depends upon the number
of loop iterations or the specific nature of the subprogram.
● Each memory access takes exactly one time step. Further,
we have as much memory as we need. The RAM model
takes no notice of whether an item is in cache or on the
disk.