introduction of data struture

1. INTRODUCTION
DAS stand for data structure and algorithms

2. INTRODUCTION
• DATA: collection of a raw facts and figure is known as data.
• RECORD: collection of attributes about an entity is known as record
• STRCUTER: Designing of program, way of defining.
• “DS is a specialized format for organized data and storing data ”

3. Array
• Array: An array is a linear data structure. Which is a finite collection of
similar data items stored in successive or consecutive memory
locations.
• Example: For example an array may contains all integer or character
elements, but not both.
• Each array access by its index

4. Types of Array
Array can be categorized into different types. They are
One dimensional array
Two dimensional array
Multi dimensional array
• One dimensional array:-
One dimensional array is also called as linear array. It is also represents 1-
D array.
the one dimensional array stores the data elements in a single row or
column.
The syntax to declare a linear array is as fallows
Syntax: <data type> <array name> [size];

5. Array operations
• There are several operations that can be
performed on an array. They are
Insertion: adding new data
Deletion: remove current data
Traversal: visiting the data
Reversing: ascending and descending
Sorting : arrange the data
Searching: search a specific record. Or location of the elements

6. Types of data structure
• linear: A type of data structure data elements are stored in a linear
sequence is called data structure
• Example: array ,stack , queue
• Non linear: Data structure in which data elements store in a no linear
sequence
• Example: tree, graph.

7. Operations of data structure
• Traversing: Traversal is nothing but display the elements on screen it
also known as data visiting technique.
• Searching: Searching is the process of finding the location of an
element with a given element in a list..
• Insertions: the process of adding new record is known as insertions
like insert the record of the new student in your current data base of
save a contact in your phone
• Dilatation: is process in which we remove the data form data base

8. Types of operations
• An organizations contain a membership file in which each record
contain the following data for give the member
• Name
• Address
• Phone
• Age
• Gender
• Father_name

9. Linear link list
 It is a fundamental data structure consist of a sequence of node.
Each node contain data field and a reference field
Node: a part of computer in a network , but here node is a index a of
a array it may be include with pointer(->) of index [n]
Field: collect of record.
A link list allow the insertion and removed of a node at any point in
the list but it does not allow to random access because it is linear
data structure.
Each node contain two part data and pointer 10 pointer