1. Data Structure and Algorithm Introduction

2.  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.

3. Planning Analysis Design (DSA) Implementation Evolution

4. What is Data Structure?  It is an arrangement of data in a computer’s memory or disk storage space.  Example:  Arrays  Linked list  Queues  Stacks  Binary trees

5. NameRelationship BhillyBrother-in-Law BJNephew CarmelaMyself CelesteSister CelineNiece IanneNiece ImeeSister-in-Law IssahNiece JhunBrother-in-Law JJNephew JoeyBrother JomarNephew JoseFather MargaritaMother MhilletSister RochieSister

6. Celeste Jhun Jose Margarita Joey ImeeMhillet Bhilly RochieCarmela Celine & BJJJ & JomarIssah & Ianne

7. 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.

8. Data Structure Taxonomy Data Structure Linear Direct Access Homogeneous Components Array Heterogeneous Components Record Sequential General List LIFO Stack FIFO Queue Non- Linear Set

9. 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.

10. 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.

11. Homogeneous VS Heterogeneous  In homogeneous, all elements in the structure are of same data types.  In heterogeneous, all elements in the structure are of different data types.