Easy Notes Of Data structure using C unit-1 @Computer Diploma

Description

Core Keywords: Data Structures Unit I

1.1 Introduction: Concept and Need of Data Structure, Definition, Abstract Data Type

• Data Structure: A particular way of organizing data in a computer so that it can be used efficiently.
• Data: Raw facts and figures.
• Information: Processed data that is meaningful.
• Efficiency: Measured in terms of time complexity (execution speed) and space complexity (memory usage).
• Abstract Data Type (ADT): A mathematical model of a data structure that specifies the data stored and the operations on the data, but not how the operations are implemented (implementation-independent view).
• Implementation: The concrete programming code used to realize the ADT.

1.2 Types of Data Structures: (i) Linear Data Structures (ii) Non-Linear Data Structures

• Linear Data Structure: Data elements are arranged sequentially or linearly, where each element has a unique predecessor and successor (except the first and last).
  • Examples: Array, Linked List, Stack, Queue.
• Non-Linear Data Structure: Data elements are not arranged sequentially; an element can be connected to more than two other elements, showing a hierarchical or networked relationship.
  • Examples: Tree, Graph.
• Homogeneous: A structure where all elements are of the same data type (e.g., an array of integers).
• Heterogeneous: A structure where elements can be of different data types (e.g., a structure/record).
• Static Data Structure: Size is fixed at compile time (e.g., typical Array).
• Dynamic Data Structure: Size can be changed during run-time (e.g., Linked List).

1.3 Operations on Data Structures: (i) Traversing (ii) Insertion (iii) Deletion

• Traversing: The process of visiting each element of the data structure exactly once.
• Searching: Finding the location of a specific element within the structure.
• Insertion: Adding a new data element to the structure.
• Deletion: Removing an existing data element from the structure.
• Updating/Modification: Changing the value of an existing element.
• Sorting: Arranging the elements in a logical order (ascending or descending).
• Merging: Combining the elements of two similar data structures into one.