This slide provides the introduction about the Data Structure. Before moving into DS, the concepts like Algorithm and Programming are discussed. In addition, concepts of Abstract Data Type ( ADT ) is also explained

1. INTRODUCTION

2. Computer problem solving is the major task involved in today's period

3. CHALLENGING TASK CAN BE SOLVED BY
PROPER PLANNING
APPLYING INNOVATIVE THOUGHTS
ATTENTION TO DETAILS

4. PROBLEM CAN BE SOLVED BY
ALGORITHM PROGRAM
DATA
STRUCTURE
APPLYING IMPLEMENT AND
EXECUTE

5. SOME IMPORTANT TERMINOLOGIES
TERM DESCRIPTION EXAMPLE
DATA COLLECTION OF FACTS,
VALUE OR SET OF VALUES
IN A FORMALIZED WAY
NAME, MARKS OF
THE STUDENT

6. SOME IMPORTANT TERMINOLOGIES
TERM DESCRIPTION EXAMPLE
DATA COLLECTION OF FACTS
VALUE OR SET OF
VALUES
IN A FORMALIZED WAY
NAME, MARKS OF
THE STUDENT
INFORMATION PROCESSED DATA GRADE, RANK

7. SOME IMPORTANT TERMINOLOGIES
TERM DESCRIPTION EXAMPLE
DATA COLLECTION OF FACTS
VALUE OR SET OF
VALUES
IN A FORMALIZED WAY
NAME= SIVA,
ID=1001
OF THE STUDENT
INFORMATION PROCESSED DATA GRADE, RANK
RECORD COLLECTION OF
RELATED FIELDS
FIELDS OF THE
STUDENT LIKE
NAME, ID, MARKS,
RANK, GRADE

8. SOME IMPORTANT TERMINOLOGIES
TERM DESCRIPTION EXAMPLE
DATA COLLECTION OF FACTS
VALUE OR SET OF
VALUES
IN A FORMALIZED WAY
NAME= SIVA,
ID=1001
OF THE STUDENT
INFORMATION PROCESSED DATA GRADE, RANK
RECORD COLLECTION OF
RELATED FIELDS
FIELDS OF THE
STUDENT LIKE
NAME, ID, MARKS,
RANK, GRADE
DATA TYPE THE DATAS WHICH
SHARE THE COMMON
PROPERTIES
THE DATA TYPE OF
NAME IS STRING,
MARK IS INTEGER,

9.  Computing is done with the help of data.
 But if the data is unsorted it will not be easy to
recognize
 Let us see some sorted data

10. SORTED DATA
CONTACT LIST DICTIONARY

11.  In our mobile, we have an application called Contact List,
which is sorted in a similar way like Dictionary.
 But what happens if the words in the dictionary is unsorted ?
 It will be time consuming to search words. Right ?

12. SORTED DATA
GOOGLE MAP STUDENT RECORD

13.  The Google map is sorted in some order which helps to
fix the location.
 Similarly, the tabular representation of student record
provides proper way to view the student details.
 Sorted data makes the computation faster and efficient.
 This sorting of data is performed with the help of
Algorithm.

14. ALGORITHM
 It is a finite process
 Specified set of simple instructions
INPUT OUTPUT
FINITE STEPS

15. CHARACTERISTICS OF ALGORITHM
 Clear
 Complete
 Definite
 Efficient
Space - Effective memory utilization
Time - Less time consumption

16. Swap( a,b)
t = a;
a = b;
b = t;
Return(a,b)
Swap( a,b)
a = a+b;
b = a-b;
a = a-b;
Return(a,b)

17. PROGRAMMING
 The process of taking an algorithm and implementing it
into program using programming languages like c, c++
or java is called programming

18. PROGRAM
 When a program is executed without an algorithm then
it cannot be considered as a efficient program

19. DATA STRUCTURE
 It is a systematic way to organize data that can be stored
and retrieved
 The items stored has some relationship with each other
 All the operations are performed efficiently
 The main goal is component reuse

20. DATA STRUCTURE
PRIMITIVE DS NON PRIMITIVE DS
INT CHAR FLOAT NON LINEAR
TREE GRAPH
LINKED
LIST
STACK QUEUEARRAY
LINEAR

21. ABSTRACT DATA TYPE ( ADT )
 PROGRAMMING RULE
Routine should never exceed a page
 Break the program into several modules
PROGRAM
MODULE 1 MODULE 3MODULE 2

22. ABSTRACT DATA TYPE ( ADT )
 Each module is a specific unit and does some job
 Size is kept small by calling other modules
MODULE 3MODULE 2MODULE 1
JOB 3JOB 2JOB 1

23. MODULARITY ADVANTAGES
 Easy to debug
 Independent, change is easier

24.  Object such as list, set, graph along with their operations can
be viewed as ADT
 set of operations like union, intersection, complement, find,
etc
 Extension of modular design
 Idea – written once in program and can be called by any part
of the program

25. THANK YOU