INTRODUCTION Flashcards
defines a particular data with the
following characteristics
DATA
refer to the data that a variable can hold in
a programming language.
Data Object
3 CRITERIAS OF DATA OBJECT
ATOMIC
TRACEABLE
ACCURATE
definition should be defined a
single concept
ATOMIC
should be able to
mapped to some data element
TRACEABLE
should be
unambiguous and understandable.
ACCURATE
Specialized format to store and organize data in a computer’s memory or disk
DATA STRUCTURES
Collection of variables, possibly of several different data types connected in various ways.
DATA STRUCTURES
TYPES OF DATA STRUCTURES
ARRAY
LINKED LIST
STACKS
TREES
SORTING
HASH TABLES
BASIC OPERATIONS OF DATA STRUCTURES
TRAVERSING
SEARCHING
INSERTION
DELETION
SORTING
MERGING
All data structures can be classified as
primitive or aggregate
simple kind of data structure stores single data items.
PRIMITIVE
Many data structures are capable of
storing multiple data items.
AGGREGATE
data structures in which data elements are arranged sequentially or linearly,
LINEAR
HAS A FIXED MEMORY SIZE
Static
THE SIZE IS NOT FIXED
DYNAMIC
elements are not placed
sequentially or linearly
NON-LINEAR
The user does not need to know the
implementation of the data structure.
ABSTRACTION
ADT gives us a better
conceptualization of the real world.
BETTER CONCEPTUALIZATION
The program is robust and has the ability to catch errors.
ROBUST
The process of providing only the
essential and hiding the details.
ABSTRACTION
a technique of combining the
data and the member function in a single unit
ENCAPSULATION
must terminate after a finite
number of steps.
FINITENESS
an algorithm should have 0 or more
well-defines inputs.
INPUT
is a step-by-step procedure, which defines a set of instructions to be executed in a certain order to get the desired output.
ALGORITHM
should have step-by-step
directions, which should be independent of any
programming code.
INDEPENDENT
CHARACTERISTICS OF ALGO
FINITENESS
INPUT
INDEPENDENT
FEASIBILITY
OUTPUT
UNAMBIGUOUS
should be feasible with the
available resources.
FEASIBILITY
Should have 1 or more well-defined
outputs, and match the desired output.
OUTPUT
each of its steps (or phases),
and their inputs/outputs should be clear and must lead
to only one meaning.
UNAMBIGUOUS
determine the amount of
resources necessary to execute it such as time and
storage.
MEASUREMENT OF COMPLEXITY
DEFINES WHETHER THE SET OF FUNCTIONS WILL GROW
FASTER OR AT THE SAME RATE AS THE EXPRESSION.
OMEGA NOTATION
Best-case Analysis
DEFINES WHEN THE SET OF FUNCTIONS LIES IN BOTH O
(EXPRESSION) AND OMEGA (EXPRESSION).
THETA NOTATION
Average-case Analysis
DETERMINES THE SET OF FUNCTIONS GROWS SLOWER
BIG-O NOTATION
Worst-case Analysis
is textual representation of flowchart.
PSEUDOCODE
