Introduction about data structure.

1. RAV DSA
1
What is Data?
“Data means value or set of values”
For example:
1. 34
2. 13/05/2008
3. Chintech
4. 12,34,43,21

2. RAV DSA
2
Difference between Data &
Information.
Data
Procedure
to process
Data
Information_1
Information_2
.
.
.
.
.
.
Information_n

3. RAV DSA
3
What is Data type?
A data type is a term which refers to the kind of data
that may appear in computation .For example:
Data Data type
34 Numeric
Chintech String
21,43,56 Array of integers
12/05/2008 Date

4. RAV DSA
4
Concept of Data Structure
The logical or mathematical model of a particular
organization of data is called Data Structure.
OR
Data Structure is a named group of data of different
data types,which can be processed as a single unit.

5. RAV DSA
5
A data structure 'd' is a triplet,that is,d=(D,F,A) where,
D:Domain,This is the range of values that the data
may have. The domain is also termed as data object.
F:Function,This is the set operations which may
legally be applied to elements of data object.
A:Axioms,This is the set of rules with which the
different operations belongs to F actually can be
implemented.

6. RAV DSA
6
Overview of Data Structures
Classic data structuresClassic data structures
Linear data structures Non-linear data structures
Arrays Linked-Lists Stacks TablesQueues Trees Graphs Sets

7. RAV DSA
7
Why do we Study Different
Programming Languages ?

8. RAV DSA
8

Increase capacity to express ideas.

Learning new data structures, algorithms, and
other language features will allow a programmer
to create more efficient programs and solve
more complex problems.

Knowing the advantages & disadvantages of
different languages helps us to choose better
languages over poorer ones.

9. RAV DSA
9
What is basic purpose of using
data structures?

Programs operate on data or you have a large
amount of identical data then it is a good idea to
somehow group this data.

That's what data structures are for:

Grouping data in an orderly fashion which
makes it easier for the developer to access it and
also allows the computer to speed things up by
keeping related items close to each other.

10. RAV DSA
10
When you solve a problem with a
computer program, always ask
first :-
How should the program store the
information upon which it computes?

11. RAV DSA
11

In the field of computer science, a data structure is a
way of storing data in a computer so that it can be
used efficiently.

Often a carefully chosen data structure will allow the
most efficient algorithm to be used.

Different kinds of data structures are suited to
different kinds of applications,and some are highly
specialized to certain tasks.

For example, B-trees are particularly well-suited for
implementation of databases, while routing tables rely
on networks of machines to function.