Logo
Unionpedia
Communication
Get it on Google Play
New! Download Unionpedia on your Android™ device!
Download
Faster access than browser!
 

Sequential access

Index Sequential access

In computer science, sequential access means that a group of elements (such as data in a memory array or a disk file or on magnetic tape data storage) is accessed in a predetermined, ordered sequence. [1]

13 relations: Big O notation, Binary search algorithm, Computer science, Data structure, Direct-access storage device, Hard disk drive, Linked list, Magnetic tape data storage, Merge sort, Queued Sequential Access Method, Quicksort, Random access, Sequence.

Big O notation

Big O notation is a mathematical notation that describes the limiting behaviour of a function when the argument tends towards a particular value or infinity.

New!!: Sequential access and Big O notation · See more »

Binary search algorithm

In computer science, binary search, also known as half-interval search,logarithmic search, or binary chop, is a search algorithm that finds the position of a target value within a sorted array.

New!!: Sequential access and Binary search algorithm · See more »

Computer science

Computer science deals with the theoretical foundations of information and computation, together with practical techniques for the implementation and application of these foundations.

New!!: Sequential access and Computer science · See more »

Data structure

In computer science, a data structure is a data organization and storage format that enables efficient access and modification.

New!!: Sequential access and Data structure · See more »

Direct-access storage device

A direct-access storage device (DASD) pronounced) is a secondary storage device in which "each physical record has a discrete location and a unique address." IBM coined the term DASD as a shorthand describing disks, magnetic drums, and data cells. Later, optical disc drives are also classified as DASD. The term DASD contrasts with sequential storage media such as magnetic tape, and unit record equipment such as card devices like card readers and punches. Access methods for DASD include sequential, indexed, and direct. Direct access contrasts with the sequential access method used in tape drives. A record on a DASD can be accessed without having to read through intervening records from the current location, whereas reading anything other than the "next" record on tape requires skipping over intervening records, and requires a proportionally long time to access a distant point in a medium. The DASD storage class includes both fixed and removable media.

New!!: Sequential access and Direct-access storage device · See more »

Hard disk drive

A hard disk drive (HDD), hard disk, hard drive or fixed disk is an electromechanical data storage device that uses magnetic storage to store and retrieve digital information using one or more rigid rapidly rotating disks (platters) coated with magnetic material.

New!!: Sequential access and Hard disk drive · See more »

Linked list

In computer science, a linked list is a linear collection of data elements, whose order is not given by their physical placement in memory.

New!!: Sequential access and Linked list · See more »

Magnetic tape data storage

Magnetic tape data storage is a system for storing digital information on magnetic tape using digital recording.

New!!: Sequential access and Magnetic tape data storage · See more »

Merge sort

In computer science, merge sort (also commonly spelled mergesort) is an efficient, general-purpose, comparison-based sorting algorithm.

New!!: Sequential access and Merge sort · See more »

Queued Sequential Access Method

In IBM mainframe operating systems, queued sequential access method (QSAM) is an access method to read and write datasets sequentially.

New!!: Sequential access and Queued Sequential Access Method · See more »

Quicksort

Quicksort (sometimes called partition-exchange sort) is an efficient sorting algorithm, serving as a systematic method for placing the elements of an array in order.

New!!: Sequential access and Quicksort · See more »

Random access

In computer science, random access (more precisely and more generally called direct access) is the ability to access any item of data from a population of addressable elements roughly as easily and efficiently as any other, no matter how many elements may be in the set.

New!!: Sequential access and Random access · See more »

Sequence

In mathematics, a sequence is an enumerated collection of objects in which repetitions are allowed.

New!!: Sequential access and Sequence · See more »

Redirects here:

Sequential I/O, Sequential access method, Sequential read, Sequential write, Serial access.

References

[1] https://en.wikipedia.org/wiki/Sequential_access

OutgoingIncoming
Hey! We are on Facebook now! »