Module 1 Flashcards
is representation of the logical
relationship existing between individual elements
of data.
Data structure
is a way of
organizing all data items that considers not only
the elements stored but also their relationship to
each other.
data structure
affects the design of both
structural & functional aspects of a program.
Data structure
is a step by step
procedure to solve a particular function.
algorithm
is a set of instruction written
to carry out certain tasks & the data structure is the
way of organizing the data with their logical
relationship retained.
algorithm
Data structures are normally
divided into two broad categories:
- Primitive Data Structure
* Non-Primitive Data Structure
Integer, Floating-point number, Character
constants, string constants, pointers etc, fall in
this category.
Primitive Data Structure
These are basic structures and directly operated
upon by the machine instructions.
Primitive Data Structure
These are more sophisticated data structures.
Non-Primitive Data Structure
emphasize on
structuring of a group of homogeneous (same
type) or heterogeneous (different type) data items.
non-primitive data structures
2 types of non-primitive data structures
linear list
non-linear list
in X data structure, values are arrange in
linear fashion.
linear data structure
linear list
an ordered list that have a fixed-size
array
an ordered list that have variable-size
linked-list
an ordered list that adds to the top and removes from the top
stack
an ordered list that adds to the back and removes from the front
queue
add anywhere, remove the highest priority linear data structure
priority queue
The data values in this structure are not
arranged in order.
non-linear list (data structure)
unordered lists which use a hash function to insert and search
hash table
an unordered list where data is organized in branches
tree
an unordered list where there is a more general branching structure witch less strict connection conditions than for a tree
graph
types of data structures
homogenous, non-homogenous
In this type of data structure,
values of the same types of data are stored.
Homogenous:
In this type of data structure,
data values of different types are grouped and
stored.
Non-Homogenous:
structures and classes are examples of a X data structure
non-homogenous
The choice of particular data model depends on
two consideration:
rich enough, simple enough
data type that separates
the logical properties from the implementation
details
Abstract data type (ADT):
•Separating design details from usage
•Separating the logical properties from the
implementation details
Abstraction
stores data and allow
various operations on the data to access and
change it.
Abstract Data Types (ADTs)
A mathematical model, together with various
operations defined on the X
model
is a collection of data and associated
operations for manipulating that data
Abstract Data Types (ADTs)
support abstraction, encapsulation,
and information hiding
Abstract Data Types (ADTs)
is providing only essential
information outside the world
Abstraction
is binding the data, and the
functions that use them
Encapsulation
