Category:Data structures
Pereiti į navigaciją
Jump to search
particular way of storing and organizing data in a computer | |||||
| Įkelti mediją | |||||
| Poklasis | |||||
|---|---|---|---|---|---|
| Yra dalis | |||||
| Skiriasi nuo | |||||
| |||||
 | |||||
A data structure in computer science is a way of storing data in a computer so that it can be used efficiently. It is an organization of mathematical and logical concepts of data.
Subkategorijos
Rodomos 24 subkategorijos (iš viso yra 24 subkategorijos).
A
- Adjacency list (19 F)
B
- Binary decision diagrams (1 P, 29 F)
C
- Circular buffers (26 F)
F
G
H
I
J
- Judy array (4 F)
L
M
P
Q
R
S
- Data Structure Diagrams (71 F)
T
V
- Videos of data structures (4 F)
Daugialypės terpės rinkmenos kategorijoje „Data structures“
Šioje kategorijoje yra viena rinkmena.
-
1-dimensional-range-query.svg 261 × 201; 21 KiB
-
2-3 strom - odebrani prvku.GIF 237 × 299; 5 KiB
-
20050127 Master 19.jpg 741 × 644; 226 KiB
-
600px-Random vs sequential access-ar.png 938 × 562; 72 KiB
-
Accesso Sequenziale VS Accesso Casuale-es.svg 600 × 360; 41 KiB
-
Accesso Sequenziale VS Accesso Casuale.svg 600 × 360; 41 KiB
-
ADT unfold - upFrom.png 275 × 106; 8 KiB
-
Albero con lista.png 473 × 523; 26 KiB
-
Arbre binaire bravo.png 647 × 317; 13 KiB
-
Array construction efficiency.png 3 300 × 2 550; 563 KiB
-
Arvore vp.png 1 019 × 505; 36 KiB
-
Associative array as linked list.svg 688 × 261; 7 KiB
-
Assosiaatiotaulu.svg 700 × 271; 8 KiB
-
BadSplitGoodSplit.svg 512 × 384; 14 KiB
-
Bag-data-structure.png 1 467 × 868; 49 KiB
-
Baum Begriffe.svg 600 × 350; 1 KiB
-
BDD2pdag simple.png 256 × 274; 11 KiB
-
BDD2pdag.png 445 × 454; 25 KiB
-
Beapกราฟ.png 409 × 279; 20 KiB
-
Beapข้อมูล.png 534 × 317; 35 KiB
-
Beapลบ.png 403 × 290; 27 KiB
-
Beapลบข้อมูล.png 423 × 353; 33 KiB
-
Bin computational geometry.png 816 × 1 056; 17 KiB
-
BinaryTree.png 1 197 × 507; 69 KiB
-
BITDemo.gif 1 052 × 744; 262 KiB
-
Bitonicstep1.png 444 × 310; 8 KiB
-
Bitonicstep2.png 539 × 334; 17 KiB
-
Bitonicstep3.png 761 × 337; 26 KiB
-
Blackboard-simple.svg 322 × 254; 11 KiB
-
BRIN index.svg 1 110 × 71; 11 KiB
-
Buffer overflow basicexample.svg 502 × 253; 34 KiB
-
BulkDeletionPQ.svg 386 × 181; 50 KiB
-
Canid struct.jpg 1 030 × 763; 104 KiB
-
Clase Estado.png 287 × 162; 5 KiB
-
Cll.png 194 × 212; 8 KiB
-
ColaProg.JPG 720 × 540; 32 KiB
-
Combinatorial map dual example.svg 216 × 207; 11 KiB
-
Connected Components.png 353 × 97; 10 KiB
-
Consistent Hashing Sample Illustration.png 611 × 455; 34 KiB
-
Control table.png 289 × 270; 17 KiB
-
Conventional ETL Diagram.jpg 1 021 × 631; 90 KiB
-
CPT list snakes.svg 320 × 183; 23 KiB
-
Dag f(a,g(b,b)).jpg 107 × 107; 5 KiB
-
Data icon coloured.svg 512 × 512; 2 KiB
-
Data icon.svg 512 × 512; 1 KiB
-
Data Structures.pdf 1 239 × 1 752, 161 puslapis; 4,17 MiB
-
Dcel-components.svg 957 × 765; 69 KiB
-
Dcel-halfedge-connectivity es.svg 447 × 347; 12 KiB
-
Dcel-halfedge-connectivity.svg 447 × 347; 13 KiB
-
Dcel-nexts.svg 508 × 574; 20 KiB
-
Dinamicos.jpg 483 × 702; 45 KiB
-
Doubling Algorithmus Beispiel.JPG 708 × 892; 78 KiB
-
Dsa bin search run time.png 243 × 167; 2 KiB
-
Dsa bin search.png 744 × 264; 9 KiB
-
Dsa bin search.svg 723 × 257; 31 KiB
-
Dsa k way merge problem lists.png 274 × 193; 5 KiB
-
Dsa k way merge problem lists.svg 201 × 195; 14 KiB
-
Dsa lin search run time.png 243 × 167; 3 KiB
-
DSA O intuition.png 231 × 167; 4 KiB
-
Dsu disjoint sets final.svg 440 × 40; 7 KiB
-
Dsu disjoint sets init.svg 440 × 40; 10 KiB
-
DSW example.png 680 × 250; 35 KiB
-
ELT Diagram.png 1 366 × 728; 52 KiB
-
Example of bounding volume hierarchy.svg 534 × 167; 25 KiB
-
Exemple mini.jpg 491 × 530; 53 KiB
-
Exemple mini.png 491 × 530; 128 KiB
-
Exemple3.jpg 650 × 700; 77 KiB
-
Gbf.gif 525 × 350; 15 KiB
-
Height Balanced Binary Tree.pdf 1 275 × 1 650, 22 puslapiai; 105 KiB
-
Illustration checksum 1.png 611 × 116; 2 KiB
-
Implementacija polja.jpg 481 × 374; 21 KiB
-
IndependentSetRemovalAlgorithmusBeispiel.jpeg 372 × 863; 53 KiB
-
Invertierte Seitentabellen de.svg 815 × 493; 31 KiB
-
K-d heap 2 keys.png 3 473 × 2 010; 91 KiB
-
Kinetic tournament overview.png 392 × 625; 69 KiB
-
Loop f(a,g(b,g)).png 198 × 154; 4 KiB
-
Matrice3righe 4colonn indici.png 378 × 265; 5 KiB
-
Matrice3righe 4colonne allocazione in RAM.png 680 × 680; 30 KiB
-
Matrice3righe 4colonne valori.png 378 × 265; 4 KiB
-
Matrice4righe 4colonne diagonali1.png 454 × 454; 11 KiB
-
Matrice4righe 4colonne diagonali2.png 454 × 454; 14 KiB
-
MatrixIndexingMainOffDiagonal.png 440 × 350; 11 KiB
-
MDDMF - The Multi Dimensional (V4.0) Data Management Framework (A3 Electronic) 20181020.pdf 2 479 × 1 752; 456 KiB
-
Mihai Patrascu.jpg 1 728 × 1 944; 809 KiB
-
Moon-modeler-diagram-mongodb.png 1 250 × 649; 478 KiB
-
OLAPcube.png 1 744 × 779; 546 KiB
-
P1 list.PNG 726 × 150; 6 KiB
-
Plex Di Ross.jpg 1 871 × 1 757; 2,01 MiB
-
Polymorphic Data Structures in C.png 1 650 × 2 550; 135 KiB
-
Polymorphic Data Structures in C.xcf 1 650 × 2 550; 210 KiB
-
PopBack.svg 670 × 165; 11 KiB
-
Presentation TS.svg 512 × 55; 7 KiB
-
Pseudonymisering.png 2 076 × 2 288; 54 KiB
-
PushBack.svg 670 × 170; 10 KiB
-
Python 3. The standard type hierarchy.png 794 × 1 123; 157 KiB
-
RadixHeap1.png 480 × 240; 6 KiB
-
Random vs sequential access fr.svg 600 × 360; 41 KiB
-
Random vs sequential access.svg 600 × 360; 11 KiB
-
Recursive slowdown, a counter representing 46.svg 175 × 35; 5 KiB
-
Recursive slowdown, counting up to 16.svg 348 × 613; 51 KiB
-
Report-header.jpg 571 × 123; 10 KiB
-
Rope mengyao.jpg 565 × 352; 27 KiB
-
Shadow Tree Screen Shot by Chenghao Qian.png 1 112 × 1 040; 199 KiB
-
Simple & Easy by Erich Spencer.pdf 1 275 × 1 650; 116 KiB
-
Structure de données EPROCESS.png 714 × 278; 45 KiB
-
Table symboles portee.svg 512 × 206; 21 KiB
-
Tablica asocjacyjna.svg 700 × 271; 8 KiB
-
The NumPy array data structure and its associated metadata fields.webp 984 × 200; 19 KiB
-
TID Ueberlauf mit genuegend Platz.gif 322 × 207; 4 KiB
-
TID Ueberlauf mit genug Platz.gif 263 × 192; 3 KiB
-
TID Ueberlauf.gif 266 × 193; 3 KiB
-
Trie example with keys 07 and 42.svg 673 × 429; 36 KiB
-
Trie node with bitmap example.svg 1 069 × 371; 49 KiB
-
Union find example.png 370 × 768; 40 KiB
-
Used to illustrate the resize() method for STL containers.svg 600 × 140; 11 KiB
-
Visual glossary of C2PA metadata.png 1 542 × 1 024; 210 KiB
-
Wavl tree.png 938 × 647; 45 KiB
-
WikiCite 2020 - Enrichissement automatique des données bibliographiques.pdf 1 497 × 1 122, 27 puslapiai; 2,18 MiB
-
Wikiversity-Algorithmen und Datenstrukturen-Blatt01.pdf 1 239 × 1 752, 5 puslapiai; 150 KiB
-
Wikiversity-Algorithmen und Datenstrukturen-Blatt06.pdf 1 239 × 1 752, 6 puslapiai; 161 KiB
-
Wikiversity-Algorithmen und Datenstrukturen-Blatt07.pdf 1 239 × 1 752, 7 puslapiai; 274 KiB
-
Winged edge.png 2 113 × 2 094; 54 KiB
-
Xsd entity-relationship model.png 3 105 × 2 382; 234 KiB
-
Árvore B.png 579 × 255; 7 KiB
-
Árvore preta e vermelha.png 337 × 270; 4 KiB
-
Двусвязный список.png 859 × 472; 22 KiB
-
Односвязный список.png 697 × 385; 14 KiB
-
Произвольный случайный доступ-ru.svg 600 × 360; 41 KiB
-
حالت پایه درخت هافمن.png 363 × 312; 11 KiB
-
การค้นหา.png 609 × 271; 11 KiB
-
การลบข้อแบบที่สอง.png 831 × 484; 39 KiB
-
การลบข้อแบบที่สาม.png 809 × 488; 37 KiB
-
การลบข้อแบบที่สี่.png 844 × 456; 38 KiB
-
การลบข้อแบบที่ห้า.png 865 × 456; 38 KiB
-
การลบข้อแบบแรก.png 840 × 483; 38 KiB
-
การเพิ่ม1.png 830 × 473; 33 KiB
-
การเพิ่ม2.png 853 × 473; 30 KiB
-
ตัวอย่าง.png 789 × 416; 19 KiB
-
ตัวอย่างค่าที่น้อยที่ช่วงกำหนด.png 651 × 406; 17 KiB
-
ตัวอย่างต้นไม้นิพจน์.jpg 663 × 258; 21 KiB
-
ตัวอย่างผลรวมที่ช่วงกำหนด.png 640 × 388; 17 KiB
).jpg)
).png)
_method_for_STL_containers.svg){kind=small}
