iPedia Free Information Center

Information about List Of Data Structures

This is a list of data structures. For a wider list of terms, see list of terms relating to algorithms and data structures.

Linear data structures

General type Specific types
List (or vector)
Associative array
(a.k.a. dictionary or map)

Non linear data structures

General type Specific types
Graph data structures
Tree data structures

Base data structures

General type Specific types
primitive data types
  • int
  • char
struct or Composite

Comparison

An attempt to classify data structures based on feature attributes:

Structure Ordered Unique Cells per Node
Bag (multiset)nono1
Setnoyes1
Listyesno1
Mapnoyes2


"Ordered" does not mean sorted, only that input order is "retained". Other structures such as "linked list" and "stack" cannot easily be defined this way because there are specific operations associated with them.
data structure is a way of storing data in a computer so that it can be used efficiently. Often a carefully chosen data structure will allow the most efficient algorithm to be used. The choice of the data structure often begins from the choice of an abstract data type.
..... Click the link for more information.
terms relating to algorithms and data structures. For algorithms and data structures not necessarily mentioned here, see list of algorithms and list of data structures.
..... Click the link for more information.
list is a collection of entities/items.

In the context of object-oriented programming languages, a list is defined as an instance of an abstract data type (ADT), formalizing the concept of an ordered collection of entities.
..... Click the link for more information.
array is a data structure consisting of a group of elements that are accessed by indexing. In most programming languages each element has the same data type and the array occupies a contiguous area of storage. Most programming languages have a built-in array data type.
..... Click the link for more information.
bitmap or pixmap is a type of memory organization or image file format used to store digital images. The term bitmap comes from the computer programming terminology, meaning just a map of bits, a spatially mapped array of bits.
..... Click the link for more information.
A digital image is a representation of a two-dimensional image as a finite set of digital values, called picture elements or pixels. The digital image contains a fixed number of rows and columns of pixels.
..... Click the link for more information.
heightmap or heightfield is a raster image used to store values, such as surface elevation data, for display in 3D computer graphics. A heightmap can be used in bump mapping to calculate where this 3D data would create shadow in a material, in displacement mapping to
..... Click the link for more information.
In computer science, a dynamic array, growable array, resizable array, dynamic table, or array list is an array data structure that can be resized and allows elements to be added or removed.
..... Click the link for more information.
In computing, a parallel array is a data structure for representing arrays of records. It keeps a separate, homogeneous array for each field of the record, each having the same number of elements.
..... Click the link for more information.
In computer science, A sparse array is an array for which most of the elements have the same value (called the default value -- usually 0 or null).

A naive implementation may allocate space for the entire array, but this is inefficient since there are only a few non-default
..... Click the link for more information.
In computer programming a matrix is a two dimensional array. An array is a list of data values. A matrix, or two dimensional array is a list of values that cross two axes and would appear, conceptually, as a grid.

A multiplication table could be an example of a matrix.
..... Click the link for more information.
sparse matrix is a matrix populated primarily with zeros.

Conceptually, sparsity corresponds to systems which are loosely coupled. Consider a line of balls connected by springs from one to the next; this is a sparse system.
..... Click the link for more information.
A bitboard is a data structure commonly used in computer systems that play board games.

Definition

A bitboard, often used for boardgames such as chess, checkers and othello, is a type of data structure and bitset, where each bit represents a game position or state,
..... Click the link for more information.
linked list is one of the fundamental data structures, and can be used to implement other data structures. It consists of a sequence of nodes, each containing arbitrary data fields and one or two references ("links") pointing to the next and/or previous nodes.
..... Click the link for more information.
In computer programming, an unrolled linked list is a variation on the linked list which stores multiple elements in each node. It can drastically increase cache performance, while decreasing the memory overhead associated with storing list metadata such as references.
..... Click the link for more information.
XOR linked lists are a curious use of the bitwise exclusive disjunction (XOR) operation, here denoted by ⊕, to decrease storage requirements for doubly-linked lists. An ordinary doubly-linked list stores addresses of the previous and next list items in each list node,
..... Click the link for more information.
Vlist

Flag
Coat of arms

Coordinates:
Country Netherlands
Province South Holland
Area (2006)
 - Municipality 56.
..... Click the link for more information.
line can be described as an ideal zero-width, infinitely long, perfectly straight curve (the term curve in mathematics includes "straight curves") containing an infinite number of points. In Euclidean geometry, exactly one line can be found that passes through any two points.
..... Click the link for more information.
stack is a temporary abstract data type and data structure based on the principle of Last In First Out (LIFO). Stacks are used extensively at every level of a modern computer system.
..... Click the link for more information.
queue (pronounced /kjuː/) is a particular kind of collection in which the entities in the collection are kept in order and the principal (or only) operations on the collection are the addition of entities to the rear terminal position and removal of entities from the front
..... Click the link for more information.
A priority queue is an abstract data type in computer programming, supporting the following three operations:
  • add an element to the queue with an associated priority
  • remove the element from the queue that has the highest priority, and return it

..... Click the link for more information.
deque (short for double-ended queue) is an abstract data structure for which elements can be added to or removed from the front or back. This differs from a normal queue, where elements can only be added to one end and removed from the other.
..... Click the link for more information.
circular buffer or ring buffer is a data structure that uses a single, fixed-size buffer as if it were connected end-to-end. This structure lends itself easily to buffering data streams.
..... Click the link for more information.
An associative array (also map, mapping, hash, dictionary, finite map, lookup table, and in query-processing an index or index file
..... Click the link for more information.
In computer science, a hash table, or a hash map, is a data structure that associates keys with values. The primary operation it supports efficiently is a lookup: given a key (e.g. a person's name), find the corresponding value (e.g. that person's telephone number).
..... Click the link for more information.
In computer science, a self-balancing binary search tree or height-balanced binary search tree is a binary search tree that attempts to keep its height, or the number of levels of nodes beneath the root, as small as possible at all times, automatically.
..... Click the link for more information.
Invented in 1990 by William Pugh, a skip list is a probabilistic data structure, based on parallel linked lists, with efficiency comparable to a binary search tree (order O(log n) average time for most operations).
..... Click the link for more information.
Graph may refer to:
  • A chart, a graphic representing tabular data or functions
  • A graph used in visualising scientific data, representing the relationship between two or more variables
In mathematics:

..... Click the link for more information.
adjacency list is the representation of all edges or arcs in a graph as a list.

If the graph is undirected, every entry is a set of two nodes containing the two ends of the corresponding edge; if it is directed, every entry is a tuple of two nodes, one denoting the source
..... Click the link for more information.
In mathematics and computer science, the adjacency matrix of a finite directed or undirected graph G on n vertices is the n × n matrix where the nondiagonal entry is the number of edges from vertex i to vertex j
..... Click the link for more information.


This article is copied from an article on Wikipedia.org - the free encyclopedia created and edited by online user community. The text was not checked or edited by anyone on our staff. Although the vast majority of the wikipedia encyclopedia articles provide accurate and timely information please do not assume the accuracy of any particular article. This article is distributed under the terms of GNU Free Documentation License.
Herod_Archelaus


page counter