Data structures is one of the important subject of computer science Engineering and plays important role in competitive programming. This PPT is all about introduction about data structures in easy language

1. DATA STRUCTURE
By Revati Devrat

2. Q1)WHAT IS DATA ?
• DATA IS DEFINED AS COLLECTION OF RAW MATERIALS LIKE TEXT, VIDEO’S, & AUDIO,
NUMBERS ETC…
• IN OTHER WORDS DATA IS A SET OF VALUES OF QUALITATIVE AND QUANTITATIVE
VARIABLES AND FACTS OR INFORMATION THAT’S STORED IN OR USED BY A COMPUTER .
• IMPORTANCE: DATA IS ESSENTIALLY PLAIN FACTS AND STATISTICS COLLECTED DURING
THE OPERATIONS.
• EXAMPLES: 1) AN EXAMPLE OF DATA IS AN EMAIL.
2) AN EXAMPLE OF DATA IS INFORMATION COLLECTED FOR RESEARCH PAPERS.
• USES OF DATA: THEY CAN BE USED TO MEASURE OR RECORD A WIDE RANGE OR VALUE
OF BUSINESS ACTIVITIES BOTH AN INTERNAL AND EXTERNAL.
• WHY DO WE USE DATA : IT CAN ESTABLISH A BASELINE FROM WHICH TO MEASURE AN
IMPROVEMENT

3. Q2) WHAT IS DATA TYPE?
• DEFINITION OF DATA TYPE : A particular kind of data item as defined by the
values it can take the programing language used or the operations that can be
performed on it.
• THERE ARE THREE TYPES OF DATA TYPES:
• 1)SIMPLE DATA TYPE
2)DERIVED DATA TYPE
3) USER DEFINED DATA TYPE

4. 1)Simple data type: some data types are already built into computer’s
machine language instruction set are called as simple data type . and are
easy to provide. Examples integer, float , char and logical.
2)Derived data type: Derived data types consists of an array, function
and pointer
3)user defined data type: user defined data type consists of structure ,
union & type-Def

5.  integer: integer data type allow to use only integer data which must not
have a decimal point mans w can save only integer value in particular
variable by int. example-int a=11;
 float: float data type allow to use only real number or floating point value
that must have a decimal point means we can save only floating point value
in particular variable by float . example –float a =2.3;
 character : char data type allows to use character constant which is either a
single special symbol enclosed within a single inverted commas means we
can save any character constant in a particular variable by char .example-
char a =1;
 logical :logical data type allow to use a logical values 0 and 1 and true or
false means we can save logical value particular variable by logical .
example-logical a =1;

6. Q3)HOW MANY DATA TYPES ARE USED IN THE DATA
STRUCTURE? WHAT ARE TYPES? EXPLAIN IN BRIEF.
• THERE ARE THREE TYPES OF DATA TYPE BUT ONLY SIMPLE DATA TYPE
USED IN DATA STRUCTURE.
1)Simple data type: some data types are already built into computer’s
machine language instruction set are called as simple data type . and are
easy to provide. Examples integer, float , char and logical.
2)Derived data type: Derived data types consists of an array, function and
pointer
3)user defined data type: user defined data type consists of structure ,
union & type-Def

7. CLASSIFICATION OF DATA
TYPES
Simple data
type
User defined
data type
Derived data
type

8.  Integer: integer data type allow to use only integer data
which must not have a decimal point mans w can save
only integer value in particular variable by int. example-
int a=11;
 Float: float data type allow to use only real number or
floating point value that must have a decimal point means
we can save only floating point value in particular variable
by float . example –float a =2.3;
 Character : char data type allows to use character
constant which is either a single special symbol enclosed
within a single inverted commas means we can save any
character constant in a particular variable by char
.example- char a =1;
 Logical :logical data type allow to use a logical values 0
and 1 and true or false means we can save logical value

