random-access programming

random-access programming

[′ran·dəm ¦ak‚ses ′prō‚gram·iŋ]
(computer science)
Programming without regard for the time required for access to the storage positions called for in the program, in contrast to minimum-access programming.