give the 5 DS AND ALGO DESIGN GOALS/IMPLEMENTATION GOALS

this is a machine that manipulates data.

this is the concealing of the implementation details of data object from the outside world

this is the collection of objects and set of operations that act on those objects

the storing and organizing data in a computer so that it can be used efficiently.

a separation between specification of a data object and its implementation

DATA TYPES ABOUT BASIC

DATA TYPES ABOUT COMPLEX

it may be organized in many different

used for manipulation of data.

Accessing each record exactly once so that certain items in the record may be processed.

Adding new records to the structure.

Finding the location of the record

Removing a data into a structure

Used by OS, compilers, DBMS, data communications

Give the 7 DATA STRUCTURE/+ ALGORITHMS

give the 4 LINEAR DATA STRUCTURE

Its elements form a sequence

NON-LINEAR DATA STRUCTURE is…

finite set of instructions that takes some raw data as input and transforms it in to refined data.

Each instruction is clear and unambiguous

Zero or more quantities are externally supplied

At least one quantity is produced

algorithm terminates after a fi nite number of steps

Every instruction must be basic enough to be carried out

search for a given item in large data collection

arrange data items

reduce the size of data and program files

encryption of data

designed for digital signal processing

identification of geometric shapes

comparing images and shapes

identify different programming constructs

this is a classification of algorithms that repeated in loops until the goal is achieved

the DIVIDE AND CONQUER is classification in algorithms which definitions is true?

an immediately available best solution at each step is chosen

all possible solutions are explored

NATURAL LANGUAGE is expressing an algorithm which definitions is true?

an expressing algorithm that used flowcharts

low level implementation must be removed and replaced by natural language

FROM A PERFORMANCE POINT OF VIEW, WE DEFINE 2 CRITERIA and the “the amount of computer time needed by a progra m to run to completion” is?

FROM A PERFORMANCE POINT OF VIEW, WE DEFINE 2 CRITERIA and the “the amount of memory needed by a program to run to completion” is?

we have TWO PHASES IN PERFORMANCE EVALUATION the “priori testing” is known as?

we have TWO PHASES IN PERFORMANCE EVALUATION and the “priori estimate” is known as?

independent. Memory does not change

Helps to compare algorithms

Dependent. Memory do change

LONG?

MEDIUM/AVERAGE?

SHORT?

way of solving a problem or calculation in less time by using more storage space (or memory), or by solving a problem in very little space by spending a longtime.

is a finite, ordered sequence of data itemsknown as elements.

each element has a positionin the list.

A list is said to be______ when it contains no elements.

number of elements currently stored

The beginning of the list is called the _____, the end of the list iscalled the ____.

There are two standard approaches to implementing lists,

It is a collection of Homogenous, ordered andFinite set of elements. It is a Linear data Structure. Its data type can be Primitive, Composite or Other Data Types.

same element type and have the same structure

Adding operation is also sometimes referred to as ________

It adds new element in a specified position, without replacing any existing element The position is specified in terms of index value or position relative to an existing element.

involves accessing and processing an array element exactly once ~It is also called Visiting.

It is also called Accessing - To retrieve an element we must know the Index value