Hello Magnetzz…
Welcome to our new blog so in this blog
we are going to discuss about Data
Structure so our todays topic is Non Primitive DSA.
“
A
non-primitive data structure that cannot be operated by direct machine
instruction. These data structures are derived from primitive data structures.
Non-primitive data structures are complex data structures that are composed of
one or more primitive data types or other non-primitive data types. They are
used to organize and manage large amounts of data efficiently and effectively.”
The non primitive
data structure is kind of data structure that can hold multiple values either
in a contiguous or random location. The non-primitive data types are defined by
the programmer.
THE NON-PRIMITIVE DATA STRUCTURE IS IN TWO
TYPES…
A. Linear –Data Structure :- A linear data structure is a type of
data structure where the data elements are arranged in sequential order. The
elements are stored linearly, such that each element is connected to its
adjacent element. Linear data structures are widely used in computer science
and programming as they are easy to implement and efficient for accessing and
manipulating data.
LINEAR HAS FOUR TYPES :-
1) ARRAY:- Array are a collection of elements of the same
data types , which are stored in contiguous memory locations. Each element in
the array can be accessed using its index ,which is an integer value that
indicates the position of the element in the array.
2) LINKED LIST:- Linked list on the other hand are composed of
a series of connected nodes, where each node contains a data element and a
reference to the next node. The first node in the list is called the head and
the last node is called the tail. Unlike arrays , linked list do not require
contiguous memory allocation , and the size of the list canbe dynamically
adjusted.
3) STACK:- A stack is a data structure that follows the
LAST-IN-FIRST-OUT (LIFO) principle , which means that the element addes last to
the stack is the first one to be removed. In other words , the element in a
stack and the least recently addes element is at the bottom. Stacks can be used
to implement algorithms like function call stack, parenthesis matching , and
infix to postfix conversion.
4) QUEUE:- Queue follows the FIRST-IN-FIRST-OUT (FIFO)
principle , which means that the element added first to the queue is the first
one to be removed. In a queue the elements are arranged in a sequence such that
the least recently added element is at
the front of the queue and the most recently added element is at the back.
Queue can be used to implement algorithms like breadth first search and job
scheduling.
B. NON-LINEAR DATA STRUCTURE:- Non structure are data structures that do not have a
sequential or linear arrangement of data elements. In these data structure ,
data elements are linked in a way that does not follow a simple sequence and
can have multiple paths to access a particular data element.
NON-LINEAR
ARE TWO TYPES:-
1) TREE:- A tree is a non-linear data structure that
consists of a set of nodes connected by edges. Each node in a tree can have
zero or more child nodes , and each has exactly one parent node, except for the
root node. Tree are widlely used in computer science , particularly in data
structure and algorithms to represent hierarchical structures like file
systems, decision trees, and binary search trees.
2) GRAPH:- A graph is a non linear data structure that
consists of a set of vertices or nodes and a set of edges that connect them.
The edges can be directed or undirected and can have weights. Graph are used in
many applications , including computer
networks ,social networks and transportation networks.
Thanks for
reading…….
0 Comments