Scribd
Upload
2 views8 pages

DataStructuresConcepts Operations

Data structures are mathematical models for organizing data in memory, facilitating easy access and manipulation. They are categorized into linear structures (like arrays and linked lists) and non-linear structures (like trees and graphs), each serving different application needs. Various operations such as traversing, searching, inserting, deleting, sorting, and merging can be performed on these data structures.

Uploaded by

d9vhq2f9nq
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views8 pages

DataStructuresConcepts Operations

Data structures are mathematical models for organizing data in memory, facilitating easy access and manipulation. They are categorized into linear structures (like arrays and linked lists) and non-linear structures (like trees and graphs), each serving different application needs. Various operations such as traversing, searching, inserting, deleting, sorting, and merging can be performed on these data structures.

Uploaded by

d9vhq2f9nq
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Unit-1

Data Structures: Introduction


Definition :Data Structure

• The logical or mathematical model of a particular organization of data


is called a data structure.
• Data structure is a way of organizing data in memory so that it can be
easily accessed and manipulated.
• Data structures are used in many different applications depending on
the specific requirements, such as speed, memory efficiency, and
ease of manipulation.
Types of data structures

• There are two types of Data Structures


1. Linear Data Structure
2. Non-linear Data Structure
1. Linear Data Structure:
• A linear data structure is a way of organizing data where elements are
arranged in a sequential order, one after another.
• This means that each element is connected to the one before it and
the one after it, forming a simple sequence.
• Examples of Linear Data Structure:
Arrays, Linked lists, Stacks and Queues
Types of data structures contd..

2. Non -linear Data Structure:


• A non-linear data structure is a type of data structure where elements
are not arranged sequentially or in a %linear order. Instead, they are
organized in a hierarchical or interconnected manner, forming
complex relationships between elements.
• Examples of Non Linear Data Structure:
Trees and Graphs.
Data Structure Operations

• There are different types of operations that can be performed


for the manipulation of data in every data structure. They are:
1. Traversing
2. Searching
3. Inserting
4. Deleting
5. Sorting and
6. Merging
Data Structure Operations Contd..
1. Traversing: It is the process of visiting each element exactly once in
a specific order to perform operations like searching, updating or
processing data.
2. Searching: It involves finding a specific element or value within the
structure with a given key value or finding the location of elements
which satisfy one or more conditions.
3. Inserting: It is the process of adding a new element to a specific
location within the structure. The new element can be added at the
beginning or end of the list, at the specific index, or into the correct
position in a sorted data structure.
Data Structure Operations Contd..
4. Deleting: It is the process of removing an element from a data
structure.
5. Sorting: It is the process of arranging the elements in some logical
order(ascending or descending). E.g. alphabetically according to
some character elements or names , or in numerical order
according to some number elements.
6. Merging: It is the process of combining the elements from two
different sorted structures(lists or arrays) into a single sorted
structure. Merging is efficient when both input sequences are
already sorted.

You might also like