Data structures that hold items in a line, where the order of the items matters. The group includes the singly and doubly linked lists, whose elements are joined by links rather than by position in memory, the double-ended queue and the priority queue, which differ in where items enter and leave and in what decides the next item served, the circular buffer that reuses a fixed block of memory end to end, and the string, a sequence of characters.
All Linear and Sequence Structures
Filter Results9 entries
Sources
Free On-line Dictionary of Computing: Stack
Free On-line Dictionary of ComputingHas Member: Stack, Dictionary entryQuote, Has Member: Stack, Dictionary entry
A data structure for storing items which are to be accessed in last-in first-out order
Free On-line Dictionary of Computing: Queue
Free On-line Dictionary of ComputingHas Member: Queue, Dictionary entryQuote, Has Member: Queue, Dictionary entry
A first-in first-out data structure used to sequence objects
Free On-line Dictionary of Computing: Array
Free On-line Dictionary of ComputingHas Member: Array, Dictionary entryQuote, Has Member: Array, Dictionary entry
A collection of identically typed data items distinguished by their indices
Wikipedia: Linked list
Wikimedia FoundationHas Member: Linked List, LeadQuote, Has Member: Linked List, Lead
In computer science, a linked list is a linear collection of data elements whose order is not given by their physical placement in memory.
Doubly linked list (Wikipedia)
Has Member: Doubly Linked List, LeadQuote, Has Member: Doubly Linked List, Lead
In computer science, a doubly linked list is a linked data structure that consists of a set of sequentially linked records called nodes.
Circular buffer, Wikipedia
Has Member: Circular Buffer, LeadQuote, Has Member: Circular Buffer, Lead
In computer science, a circular buffer, circular queue, cyclic buffer or ring buffer is a data structure that uses a single, fixed-size buffer as if it were connected end-to-end.
Double-ended queue (Wikipedia)
Has Member: Deque, LeadQuote, Has Member: Deque, Lead
In computer science, a double-ended queue (abbreviated as deque, DEK), is an abstract data type that serves as a container, with a restricted access to the stored items.
Priority queue (Wikipedia)
Has Member: Priority Queue, LeadQuote, Has Member: Priority Queue, Lead
In computer science, a priority queue is an abstract data type similar to a regular queue where each element has an associated priority determining its order of service.
String (Computer Science) (Wikipedia)
Has Member: String (computer science), LeadQuote, Has Member: String (computer science), Lead
In computer programming, a string is traditionally a sequence of characters, either as a literal constant or as some kind of variable.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.