Presentations text content in Data Structure and Algorithm
Data Structure and Algorithm
The manner in which computer program is being developed is not as simple as you may possibly think.
It comprises a lot of study, test, and recording to complete a first-rate outcome.
Sequence of steps are used to organized a large activities needed to build a program.Slide3
What is Data Structure?
It is an arrangement of data in a computer’s memory or disk storage space.
Celine & BJ
Significance of DSA
The use of DSA is the essential working components used by programmers to store and manipulate data.
For programmers to easily understand on how they work and which algorithm or data structure is best fit for a particular condition were provided.Slide8
Data Structure TaxonomySlide9
Linear VS Non-Linear
In linear there is a unique first and last element and every other element has a unique predecessor and unique successor, except for the first and last elements.
This type of data structure performs insert, delete, search, update operations sequentially or in order.
Non-Linear data structure performs traversing, Inserting, delete, search and update operation randomly.Slide10
Sequential VS Direct
In Direct access, elements can be accessed at random, in any order. Any element can be accessed without accessing its predecessor or successor.
In Sequential access, elements must be accessed in some specified order. To access the nth element you must access the preceding n-1 elements.Slide11
Homogeneous VS Heterogeneous
In homogeneous, all elements in the structure are
, all elements in the structure are of different data types.Slide12Slide13Slide14Slide15Slide16Slide17Slide18Slide19Slide20Slide21