§ INTRODUCTION §
•DATA REPRESENTATION
▪ Data .
▪ Data Type .
▪ Data Type in ‘C’ .
▪ User-defined Type .
▪ Derived Data Type .
▪ DATA STRUCTURE .
▪ NEED OF DATA STRUCTURE .
▪ CLASSIFICATION .
▪ OPERATION .
§ WHAT IS DATA ?

• Numbers ,
• Alphabets ,
• Symbols .
§ TYPES OF DATA ?
• Atomic data .
• Composite data .
§ ATOMIC DATA
• Non-decomposible entity
§ COMPOSITE DATA
• Composible entity
§ WHAT IS DATA TYPE ?
A data type is a term which
refers to the kind of data that
variables may hold in a
programming language .
Ex: int x;
§ WHAT IS DATA TYPE IN ‘C’ ?

• Set of built in data types.
• Variables to name data.
• Set of operation.
• Manipulation.
§ WHAT IS USER-DEFINED TYPE ?
• Type definition .
• Identifier .
§ WHAT IS DERIVED DATA TYPE ?
• Group of element .
• Contiguous memory .
§ WHAT IS DATA STRUCTURE ?
•
•
•
•
•

Organization of data .
Associativity among data element .
Accessing method .
Operation on data .
Processing alternatives for data .
§ NEEDS OF DATA STRUCTURE ?

•
•
•
•
•
•

Close collection .
Operations .
Efficient implementation .
Linked organization .
Sequential organization .
Modification are costly .
§ CLASSIFICATION OF DATA STRUCTURE §
• DATA STRUCTURE IS DIVIDED INTO TWO
CATEGORIES :
* Primitive data structure .
* Non-primitive data structure .
§ PRIMITIVE DATA STRUCTURE :
• Programming languages .
• Data objects .
• Machine level instruction .
• Examples :♦ Integers .
♦ Real .
♦ Logical data .
♦ Character data .
♦ Pointers .
§ NON-PRIMITIVE DATA STRUCTURE :
• Homogeneous data element .
• Heterogeneous data element .
• Examples :♦ Array .
♦ Structures .
♦ Union .
♦ Linked list .
♦ Stack .
♦ Queue .
♦ Tree .
♦ Graph .
§ OPERATION OF DATA STRUCTURE :-

I. Traversing .
II. Searching .
III. Inserting .
IV. Deleting .
V. Sorting .
data Structure

data Structure

  • 2.
    § INTRODUCTION § •DATAREPRESENTATION ▪ Data . ▪ Data Type . ▪ Data Type in ‘C’ . ▪ User-defined Type . ▪ Derived Data Type . ▪ DATA STRUCTURE . ▪ NEED OF DATA STRUCTURE . ▪ CLASSIFICATION . ▪ OPERATION .
  • 3.
    § WHAT ISDATA ? • Numbers , • Alphabets , • Symbols .
  • 4.
    § TYPES OFDATA ? • Atomic data . • Composite data .
  • 5.
    § ATOMIC DATA •Non-decomposible entity § COMPOSITE DATA • Composible entity
  • 6.
    § WHAT ISDATA TYPE ? A data type is a term which refers to the kind of data that variables may hold in a programming language . Ex: int x;
  • 7.
    § WHAT ISDATA TYPE IN ‘C’ ? • Set of built in data types. • Variables to name data. • Set of operation. • Manipulation.
  • 8.
    § WHAT ISUSER-DEFINED TYPE ? • Type definition . • Identifier . § WHAT IS DERIVED DATA TYPE ? • Group of element . • Contiguous memory .
  • 9.
    § WHAT ISDATA STRUCTURE ? • • • • • Organization of data . Associativity among data element . Accessing method . Operation on data . Processing alternatives for data .
  • 10.
    § NEEDS OFDATA STRUCTURE ? • • • • • • Close collection . Operations . Efficient implementation . Linked organization . Sequential organization . Modification are costly .
  • 11.
    § CLASSIFICATION OFDATA STRUCTURE § • DATA STRUCTURE IS DIVIDED INTO TWO CATEGORIES : * Primitive data structure . * Non-primitive data structure .
  • 12.
    § PRIMITIVE DATASTRUCTURE : • Programming languages . • Data objects . • Machine level instruction . • Examples :♦ Integers . ♦ Real . ♦ Logical data . ♦ Character data . ♦ Pointers .
  • 13.
    § NON-PRIMITIVE DATASTRUCTURE : • Homogeneous data element . • Heterogeneous data element . • Examples :♦ Array . ♦ Structures . ♦ Union . ♦ Linked list . ♦ Stack . ♦ Queue . ♦ Tree . ♦ Graph .
  • 14.
    § OPERATION OFDATA STRUCTURE :- I. Traversing . II. Searching . III. Inserting . IV. Deleting . V. Sorting .