Data Structures Flashcards
is defined as “a finite sequence of instructions, each of which has a clear meaning and can be performed with a finite amount of effort in a finite length of time”.
algorithm
an algorithm must be precise enough to be understood by human beings.
(True or False)
T
Ways to formulate an efficient algorithm: (3)
data structure
abstract data types
design patterns
is used to denote a particular way of organizing data for particular types of operation.
data structure
formulating abstract mathematical models of particular classes of data structures or data types which have common features
abstract data types
numerous _______ ranging from familiar arrays and lists to more complex structures such as trees, heaps and graphs.
data structures
defined only by the operations that may be performed on ( primitive data types e.g. integers or strings), how to extract data and basic control flow
abstract data types
describe the design of algorithms, rather the design of data structures.
design patterns
embody and generalize important design concepts that appear repeatedly in many problem contexts (speed up the development of algorithms by providing familiar proven algorithm structures that can be applied straightforwardly to new problems)
design patterns
ultimately stored in computers as patterns of bits, though these days most programming languages deal with higher level objects, such as characters, integers, and floating point
numbers.
Data
Generally, we need to build algorithms that manipulate collections of such objects, so we need _______ for storing and sequentially processing them.
procedures
is a specialized format for organizing, processing, retrieving and storing data.
data structure
make it easy for users to access and work with the data they need in appropriate ways.
data structure
frame the organization of information so that machines and humans can better understand it.
data structure