9. Q4)WHY DATA STRUCTURE IS
REQUIRED ?
DATA STRUCTURE: DATA STRUCTURE IS DEFINED AS A PARTICULAR ORGANIZATION OR
COLLECTION OF DATA BY THE LOGICAL OR MATHEMATICAL ENTITIES.
IF DATA IS IN UNORGANIZED FORM THEN IT IS DIFFICULT TO FIND A PARTICULAR DATA
AT THE TIME OF REQUIREMENT.
THEREFORE DATA IS ORGANIZED IN PARTICULAR MANNER TO ACCESS THE DATA
EASILY AND EASY TO ANALYZE AND UNDERSTAND DATA SO THAT DATA STRUCTURE IS
REQUIRED.
FROM DEFINITION WE UNDERSTAND THE EXACT MEANING OF DATA STRUCTURE
WHEN DATA IS IN UNORGANIZED FORM THEN WE ARE UNABLE TO FIND EXACT
SUBJECT EASILY BECAUSE THEY ARE NOT IN SEQUENTIAL FORM.
 BUT ONLY WHEN DATA IS IN ORGANIZED FORM THEN IT BECOMES EASY TO
UNDERSTAND AND FIND THE DATA

10. Q5)WRITE A PROGRAM FOR RECORD OF TEN
STUDENTS.
# INCLUDE<STDIO.H>
# INCLUDE<CONIO.H>
VOID MAIN()
{
INT I , J ;
INT STUD [10];
PRINTF (“ENTER NO OF ELEMENTS”);
SCANF (“%D”,& I);
FOR(I=0; I<=10; I++)
PRINTF (“RECORD OF STUD= % D” , STUD[ I ]
GETCH();
}
#OUTPUT=1,2,3,4,5,6,7,8,9,10.

11. Q6)WHAT IS AN ALGORITHM? EXPLAIN WITH IT’S
CHARACTERISTICS.
• ALGORITHM : AN ALGORITHM IS A STEP BY STEP PROCEDURE TO SOLVE
PARTICULAR PROBLEM.
• CHARACTERISTICS OF AN ALGORITHM :
• FINITENESS
• DEFINITENESS
• EFFECTIVE
• INPUT
• OUTPUT

12.  Finiteness :
a) An algorithm must always terminate after a finite no of steps.
b) It indicates that each and every algorithm contains limited no of steps.
c) It is one of the most important characteristics of an algorithm.
 Definiteness:
a) Each and every step of an algorithm should be strictly define.
b) And never skip any step of an algorithm and careful operation is one of the characteristic
of an algorithm.
 Effective :
a) Algorithm should be effective.
b) Steps should be limited and also effective.
 Input :
a) It should take from zero to more.
b) Input never be less than zero.
 Output :
a) It should take and produce one or more
• Characteristics of an algorithm :

13. Q7)EXPLAIN OPERATIONS ON DATA STRUCTURE?
DATA STRUCTURE :IT IS DEFINED AS PARTICULAR ORGANIZATION OR COLLECTION OF DATA BY THE
LOGICAL OR MATHEMATICAL ENTITIES.
OPERATIONS ON DATA STRUCTURE :THE DATAAPPEARING IN DATA STRUCTURE ARE PROCESSED BY
THE FOLLOWING OPERATIONS
a) TRAVERSING :ACCESSING EACH RECORD EXACTLY ONCE SO THAT CERTAIN ITEMS IN THE
RECORD MAY BE PROCESS.
B) SEARCHING : FINDING THE LOCATION OF RECORD WITH A GIVEN KEY VALUE OR FINDING THE
LOCATIONS OF ALL RECORDS WHICH SATISFY ONE OR MORE CONDITIONS.
C) INSERTING : ADDING A NEW RECORD TO THE STRUCTURE.
D) DELETION : REMOVING THE RECORD FROM THE STRUCTURE.
E) SORTING : ARRANGING THE RECORDS IN SAME LOGICAL ORDER
F) MERGING :COMBINING THE RECORDS IN TWO DIFFERENT SORTED FILES INTO A SINGLE SORTED
FILES INTO A SINGLE SORTED FILE

