Scribd
Upload
13 views

Dsa Sibu 12

Uploaded by

ꜱɪʙᴜ ꜱᴀʜᴏᴏ
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
13 views

Dsa Sibu 12

Uploaded by

ꜱɪʙᴜ ꜱᴀʜᴏᴏ
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 10

A

Presentation on

Data Structures and its Classifi cation

Presented By:

Name – Sibu Sahoo Registration No:


230301120446

Omm DebaDatta Mahapatra


Registration No: 230301120446

November 15, 202


4
Contents:

“
1. Introduction
2.Classifi cations Data Structure
3. Primitive Data Structure
4. Non-Primitive Data Structure
5. Operations On Data Structure
6. Need Of Data Structures
7. Conclusion
Introduction to Data Structures

 A Data structure is a structure that is used to store and organize data. It is a way of arranging the
data on a computer so that it can be accessed and updated efficiently.

 Data Structure is also used for processing, retrieving, and storing data.

 To structure the data in memory, 'n' number of algorithms were proposed, and all these algorithms
are known as Abstract data types. These abstract data types are the set of rules.

1
Classification Of Data Structure

2
Classification of Data Structures

Primitive Data Structures

 Primitive data structure is a kind of data structure that stores the data of only one type
 Primitive data structure will contain some value, i.e., it cannot be NULL
 Primitive data structure can be used to call the methods
 Examples of primitive data structure are integer, character, float.

4
Non-Primitive Data Structures
 Non-primitive data structure is a type of data structure that can store the data of more than one type.

 Non-primitive data structure can consist of a NULL value.

 Non-primitive data structure cannot be used to call the methods

 Examples of non-primitive data structure are Array, Linked list, stack

Classification Of Non – Primitive Data Structures


Linear data structure: Data structure in which data elements are arranged sequentially or linearly,
where each element is attached to its previous and next adjacent elements, is called a linear data
structure.
Non-linear data structure: Data structures where data elements are not placed sequentially or
linearly are called non-linear data structures. In a non-linear data structure, we can’t traverse all the
elements in a single run only.
5
Operations on Data Structures
The following list of operations applied to data structures:

1. Insertion: Add an element to data structures.

2. Deletion: Delete an element from the data structure.

3. Traverse: Visit/process each data structure element exactly once.

4. Searching: Find the position of a data item in the data structure.

5. Sorting: Arrange the list of elements in ascending, descending, or alphabetical order.

6. Concatenation: Join two or more data structures into a single structure.

3
Need Of Data Structure

Here is a list of the needs for data.

1.Data structure modification is easy.

2.It requires less time.

3.Save storage memory space.

4.Data representation is easy.

5.Easy access to the large database.

6
Conclusion

Data structures are fundamental concepts in computer science that enable efficient organization,
management, and storage of data. They play a crucial role in optimizing algorithms and improving the
performance of software applications. By understanding various data structures, such as arrays, linked
lists, stacks, queues, trees, and graphs, developers can choose the most appropriate structure for their
specific needs, leading to more efficient code.

9
Thank You

You might also like