# Primitive data structures | Non primitive data structures

this article Primitive data structures we give the information about data structure is a way to store and organize data in a computer system. So that we can use the data easily.

#### Unit I: Introduction to data structures

Data Structure

Data structure is a way to store and organize data in a computer system. So that we can use the data easily. That is, the data is stored and organized in such a way that it can be easily accessed later at any time.

A data object is a set of elements. Each value in a data object can be accessed using its identifiers. A data object can be finite or infinite.

Data structure is a collection of objects, properties of data object and set of operations that can be performed on the data object.

It is not a programming language like C, C++, Java, but it is a set of algorithms that we use to structure data in programming languages.

Data structure is a main part of many computer science algorithms by which programmers can handle data well. It plays a very important role in improving the performance of the program or software

#### There are two types of data structure:-

1. Primitive Data Structures
2. Non-primitive Data Structures

#### Primitive Data Structure: –

Primitive data structure is that data structure which can be operated directly from machine instructions. That is, it is defined by the system and the compiler.

Non-primitive data structure: – Non-Primitive data structure is a data structure that allows you to store multiple data type values. integer, Boolean, character, float, etc.

There are two types of non-primitive data structures:-

1:-Linear Data Structure

2:-Non-linear Structure

1:- Linear data structure

Linear is a data structure in which data items are stored and arranged in a linear form, with one data item connected to another as a line.

ex:- array, linked list, queue, stack.

#### 2:- Non-linear data structure

Non-linear is a data structure in which data items are not arranged in a sequential manner in which a data item can be associated with any number of other data items.

ex:-tree, graph.

• Through this we can store information on the hard disk. And we can use this information later.
• We can easily manage very large databases.
• It is very important for designing algorithms.
• Through this we can access and process data on the software system.
• It makes the processing of data very easy.
• We can access the data at any time from our laptop or mobile using the internet.
• If the programmer uses the right data structure, then he saves a lot of his time and along with this he is able to save storage and processing time as well.
• The data structure that is specified by the abstract data type (ADT) provides abstraction. Due to which the client cannot see the internal working of the data structure, so it does not need to worry about the working part. The client can only see the interface.
• The data structure provides reusability which means that the data structure can be used by many clients.

• Only advance users can make changes in the data structure.
• If ever there is any problem in the data structure, then only expert can solve it. Basic users cannot solve this.
• If our data structure is very large, then many people are needed to maintain and create it. Due to which its cost (price) increases.

Its operations

1. Searching –The process of finding an element is called searching. There are two algorithms to complete the search, first binary search and second linear search.
2. Sorting –The process of arranging the data structure in a particular order is called sorting. There are many algorithms to perform sorting such as – insertion sort, selection sort, bubble sort, radix sort etc.
3. Insertion –The process of adding elements to a location is called insertion. If the size of a data structure is n, then we can insert only n-1 elements in it.
4. Deletion –The process of removing an element is called deletion. We can delete data from any location.
5. Traversing –Traversing means to traverse each element of the data structure to perform a particular task.
6. Merging –Joining two such lists which have same type of data elements together is called merging. From which we get a third list.

Characteristics of Data Structure:-

1. It is a group of operations which are performed in data items such as:- searching, sorting etc.
2. It describes how the data items are related to each other.
3. The execution time of data structure operations should be as short as possible.
4. The memory usage of its operations should be as low as possible.
5. It should implement the interface correctly.

#### Some More:

POP- Introduction to Programming Using ‘C’

DS – Data structure Using C

OOP – Object Oriented Programming

Java Programming

DBMS – Database Management System

RDBMS – Relational Database Management System