Concrete Data Structure - Definition. Was ist Concrete Data Structure
Diclib.com
Wörterbuch ChatGPT
Geben Sie ein Wort oder eine Phrase in einer beliebigen Sprache ein 👆
Sprache:

Übersetzung und Analyse von Wörtern durch künstliche Intelligenz ChatGPT

Auf dieser Seite erhalten Sie eine detaillierte Analyse eines Wortes oder einer Phrase mithilfe der besten heute verfügbaren Technologie der künstlichen Intelligenz:

  • wie das Wort verwendet wird
  • Häufigkeit der Nutzung
  • es wird häufiger in mündlicher oder schriftlicher Rede verwendet
  • Wortübersetzungsoptionen
  • Anwendungsbeispiele (mehrere Phrasen mit Übersetzung)
  • Etymologie

Was (wer) ist Concrete Data Structure - definition

DATA STRUCTURE IN COMPUTER SCIENCE
Succint data structure

Concrete Data Structure      
(CDS) A model of programming language terms developed in the context of constructing fully abstract semantics for sequential languages. A CDS is a 4-tuple (C,V,E,|-) where C is a cell, V is a value, E is an event and |- is an "enabling relation". An event is a cell and a value. A cell C is "enabled" by a set of events S if S |- C. A state is a set of events which are consistent in that the values they give for any cell are all equal. Every cell in a state is enabled. [G. Berry, P.-L. Curien, "Theory and practice of sequential algorithms: the kernel of applicative language CDS", Algebraic methods in semantics, CUP 1985]. (1994-11-30)
Implicit data structure         
DATA STRUCTURE THAT STORES VERY LITTLE INFORMATION OTHER THAN THE MAIN OR REQUIRED DATA
Implicit Data Structure
In computer science, an implicit data structure or space-efficient data structure is a data structure that stores very little information other than the main or required data: a data structure that requires low overhead. They are called "implicit" because the position of the elements carries meaning and relationship between elements; this is contrasted with the use of pointers to give an explicit relationship between elements.
data structure         
  •  Python 3]].
PARTICULAR WAY OF STORING AND ORGANIZING DATA IN A COMPUTER
Data structures; Data Structures; Composite data structure; Structure (CS); Structure (computer science); Active data structure; Pattern Oriented Rule Implementation; Pattern oriented Rule Implementation; PORI; Data Structure; Datastructure; Data structure augmentation; Augmenting Data Structures; Linear and nonlinear data structure; Types of data structures; Types of Data Structures; Static and dynamic data structures; Construct (information technology)
<data, programming> Any method of organising a collection of data to allow it to be manipulated effectively. It may include meta data to describe the properties of the structure. Examples data structures are: array, dictionary, graph, hash, heap, linked list, matrix, object, queue, ring, stack, tree, vector. (2003-09-11)

Wikipedia

Succinct data structure

In computer science, a succinct data structure is a data structure which uses an amount of space that is "close" to the information-theoretic lower bound, but (unlike other compressed representations) still allows for efficient query operations. The concept was originally introduced by Jacobson to encode bit vectors, (unlabeled) trees, and planar graphs. Unlike general lossless data compression algorithms, succinct data structures retain the ability to use them in-place, without decompressing them first. A related notion is that of a compressed data structure, in which the size of the data structure depends upon the particular data being represented.

Suppose that Z {\displaystyle Z} is the information-theoretical optimal number of bits needed to store some data. A representation of this data is called:

  • implicit if it takes Z + O ( 1 ) {\displaystyle Z+O(1)} bits of space,
  • succinct if it takes Z + o ( Z ) {\displaystyle Z+o(Z)} bits of space, and
  • compact if it takes O ( Z ) {\displaystyle O(Z)} bits of space.

For example, a data structure that uses 2 Z {\displaystyle 2Z} bits of storage is compact, Z + Z {\displaystyle Z+{\sqrt {Z}}} bits is succinct, Z + lg Z {\displaystyle Z+\lg Z} bits is also succinct, and Z + 3 {\displaystyle Z+3} bits is implicit.

Implicit structures are thus usually reduced to storing information using some permutation of the input data; the most well-known example of this is the heap.