Data Structure Editor - significado y definición. Qué es Data Structure Editor
Diclib.com
Diccionario ChatGPT
Ingrese una palabra o frase en cualquier idioma 👆
Idioma:

Traducción y análisis de palabras por inteligencia artificial ChatGPT

En esta página puede obtener un análisis detallado de una palabra o frase, producido utilizando la mejor tecnología de inteligencia artificial hasta la fecha:

  • cómo se usa la palabra
  • frecuencia de uso
  • se utiliza con más frecuencia en el habla oral o escrita
  • opciones de traducción
  • ejemplos de uso (varias frases con traducción)
  • etimología

Qué (quién) es Data Structure Editor - definición

DATA STRUCTURE IN COMPUTER SCIENCE
Succint data structure

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)
Passive data structure         
ANOTHER TERM FOR RECORD
Plain Old Data; Plain old data; Plain Old Data Structures; Plain old data structures; Plain old data structure
In computer science and object-oriented programming, a passive data structure (PDS, also termed a plain old data structure, or plain old data, POD) is a term for a record, to contrast with objects. It is a data structure that is represented only as passive collections of field values (instance variables), without using object-oriented features.

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.