DATA STRUCTURE http://www.youtube.com/c/EDULINEFORCS
STUDENT
MODULE 1
BASIC CONCEPTS OF DATA
STRUCTURES
Prepared By Mr. EBIN PM, AP, IESCE 1
DATASTRUCTURE
A data structure is a particular way of organizing data in a
computer so that it can be used effectively
Prepared By Mr.EBIN PM, AP, IESCE EDULINE 2
Prepared By Mr. EBIN PM, AP, IESCE
, DATA STRUCTURE http://www.youtube.com/c/EDULINEFORCS
STUDENT
ALGORITHM
An algorithm is a finite set of instructions which, if followed,
accomplish a particular task. Every algorithm must satisfy the
following criteria
• Input – externally supplied
• Output – at least one quantity is produced
• Definiteness – each instruction must be clear and unambiguous
• Finiteness – for all cases , the algorithm will terminate after a
number of steps
• Effectiveness –must be feasible
Prepared By Mr.EBIN PM, AP, IESCE EDULINE 3
ALGORITHM ANALYSIS
To analyze an algorithm is to determine the amount of resource
(such as Time and Storage Space) necessary to execute it.
In theoretical analysis of algorithms, it is common to estimate their
complexity in the asymptotic sense, ie to estimate the complexity
function for arbitrarily large input.
Space Complexity
• The space complexity of a program is the amount of memory that
it needs to run to completion. The space needed the program is the
sum of the following components
Prepared By Mr.EBIN PM, AP, IESCE EDULINE 4
Prepared By Mr. EBIN PM, AP, IESCE
STUDENT
MODULE 1
BASIC CONCEPTS OF DATA
STRUCTURES
Prepared By Mr. EBIN PM, AP, IESCE 1
DATASTRUCTURE
A data structure is a particular way of organizing data in a
computer so that it can be used effectively
Prepared By Mr.EBIN PM, AP, IESCE EDULINE 2
Prepared By Mr. EBIN PM, AP, IESCE
, DATA STRUCTURE http://www.youtube.com/c/EDULINEFORCS
STUDENT
ALGORITHM
An algorithm is a finite set of instructions which, if followed,
accomplish a particular task. Every algorithm must satisfy the
following criteria
• Input – externally supplied
• Output – at least one quantity is produced
• Definiteness – each instruction must be clear and unambiguous
• Finiteness – for all cases , the algorithm will terminate after a
number of steps
• Effectiveness –must be feasible
Prepared By Mr.EBIN PM, AP, IESCE EDULINE 3
ALGORITHM ANALYSIS
To analyze an algorithm is to determine the amount of resource
(such as Time and Storage Space) necessary to execute it.
In theoretical analysis of algorithms, it is common to estimate their
complexity in the asymptotic sense, ie to estimate the complexity
function for arbitrarily large input.
Space Complexity
• The space complexity of a program is the amount of memory that
it needs to run to completion. The space needed the program is the
sum of the following components
Prepared By Mr.EBIN PM, AP, IESCE EDULINE 4
Prepared By Mr. EBIN PM, AP, IESCE
