In computer science, random access (sometimes called direct access) is the ability to access an element at an arbitrary position in a sequence in equal time, independent of sequence size. The position is arbitrary in the sense that it is unpredictable, thus the use of the term "random" in "random access". The opposite is sequential access, where a remote element takes longer time to access. A typical illustration of this distinction is to compare an ancient scroll (sequential; all material prior to the data needed must be unrolled) and the book (random: can be immediately flipped open to any random page). A more modern example is a cassette tape (sequential—you have to fast-forward through earlier songs to get to later ones) and a CD (random access—you can skip to the track you want).
In data structures, random access implies the ability to access any entry in a list in constant (i.e. independent of its position in the list and of list's size, i.e. ) time. Very few data structures can guarantee this, other than arrays (and related structures like dynamic arrays). Random access is critical, or at least valuable, to many algorithms such as binary search, integer sorting or certain versions of sieve of Eratosthenes. Other data structures, such as linked lists, sacrifice random access to make for efficient inserts, deletes, or reordering of data. Self-balancing binary search trees may provide an acceptable compromise, where access time is equal for any member of a collection and only grows logarithmically with its size.
Other articles related to "random, random access, access":
... abbreviation for double data rate (fourth generation) synchronous dynamic random-access memory, is a type of dynamic random-access memory (DRAM) with a high bandwidth interface expected to be released to ... which have been in use since the early 1970s and is not compatible with any earlier type of random access memory (RAM) due to different signaling voltages ...
... The RandomAccessFile class supports random access reading and writing of files ... The class uses a file pointer that represents a byte-offset within the file for the next read or write operation ...
... to a mobile or a group or it may be random access ... Random access timeslots will be used when a mobile user initiates a call, or when a mobile registers on the TSC ... two or more mobile radio units will try to transmit at the same time on the same random access timeslot ...
... either DOM based - the entire document is read into memory as a tree structure for random access by the calling application event based - the application ... Both have advantages the former (for example, DOM) allows for random access to the document, the latter (e.g ... These two access metaphors can be thought of as polar opposites ...
Famous quotes containing the words access and/or random:
“The Hacker Ethic: Access to computersand anything which might teach you something about the way the world worksshould be unlimited and total.
Always yield to the Hands-On Imperative!
All information should be free.
Mistrust authoritypromote decentralization.
Hackers should be judged by their hacking, not bogus criteria such as degrees, age, race, or position.
You can create art and beauty on a computer.
Computers can change your life for the better.”
—Steven Levy, U.S. writer. Hackers, ch. 2, The Hacker Ethic, pp. 27-33, Anchor Press, Doubleday (1984)
“Novels as dull as dishwater, with the grease of random sentiments floating on top.”
—Italo Calvino (19231985)