Random access compared to sequential access.

In computer science, random access (sometimes called direct access) is the ability to access an arbitrary element of a sequence in equal time. 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 compact disc (random access—you can jump right to the track you want). The term random access memory (RAM), however, is used for semiconductor chip memory circuits used in computers. (The term was also used to describe ferrite-core memory in early computers). In computer science sequential access means that a group of elements (e. ... Computer science, or computing science, is the study of the theoretical foundations of information and computation and their implementation and application in computer systems. ... This is a page about mathematics. ... In computer science sequential access means that a group of elements (e. ... A scroll is a roll of parchment, papyrus, or paper which has been written upon. ... For other uses, see Book (disambiguation). ... Look up Page in Wiktionary, the free dictionary Page may mean: In graphic design, typography, or printing: Page header, typography Page footer, typography Page (paper), a leaf or one side of a leaf, as of a book An apprentice, assistant or errand boy: Page (servant), a servant or knights... RAM redirects here. ... A 16 16 cm area core memory plane of 128 128 bits, i. ...

In data structures, random access implies the ability to access the Nth entry in a list of numbers in constant time. Very few data structures can guarantee this, other than arrays (and related structures like dynamic arrays). Random access is critical to many algorithms such as quicksort and binary search. Other data structures, such as linked lists, sacrifice random access to make for efficient inserts, deletes, or searches. A binary tree, a simple type of branching linked data structure. ... For the microarray in genetics, see SNP array. ... A dynamic array, growable array, resizable array, dynamic table, or array list is a data structure, an array which is automatically expanded to accommodate new objects if filled beyond its current size. ... Q sort redirects here. ... In computer science, binary search or binary chop is a search algorithm for finding a particular value in a linear array, by ruling out half of the data at each step. ... In computer science, a linked list is one of the fundamental data structures, and can be used to implement other data structures. ...