This HTML5 document contains 134 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
n12http://dbpedia.org/resource/File:
foafhttp://xmlns.com/foaf/0.1/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
n7http://commons.wikimedia.org/wiki/Special:FilePath/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
n11http://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
dbchttp://dbpedia.org/resource/Category:
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/
n9http://d-nb.info/gnd/

Statements

Subject Item
dbr:Array_data_structure
rdf:type
dbo:Building owl:Thing
rdfs:label
Array data structure
rdfs:comment
In computer science, an array data structure, or simply an array, is a data structure consisting of a collection of elements (values or variables), each identified by at least one array index or key. An array is stored such that the position of each element can be computed from its index tuple by a mathematical formula. The simplest type of data structure is a linear array, also called one-dimensional array. The memory address of the first element of an array is called first address, foundation address, or base address.
owl:sameAs
n9:4376624-9 freebase:m.0wcx yago-res:Array_data_structure
dbp:wikiPageUsesTemplate
dbt:More_citations_needed dbt:Portal dbt:List_data_structure_comparison dbt:Div_col dbt:Div_col_end dbt:Wiktionary dbt:Commons_category dbt:Wikibooks-inline dbt:Reflist dbt:About dbt:Main dbt:Short_description dbt:Data_structures dbt:Use_dmy_dates dbt:Authority_control dbt:Parallel_computing
dct:subject
dbc:Arrays
dbo:thumbnail
n7:Row_and_column_major_order.svg?width=300
foaf:depiction
n7:Array_of_array_storage.svg n7:Row_and_column_major_order.svg
gold:hypernym
dbr:Structure
prov:wasDerivedFrom
n11:Array_data_structure?oldid=1070971838&ns=0
dbo:wikiPageID
2052
dbo:wikiPageLength
24801
dbo:wikiPageRevisionID
1070971838
dbo:wikiPageWikiLink
dbr:Abstract_data_type dbr:Array_data_type dbr:32-bit_computing dbr:Heap_(data_structure) dbr:Subroutine dbr:Locality_of_reference dbr:Record_(computer_science) dbr:Array_slicing dbr:Coordinate_vector dbr:Algorithm dbr:Scalar_processor dbr:Bit_array dbr:Tuple dbr:Handle_(computing) dbr:Associative_array dbr:Java_(programming_language) dbr:Row-_and_column-major_order dbr:Variable-length_array dbr:Table_(information) dbr:Merge_sort dbr:Overhead_(computing) dbr:Octet_(computing) dbr:External_storage dbr:Double-ended_queue dbr:Word_(computer_architecture) dbr:Zero-based_numbering dbr:Memory_management dbr:Implicit_data_structure dbr:Statement_(computer_science) dbr:Queue_(abstract_data_type) dbr:Variable_(computer_science) n12:Row_and_column_major_order.svg dbr:Runtime_(program_lifecycle_phase) dbr:Offset_(computer_science) dbr:Addressing_mode dbr:Stack_(abstract_data_type) dbr:Control_table dbr:Bitwise_operation dbr:COBOL dbr:Stride_of_an_array dbr:C++ dbr:Dope_vector dbr:ALGOL dbr:Big_O_notation dbr:Radix_tree dbr:Vector_processor dbr:C_(programming_language) dbr:Search_tree dbr:Data_structure dbr:Lisp_(programming_language) dbr:Switch_statement dbr:High-level_programming_language dbr:Central_processing_unit dbr:Matrix_(mathematics) dbr:Triangular_array dbr:Virtual_memory dbr:Linked_list dbr:Theoretical_computer_science dbr:Vector_space dbr:Character_(computing) dbr:Control_flow dbr:Sorted_array dbr:Burroughs_large_systems n12:Array_of_array_storage.svg dbr:Perfect_hash_function dbr:String_(computer_science) dbr:Enumerated_type dbr:Fortran dbr:EDVAC dbr:Hash_function dbc:Arrays dbr:Jagged_array dbr:Self-modifying_code dbr:CPU_cache dbr:Fragmentation_(computing) dbr:Judy_array dbr:Data_type dbr:Hash_table dbr:Lookup_table dbr:Reference_(computer_science) dbr:Memory_pool dbr:Rank_(computer_programming) dbr:Integer dbr:Computer_science dbr:Data_parallelism dbr:Memory_segmentation dbr:Self-balancing_binary_search_tree dbr:List_(abstract_data_type) dbr:Iliffe_vector dbr:Dynamic_array dbr:Van_Emde_Boas_tree dbr:Parallel_array dbr:John_von_Neumann dbr:Pointer_(computer_programming) dbr:Value_(computer_science) dbr:C_string_handling dbr:Time_complexity dbr:Database dbr:Index_register dbr:Hexadecimal
dbo:abstract
In computer science, an array data structure, or simply an array, is a data structure consisting of a collection of elements (values or variables), each identified by at least one array index or key. An array is stored such that the position of each element can be computed from its index tuple by a mathematical formula. The simplest type of data structure is a linear array, also called one-dimensional array. For example, an array of 10 32-bit (4-byte) integer variables, with indices 0 through 9, may be stored as 10 words at memory addresses 2000, 2004, 2008, ..., 2036, (in hexadecimal: 0x7D0, 0x7D4, 0x7D8, ..., 0x7F4) so that the element with index i has the address 2000 + (i × 4). The memory address of the first element of an array is called first address, foundation address, or base address. Because the mathematical concept of a matrix can be represented as a two-dimensional grid, two-dimensional arrays are also sometimes called matrices. In some cases the term "vector" is used in computing to refer to an array, although tuples rather than vectors are the more mathematically correct equivalent. Tables are often implemented in the form of arrays, especially lookup tables; the word table is sometimes used as a synonym of array. Arrays are among the oldest and most important data structures, and are used by almost every program. They are also used to implement many other data structures, such as lists and strings. They effectively exploit the addressing logic of computers. In most modern computers and many external storage devices, the memory is a one-dimensional array of words, whose indices are their addresses. Processors, especially vector processors, are often optimized for array operations. Arrays are useful mostly because the element indices can be computed at run time. Among other things, this feature allows a single iterative statement to process arbitrarily many elements of an array. For that reason, the elements of an array data structure are required to have the same size and should use the same data representation. The set of valid index tuples and the addresses of the elements (and hence the element addressing formula) are usually, but not always, fixed while the array is in use. The term array is often used to mean array data type, a kind of data type provided by most high-level programming languages that consists of a collection of values or variables that can be selected by one or more indices computed at run-time. Array types are often implemented by array structures; however, in some languages they may be implemented by hash tables, linked lists, search trees, or other data structures. The term is also used, especially in the description of algorithms, to mean associative array or "abstract array", a theoretical computer science model (an abstract data type or ADT) intended to capture the essential properties of arrays.
foaf:isPrimaryTopicOf
n11:Array_data_structure