Scribd
Upload
11 views4 pages

Data Structures Tutorial 1

Data structure basics

Uploaded by

pranshu1998
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
Download as docx, pdf, or txt
11 views4 pages

Data Structures Tutorial 1

Data structure basics

Uploaded by

pranshu1998
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1/ 4

Data Structures Tutorial

Data Structure is a way to store and organize data so that it can be used
efficiently. Data Structure is a particular way of storing and organizing data in
the memory of the computer so that these data can easily be retrieved and
efficiently utilized in the future when required

Our Data Structure tutorial includes all topics of Data Structure such as
Array, Pointer, Structure, Linked List, Stack, Queue, Graph, Searching,
Sorting, Programs, etc.

What is Data Structure?


The data structure name indicates itself that organizing the data in
memory. There are many ways of organizing the data in the memory as
we have already seen one of the data structures, i.e., array in C language.
Array is a collection of memory elements in which data is stored
sequentially, i.e., one after another. In other words, we can say that array
stores the elements in a continuous manner. This organization of data is
done with the help of an array of data structures. There are also other
ways to organize the data in memory. Let's see the different types of data
structures.

The data structure is not any programming language like C, C++, java,
etc. It is a set of algorithms that we can use in any programming language
to structure the data in the memory.

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.
Types of Data Structures
There are two types of data structures:

o Primitive data structure


o Non-primitive data structure

Primitive Data structure

The primitive data structures are primitive data types. The int, char, float,
double, and pointer are the primitive data structures that can hold a
single value.

Non-Primitive Data structure

The non-primitive data structure is divided into two types:

o Linear data structure


o Non-linear data structure

Linear Data Structure

The arrangement of data in a sequential manner is known as a linear data


structure. The data structures used for this purpose are Arrays, Linked list,
Stacks, and Queues. In these data structures, one element is connected to
only one another element in a linear form.

When one element is connected to the 'n' number of elements


known as a non-linear data structure. The best example is trees
and graphs. In this case, the elements are arranged in a random
manner.

We will discuss the above data structures in brief in the coming topics.
Now, we will see the common operations that we can perform on these
data structures.

Data structures can also be classified as:

o Static data structure: It is a type of data structure where the size


is allocated at the compile time. Therefore, the maximum size is
fixed.
o Dynamic data structure: It is a type of data structure where the
size is allocated at the run time. Therefore, the maximum size is
flexible.
Major Operations
The major or the common operations that can be performed on the data
structures are:

o Searching: We can search for any element in a data structure.


o Sorting: We can sort the elements of a data structure either in an
ascending or descending order.
o Insertion: We can also insert the new element in a data structure.
o Updation: We can also update the element, i.e., we can replace the
element with another element.
o Deletion: We can also perform the delete operation to remove the
element from the data structure.

Which Data Structure?


A data structure is a way of organizing the data so that it can be used
efficiently. Here, we have used the word efficiently, which in terms of both
the space and time. For example, a stack is an ADT (Abstract data type)
which uses either arrays or linked list data structure for the
implementation. Therefore, we conclude that we require some data
structure to implement a particular ADT.

An ADT tells what is to be done and data structure tells how it is to be


done. In other words, we can say that ADT gives us the blueprint while
data structure provides the implementation part. Now the question arises:
how can one get to know which data structure to be used for a particular
ADT?.

As the different data structures can be implemented in a particular ADT,


but the different implementations are compared for time and space. For
example, the Stack ADT can be implemented by both Arrays and linked
list. Suppose the array is providing time efficiency while the linked list is
providing space efficiency, so the one which is the best suited for the
current user's requirements will be selected.

Advantages of Data structures


The following are the advantages of a data structure:

o Efficiency: If the choice of a data structure for implementing a


particular ADT is proper, it makes the program very efficient in
terms of time and space.
o Reusability: The data structure provides reusability means that
multiple client programs can use the data structure.
o Abstraction: The data structure specified by an ADT also provides
the level of abstraction. The client cannot see the internal working
of the data structure, so it does not have to worry about the
implementation part. The client can only see the interface.

You might also like