14. Q8)WHAT IS ABSTRACT DATA TYPE?
• THE PROCESS IN WHICH USER ONLY KNOWS WHAT OPERATIONS ARE TO BE
PERFORMED BUT NOT HOW THESE OPERATIONS WILL BE IMPLEMENTED
• MEANING OF WORD ABSTRACT : ABSTRACTION IS THE PROCESS OF PROVIDING
ONLY THE ESSENTIALS AND HIDING THE DETAILS IS KNOWN AS ABSTRACTION
• ABSTRACT DATA TYPE IS COMPOSED OF A COLLECTION OF DATAAND SET OF
OPERATIONS ON THAT DATA
• SPECIFICATIONS OF ABSTRACT DATA TYPE :
• 1) WHAT THE ADT OPERATION DO AND NOT HOW TO IMPLEMENT THEM.
• 2) IT IS ONLY CONCERN WITH WHAT THE DATA IS REPRESENTED AND NOT HOW
IT WILL BE CONSTRUCTED.

15. Abstract Data type :
Data consists of following three parts:
1) Data : The structure of data used in ADT can be described in this part.
2) Operation : Describes the valid operation for the ADT
3) Error : Describes how to deal with errors that can occur.
Example of Abstract Data type :
1) Facebook : user only knows how to use Facebook and send & receive
messages but user never known with how does exactly it works.

16. Q9)EXPLAIN REPRESENTATION OF INFORMATION
• AN INFORMATION OBJECT THAT MAY HAVE ITS OWN DATA OBJECT AND ITS OWN
REPRESENTATION INFORMATION ASSOCIATED WITH UNDERSTANDING EACH
DATA OBJECT
• INFORMATION COMS IN DIFFERENT FORMS LIKE TEXT , NUMBERS , IMAGES ,
AUDIO & VIDEO.
• TEXT : COMPUTER USE BINARY DIGIT 0 & 1 TO STORE DATA. A BINARY DIGIT OR
BIT IS THE SMALLEST UNIT OF DATA IN COMPUTING . IT IS REPRESENTED BY 0
AND 1.BINARY NUMBERS ARE MADE UP OF BINARY DIGITS OR BITS LIKE 1001
• BAR CHART : THE MOST COMMON FORM OF REPRESENTATION FOR
CATEGORICAL DATAARE THE BAR CHART OR PIE GRAPH . HISTOGRAMS ARE A
USEFUL GRAPHICAL FORM FOR LARGE NUMERICAL DATA SETS.
• NUMBERS : REPRESENTED FROM 0 TO 9

17. Q10)WHAT IS DATA STRUCTURE AND WHAT
ARE THE DIFFERENT TYPES OF DATA
STRUCTURE?
• DATA STRUCTURE: DATA STRUCTURE IS DEFINED AS A PARTICULAR
ORGANIZATION OR COLLECTION OF DATA BY THE LOGICAL OR MATHEMATICAL
ENTITIES.
• TYPES OF DATA STRUCTURE : TYPES OF DATA STRUCTURE DEPENDS UPON
THE FURTHER CLASSIFICATION OF DATA STRUCTURE.
• 1) PRIMITIVE DATA STRUCTURE : THIS TYPE OF DATA STRUCTURE CANNOT
CLASSIFIED HENCE IS PRIMITIVE DATA STRUCTURE.
• 2) NON-PRIMITIVE DATA STRUCTURE : THIS TYPE OF DATA STRUCTURE
FURTHER CLASSIFIED HENCE IT IS CALLED NON-PRIMITIVE DATA STRUCTURE.

18. Primitive data structure : it is type of data structure which allow to use the numbers .
1)Simple data type: some data types are already built into computer’s machine language
instruction set are called as simple data type . and are easy to provide. Examples integer, float ,
char and logical.
 Integer: integer data type allow to use only integer data which must not have a decimal point
mans w can save only integer value in particular variable by int. example-int a=11;
 Float: float data type allow to use only real number or floating point value that must have a
decimal point means we can save only floating point value in particular variable by float .
example –float a =2.3;
 Character : char data type allows to use character constant which is either a single special
