Category:Data structures
Bước tới điều hướng
Bước tới tìm kiếm
particular way of storing and organizing data in a computer | |||||
| Tải lên phương tiện | |||||
| Là tập hợp con của | |||||
|---|---|---|---|---|---|
| Một phần của | |||||
| Khác với | |||||
| |||||
 | |||||
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.
Thể loại con
Thể loại này có 24 thể loại con sau, trên tổng số 24 thể loại con.
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)
Tập tin trong thể loại “Data structures”
141 tập tin sau nằm trong thể loại này, trong tổng số 141 tập tin.
-
1-dimensional-range-query.svg 261×201; 21 kB
-
2-3 strom - odebrani prvku.GIF 237×299; 5 kB
-
20050127 Master 19.jpg 741×644; 226 kB
-
600px-Random vs sequential access-ar.png 938×562; 72 kB
-
Accesso Sequenziale VS Accesso Casuale-es.svg 600×360; 41 kB
-
Accesso Sequenziale VS Accesso Casuale.svg 600×360; 41 kB
-
ADT unfold - upFrom.png 275×106; 8 kB
-
Albero con lista.png 473×523; 26 kB
-
Arbre binaire bravo.png 647×317; 13 kB
-
Array construction efficiency.png 3.300×2.550; 563 kB
-
Arvore vp.png 1.019×505; 36 kB
-
Associative array as linked list.svg 688×261; 7 kB
-
Assosiaatiotaulu.svg 700×271; 8 kB
-
BadSplitGoodSplit.svg 512×384; 14 kB
-
Bag-data-structure.png 1.467×868; 49 kB
-
Baum Begriffe.svg 600×350; 1 kB
-
BDD2pdag simple.png 256×274; 11 kB
-
BDD2pdag.png 445×454; 25 kB
-
Beapกราฟ.png 409×279; 20 kB
-
Beapข้อมูล.png 534×317; 35 kB
-
Beapลบ.png 403×290; 27 kB
-
Beapลบข้อมูล.png 423×353; 33 kB
-
Bin computational geometry.png 816×1.056; 17 kB
-
BinaryTree.png 1.197×507; 69 kB
-
BITDemo.gif 1.052×744; 262 kB
-
Bitonicstep1.png 444×310; 8 kB
-
Bitonicstep2.png 539×334; 17 kB
-
Bitonicstep3.png 761×337; 26 kB
-
Blackboard-simple.svg 322×254; 11 kB
-
BRIN index.svg 1.110×71; 11 kB
-
Buffer overflow basicexample.svg 502×253; 34 kB
-
BulkDeletionPQ.svg 386×181; 50 kB
-
Canid struct.jpg 1.030×763; 104 kB
-
Clase Estado.png 287×162; 5 kB
-
Cll.png 194×212; 8 kB
-
ColaProg.JPG 720×540; 32 kB
-
Combinatorial map dual example.svg 216×207; 11 kB
-
Connected Components.png 353×97; 10 kB
-
Consistent Hashing Sample Illustration.png 611×455; 34 kB
-
Control table.png 289×270; 17 kB
-
Conventional ETL Diagram.jpg 1.021×631; 90 kB
-
CPT list snakes.svg 320×183; 23 kB
-
Dag f(a,g(b,b)).jpg 107×107; 5 kB
-
Data icon coloured.svg 512×512; 2 kB
-
Data icon.svg 512×512; 1 kB
-
Data Structures.pdf 1.239 × 1.752, 161 trang; 4,17 MB
-
Dcel-components.svg 957×765; 69 kB
-
Dcel-halfedge-connectivity es.svg 447×347; 12 kB
-
Dcel-halfedge-connectivity.svg 447×347; 13 kB
-
Dcel-nexts.svg 508×574; 20 kB
-
Dinamicos.jpg 483×702; 45 kB
-
Doubling Algorithmus Beispiel.JPG 708×892; 78 kB
-
Dsa bin search run time.png 243×167; 2 kB
-
Dsa bin search.png 744×264; 9 kB
-
Dsa bin search.svg 723×257; 31 kB
-
Dsa k way merge problem lists.png 274×193; 5 kB
-
Dsa k way merge problem lists.svg 201×195; 14 kB
-
Dsa lin search run time.png 243×167; 3 kB
-
DSA O intuition.png 231×167; 4 kB
-
Dsu disjoint sets final.svg 440×40; 7 kB
-
Dsu disjoint sets init.svg 440×40; 10 kB
-
DSW example.png 680×250; 35 kB
-
ELT Diagram.png 1.366×728; 52 kB
-
Example of bounding volume hierarchy.svg 534×167; 25 kB
-
Exemple mini.jpg 491×530; 53 kB
-
Exemple mini.png 491×530; 128 kB
-
Exemple3.jpg 650×700; 77 kB
-
Gbf.gif 525×350; 15 kB
-
Height Balanced Binary Tree.pdf 1.275 × 1.650, 22 trang; 105 kB
-
Illustration checksum 1.png 611×116; 2 kB
-
Implementacija polja.jpg 481×374; 21 kB
-
IndependentSetRemovalAlgorithmusBeispiel.jpeg 372×863; 53 kB
-
Invertierte Seitentabellen de.svg 815×493; 31 kB
-
K-d heap 2 keys.png 3.473×2.010; 91 kB
-
Kinetic tournament overview.png 392×625; 69 kB
-
Loop f(a,g(b,g)).png 198×154; 4 kB
-
Matrice3righe 4colonn indici.png 378×265; 5 kB
-
Matrice3righe 4colonne allocazione in RAM.png 680×680; 30 kB
-
Matrice3righe 4colonne valori.png 378×265; 4 kB
-
Matrice4righe 4colonne diagonali1.png 454×454; 11 kB
-
Matrice4righe 4colonne diagonali2.png 454×454; 14 kB
-
MatrixIndexingMainOffDiagonal.png 440×350; 11 kB
-
-
Mihai Patrascu.jpg 1.728×1.944; 809 kB
-
Moon-modeler-diagram-mongodb.png 1.250×649; 478 kB
-
OLAPcube.png 1.744×779; 546 kB
-
P1 list.PNG 726×150; 6 kB
-
Plex Di Ross.jpg 1.871×1.757; 2,01 MB
-
Polymorphic Data Structures in C.png 1.650×2.550; 135 kB
-
Polymorphic Data Structures in C.xcf 1.650×2.550; 210 kB
-
PopBack.svg 670×165; 11 kB
-
Presentation TS.svg 512×55; 7 kB
-
Pseudonymisering.png 2.076×2.288; 54 kB
-
PushBack.svg 670×170; 10 kB
-
Python 3. The standard type hierarchy.png 794×1.123; 157 kB
-
RadixHeap1.png 480×240; 6 kB
-
Random vs sequential access fr.svg 600×360; 41 kB
-
Random vs sequential access.svg 600×360; 11 kB
-
Recursive slowdown, a counter representing 46.svg 175×35; 5 kB
-
Recursive slowdown, counting up to 16.svg 348×613; 51 kB
-
Report-header.jpg 571×123; 10 kB
-
Rope mengyao.jpg 565×352; 27 kB
-
Shadow Tree Screen Shot by Chenghao Qian.png 1.112×1.040; 199 kB
-
Simple & Easy by Erich Spencer.pdf 1.275×1.650; 116 kB
-
Structure de données EPROCESS.png 714×278; 45 kB
-
Table symboles portee.svg 512×206; 21 kB
-
Tablica asocjacyjna.svg 700×271; 8 kB
-
-
TID Ueberlauf mit genuegend Platz.gif 322×207; 4 kB
-
TID Ueberlauf mit genug Platz.gif 263×192; 3 kB
-
TID Ueberlauf.gif 266×193; 3 kB
-
Trie example with keys 07 and 42.svg 673×429; 36 kB
-
Trie node with bitmap example.svg 1.069×371; 49 kB
-
Union find example.png 370×768; 40 kB
-
-
Visual glossary of C2PA metadata.png 1.542×1.024; 210 kB
-
Wavl tree.png 938×647; 45 kB
-
WikiCite 2020 - Enrichissement automatique des données bibliographiques.pdf 1.497 × 1.122, 27 trang; 2,18 MB
-
Wikiversity-Algorithmen und Datenstrukturen-Blatt01.pdf 1.239 × 1.752, 5 trang; 150 kB
-
Wikiversity-Algorithmen und Datenstrukturen-Blatt06.pdf 1.239 × 1.752, 6 trang; 161 kB
-
Wikiversity-Algorithmen und Datenstrukturen-Blatt07.pdf 1.239 × 1.752, 7 trang; 274 kB
-
Winged edge.png 2.113×2.094; 54 kB
-
Xsd entity-relationship model.png 3.105×2.382; 234 kB
-
Árvore B.png 579×255; 7 kB
-
Árvore preta e vermelha.png 337×270; 4 kB
-
Двусвязный список.png 859×472; 22 kB
-
Односвязный список.png 697×385; 14 kB
-
Произвольный случайный доступ-ru.svg 600×360; 41 kB
-
حالت پایه درخت هافمن.png 363×312; 11 kB
-
การค้นหา.png 609×271; 11 kB
-
การลบข้อแบบที่สอง.png 831×484; 39 kB
-
การลบข้อแบบที่สาม.png 809×488; 37 kB
-
การลบข้อแบบที่สี่.png 844×456; 38 kB
-
การลบข้อแบบที่ห้า.png 865×456; 38 kB
-
การลบข้อแบบแรก.png 840×483; 38 kB
-
การเพิ่ม1.png 830×473; 33 kB
-
การเพิ่ม2.png 853×473; 30 kB
-
ตัวอย่าง.png 789×416; 19 kB
-
ตัวอย่างค่าที่น้อยที่ช่วงกำหนด.png 651×406; 17 kB
-
ตัวอย่างต้นไม้นิพจน์.jpg 663×258; 21 kB
-
ตัวอย่างผลรวมที่ช่วงกำหนด.png 640×388; 17 kB
).jpg)
).png)
_method_for_STL_containers.svg){kind=small}
