83 relations: Abstract data type, Ada (programming language), ALGOL 60, Algorithm, Aliasing (computing), APL (programming language), Array access analysis, Array data structure, Array programming, Array slicing, Assignment (computer science), Associative array, AWK, Axiom, Bounds checking, Bounds-checking elimination, Byte, C (programming language), C++, COBOL, Comparison of programming languages (array), Compile time, Compiler, Delimiter-separated values, Domain-specific language, Dope vector, Dot product, Dynamic array, Edsger W. Dijkstra, Enumerated type, Exception handling, Floating-point arithmetic, Fortran, GAUSS (software), Hadamard product (matrices), Hash table, Heinz Rutishauser, IDL (programming language), Iliffe vector, Integer (computer science), Interval (mathematics), Jagged array, Julia (programming language), Library (computing), Linear algebra, Linked list, List (abstract data type), Lua (programming language), Mathematics, MATLAB, ..., NumPy, Object-oriented programming, Off-by-one error, Parallel array, Pascal (programming language), Pointer (computer programming), Primitive data type, Programmer, Python (programming language), Rank (computer programming), Rank (linear algebra), Record (computer science), Reference (computer science), Run time (program lifecycle phase), Scripting language, Search data structure, Search tree, Sequence, Sparse matrix, Statement (computer science), String (computer science), String literal, Subroutine, System programming language, Tensor (intrinsic definition), Third-generation programming language, Triangular array, Tuple, Type theory, Variable-length array, Visual Basic .NET, Wolfram Mathematica, Zero-based numbering. Expand index (33 more) » « Shrink index
In computer science, an abstract data type (ADT) is a mathematical model for data types, where a data type is defined by its behavior (semantics) from the point of view of a user of the data, specifically in terms of possible values, possible operations on data of this type, and the behavior of these operations.
Ada is a structured, statically typed, imperative, and object-oriented high-level computer programming language, extended from Pascal and other languages.
ALGOL 60 (short for Algorithmic Language 1960) is a member of the ALGOL family of computer programming languages.
In mathematics and computer science, an algorithm is an unambiguous specification of how to solve a class of problems.
In computing, aliasing describes a situation in which a data location in memory can be accessed through different symbolic names in the program.
APL (named after the book A Programming Language) is a programming language developed in the 1960s by Kenneth E. Iverson.
In computer science, array access analysis is a compiler analysis used to decide the read and write access patterns to elements or portions of arrays.
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.
In computer science, array programming languages (also known as vector or multidimensional languages) generalize operations on scalars to apply transparently to vectors, matrices, and higher-dimensional arrays.
In computer programming, array slicing is an operation that extracts a subset of elements from an array and packages them as another array, possibly in a different dimension from the original.
In computer programming, an assignment statement sets and/or re-sets the value stored in the storage location(s) denoted by a variable name; in other words, it copies a value into the variable.
In computer science, an associative array, map, symbol table, or dictionary is an abstract data type composed of a collection of (key, value) pairs, such that each possible key appears at most once in the collection.
AWK is a programming language designed for text processing and typically used as a data extraction and reporting tool.
An axiom or postulate is a statement that is taken to be true, to serve as a premise or starting point for further reasoning and arguments.
In computer programming, bounds checking is any method of detecting whether a variable is within some bounds before it is used.
In computer science, bounds-checking elimination is a compiler optimization useful in programming languages or runtimes that enforce bounds checking, the practice of checking every index into an array to verify that the index is within the defined valid range of indexes.
The byte is a unit of digital information that most commonly consists of eight bits, representing a binary number.
C (as in the letter ''c'') is a general-purpose, imperative computer programming language, supporting structured programming, lexical variable scope and recursion, while a static type system prevents many unintended operations.
C++ ("see plus plus") is a general-purpose programming language.
COBOL (an acronym for "common business-oriented language") is a compiled English-like computer programming language designed for business use.
Christmas is an annual festival commemorating the birth of Jesus Christ,Martindale, Cyril Charles.
The Christmas season, also called the festive season, or the holiday season (mainly in the U.S. and Canada; often simply called the holidays),, is an annually recurring period recognized in many Western and Western-influenced countries that is generally considered to run from late November to early January.
Christmas Eve is the evening or entire day before Christmas Day, the festival commemorating the birth of Jesus.
Christmas traditions vary from country to country.
This comparison of programming languages (array) compares the features of array data structures or matrix processing for over 48 various computer programming languages.
In computer science, compile time refers to either the operations performed by a compiler (the "compile-time operations"), programming language requirements that must be met by source code for it to be successfully compiled (the "compile-time requirements"), or properties of the program that can be reasoned about during compilation.
A compiler is computer software that transforms computer code written in one programming language (the source language) into another programming language (the target language).
Formats that use delimiter-separated values (also DSV)DSV stands for Delimiter Separated Values store two-dimensional arrays of data by separating the values in each row with specific delimiter characters.
A domain-specific language (DSL) is a computer language specialized to a particular application domain.
In computer programming, a dope vector is a data structure used to hold information about a data object,, especially its memory layout.
In mathematics, the dot product or scalar productThe term scalar product is often also used more generally to mean a symmetric bilinear form, for example for a pseudo-Euclidean space.
In computer science, a dynamic array, growable array, resizable array, dynamic table, mutable array, or array list is a random access, variable-size list data structure that allows elements to be added or removed.
Edsger Wybe Dijkstra (11 May 1930 – 6 August 2002) was a Dutch systems scientist, programmer, software engineer, science essayist, and early pioneer in computing science.
In computer programming, an enumerated type (also called enumeration, enum, or factor in the R programming language, and a categorical variable in statistics) is a data type consisting of a set of named values called elements, members, enumeral, or enumerators of the type.
Exception handling is the process of responding to the occurrence, during computation, of exceptions – anomalous or exceptional conditions requiring special processing – often changing the normal flow of program execution.
In computing, floating-point arithmetic is arithmetic using formulaic representation of real numbers as an approximation so as to support a trade-off between range and precision.
Fortran (formerly FORTRAN, derived from Formula Translation) is a general-purpose, compiled imperative programming language that is especially suited to numeric computation and scientific computing.
GAUSS is a matrix programming language for mathematics and statistics, developed and marketed by Aptech Systems.
In mathematics, the Hadamard product (also known as the Schur product or the entrywise product) is a binary operation that takes two matrices of the same dimensions, and produces another matrix where each element i,j is the product of elements i,j of the original two matrices.
In computing, a hash table (hash map) is a data structure that implements an associative array abstract data type, a structure that can map keys to values.
Heinz Rutishauser (30 January 1918 – 10 November 1970) was a Swiss mathematician and a pioneer of modern numerical mathematics and computer science.
IDL, short for Interactive Data Language, is a programming language used for data analysis.
In computer programming, an Iliffe vector, also known as a display, is a data structure used to implement multi-dimensional arrays.
In computer science, an integer is a datum of integral data type, a data type that represents some range of mathematical integers.
In mathematics, a (real) interval is a set of real numbers with the property that any number that lies between two numbers in the set is also included in the set.
In computer science, a ragged array, also known as a jagged array, is an array of arrays of which the member arrays can be of different sizes and producing rows of jagged edges when visualized as output.
Julia is a high-level dynamic programming language designed to address the needs of high-performance numerical analysis and computational science, without the typical need of separate compilation to be fast, while also being effective for general-purpose programming, web use or as a specification language.
In computer science, a library is a collection of non-volatile resources used by computer programs, often for software development.
Linear algebra is the branch of mathematics concerning linear equations such as linear functions such as and their representations through matrices and vector spaces.
In computer science, a linked list is a linear collection of data elements, whose order is not given by their physical placement in memory.
In computer science, a list or sequence is an abstract data type that represents a countable number of ordered values, where the same value may occur more than once.
Lua (from meaning moon) is a lightweight, multi-paradigm programming language designed primarily for embedded use in applications.
Mathematics (from Greek μάθημα máthēma, "knowledge, study, learning") is the study of such topics as quantity, structure, space, and change.
MATLAB (matrix laboratory) is a multi-paradigm numerical computing environment and proprietary programming language developed by MathWorks.
New Year is the time or day at which a new calendar year begins and the calendar's year count increments by one.
New Year's Day, also called simply New Year's or New Year, is observed on January 1, the first day of the year on the modern Gregorian calendar as well as the Julian calendar.
In the Gregorian calendar, New Year's Eve (also known as Old Year's Day or Saint Sylvester's Day in many countries), the last day of the year, is on 31 December which is the seventh day of Christmastide.
NumPy (pronounced or sometimes) is a library for the Python programming language, adding support for large, multi-dimensional arrays and matrices, along with a large collection of high-level mathematical functions to operate on these arrays.
Object-oriented programming (OOP) is a programming paradigm based on the concept of "objects", which may contain data, in the form of fields, often known as attributes; and code, in the form of procedures, often known as methods. A feature of objects is that an object's procedures can access and often modify the data fields of the object with which they are associated (objects have a notion of "this" or "self").
An off-by-one error (OBOE), also commonly known as an OBOB (off-by-one bug), or OB1 error is a logic error involving the discrete equivalent of a boundary condition.
In computing, a group of parallel arrays (also known as structure of arrays or SoA) is a form of implicit data structure that uses multiple arrays to represent a singular array of records.
Pascal is an imperative and procedural programming language, which Niklaus Wirth designed in 1968–69 and published in 1970, as a small, efficient language intended to encourage good programming practices using structured programming and data structuring. It is named in honor of the French mathematician, philosopher and physicist Blaise Pascal. Pascal was developed on the pattern of the ALGOL 60 language. Wirth had already developed several improvements to this language as part of the ALGOL X proposals, but these were not accepted and Pascal was developed separately and released in 1970. A derivative known as Object Pascal designed for object-oriented programming was developed in 1985; this was used by Apple Computer and Borland in the late 1980s and later developed into Delphi on the Microsoft Windows platform. Extensions to the Pascal concepts led to the Pascal-like languages Modula-2 and Oberon.
In computer science, a pointer is a programming language object that stores the memory address of another value located in computer memory.
In computer science, primitive data type is either of the following.
A programmer, developer, dev, coder, or software engineer is a person who creates computer software.
Python is an interpreted high-level programming language for general-purpose programming.
In computer programming, rank with no further specifications is usually a synonym for (or refers to) "number of dimensions"; thus, a two-dimensional array has rank two, a three-dimensional array has rank three and so on.
In linear algebra, the rank of a matrix A is the dimension of the vector space generated (or spanned) by its columns.
In computer science, a record (also called a structure, struct, or compound data) is a basic data structure.
In computer science, a reference is a value that enables a program to indirectly access a particular datum, such as a variable's value or a record, in the computer's memory or in some other storage device.
In computer science, run time, runtime or execution time is the time during which a program is running (executing), in contrast to other program lifecycle phases such as compile time, link time and load time.
A scripting or script language is a programming language that supports scripts: programs written for a special run-time environment that automate the execution of tasks that could alternatively be executed one-by-one by a human operator.
In computer science, a search data structure is any data structure that allows the efficient retrieval of specific items from a set of items, such as a specific record from a database.
In computer science, a search tree is a tree data structure used for locating specific keys from within a set.
In mathematics, a sequence is an enumerated collection of objects in which repetitions are allowed.
In numerical analysis and computer science, a sparse matrix or sparse array is a matrix in which most of the elements are zero.
In computer programming, a statement is a syntactic unit of an imperative programming language that expresses some action to be carried out.
In computer programming, a string is traditionally a sequence of characters, either as a literal constant or as some kind of variable.
A string literal or anonymous string is a type of literal in programming for the representation of a string value within the source code of a computer program.
In computer programming, a subroutine is a sequence of program instructions that performs a specific task, packaged as a unit.
A system programming language usually refers to a programming language used for system programming; such languages are designed for writing system software, which usually requires different development approaches when compared with application software.
In mathematics, the modern component-free approach to the theory of a tensor views a tensor as an abstract object, expressing some definite type of multi-linear concept.
A third-generation programming language (3GL) is a generational way to categorize high-level computer programming languages.
In mathematics and computing, a triangular array of numbers, polynomials, or the like, is a doubly indexed sequence in which each row is only as long as the row's own index.
In mathematics, a tuple is a finite ordered list (sequence) of elements.
In mathematics, logic, and computer science, a type theory is any of a class of formal systems, some of which can serve as alternatives to set theory as a foundation for all mathematics.
In computer programming, a variable-length array (VLA), also called variable-sized, runtime-sized, is an array data structure whose length is determined at run time (instead of at compile time).
Visual Basic.NET (VB.NET) is a multi-paradigm, object-oriented programming language, implemented on the.NET Framework.
Wolfram Mathematica (usually termed Mathematica) is a modern technical computing system spanning most areas of technical computing — including neural networks, machine learning, image processing, geometry, data science, visualizations, and others.
Zero-based numbering or index origin.
2018 has been designated as the third International Year of the Reef by the International Coral Reef Initiative.
2019 (MMXIX) will be a common year starting on Tuesday of the Gregorian calendar, the 2019th year of the Common Era (CE) and Anno Domini (AD) designations, the 19th year of the 3rd millennium, the 19th year of the 21st century, and the 10th and last year of the 2010s decade.
0-based array, 1-based array, Array (data type), Higher-dimensional array, Multi-dimensional Indexing, Multi-dimensional array, Multidimensional array, One-based array, One-based indexing, Zero-based array.