symbol enclosed within a single inverted commas means we can save any character constant in
a particular variable by char .example- char a =1;
 Logical :logical data type allow to use a logical values 0 and 1 and true or false means we can
save logical value particular variable by logical . Example-logical a =1;

19. non-primitive data structure : (Linear data structure) :
1) Array
2) Stack
3) Queue
4) Linked List

20. ARRAY :
ARRAY: ARRAY IS THE COLLECTION OF THE SIMILAR DATA TYPES
 SYNTAX : DATA TYPE NAME OF ARRAY [ ] ;
 EXAMPLE : INT A [10];
 SOME IMPORTANT POINTS :
 ARRAY CONTAINS LIMITED NUMBERS OF ELEMENTS
 ELEMENTS ARE SORTED ONE BY ONE IN CONTAGIOUS LOCATION OF
COMPUTERS MEMORY IN A LINEAR ORDER
 ALL ELEMENTS SHOULD B OF SAME DATA TYPE.

21. STACK :
 LIFO – LAST IN FIRST OUT
 IT IS AN ORDERED GROUP OF HOMOGENOUS ITEM OF ELEMENTS.
 ELEMENTS ARE ADDED TO AND REMOVED FROM THE TOP OF THE
STACK
 THE LAST ELEMENTS TO BE FIRST TO BE REMOVED
 EXAMPLE : { 10 20 30 40 }
 0 1 2 3
 FIRST IN LAST IN
 INSERTION AND DELETION OCCUR FROM TOP POSITION.

22. QUEUE
 FIFO – FIRST IN FIRST OUT
 A QUEUE ALSO CALLED AS QUEUE SYSTEM.
 IT IS A LINEAR LIST IN WHICH DELETION CAN TAKE PLACE ONLY AT ONE END
OF THE LIST
 THE FONT OF LIST AND INSERTION CAN TAKES PLACE ONLY AT THE OTHER
END REAR.
 EXAMPLE : { 10 20 30 40 }
 0 1 2 3
 FIRST IN LAST IN
 FIRST ELEMENT IS REMOVED TO BE FIRST

23. LINKED LIST :
 A LINKED LIST OR ONE WAY LIST IS A LINEAR COLLECTION OF DATA ELEMENTS
CALLED AS NODES
WHERE THE LINEAR ORDER IS GIVEN BY MEANS OF POINTERS
EACH NODE IS DIVIDED INTO TWO PARTS :
THE FIRST PART CONTAINS THE INFORMATION OF NODE
SECOND PART CONTAINS THE ADDRESS OF NEXT NODE IN THE LIST
THERE IS A SPECIAL POINTER START OR THE LIST CONTAINS THE ADDRESS OF
FIRST NOD IN THE LIST
IF THIS SPECIAL POINTER CONTAINS NULL MEANS THAT LIST IS EMPTY.

24. NON-PRIMITIVE DATA STRUCTURE (NON-
LINEAR)
• 1) TREE :
 DATA FREQUENTLY CONTAINS A RELATIONSHIP BETWEEN VARIOUS ELEMENTS
 THE DATA STRUCTURE WHICH REFLECTS THIS RELATIONSHIP IS CALLED A ROOTED GRAPH OR SIMPLY A
TREE
 A TREE IS A SET OF NODES STORING ELEMENTS SUCH THAT THE NODES HAVE A PARENT CHILD NODES
 EACH ELEMENT HAS A 0 OR MORE CHILDREN
 EXCEPT THE ROOT EACH ELEMENT HAS A PARENT
 THE TOP ELEMENT IS KNOWN AS ROOT
 SIBLINGS: TWO NODES THAT HAVE SAME PARENTS NODE
 EXAMPLE : A
B C

25. • Data sometimes contains a relationship between the pairs of elements
which is not necessarily hierarchical in nature.
• Example : an airline flights only between the cities are connected by the
lines this data structure is called as graph.
• a b
• d c
• Where a, b, c, & are known as vertices and ab ,cd, bc, ad are called as
edges.

26. THANK YOU