Table of Contents
There are two types of data structure:
- Primitive data Structure
- Non-Primitive data Structure
Primitive data structure
- Primitive data structures are the fundamental data structures.
- It can be operated directly on the data and machine instructions.
- It is also know as basic data structure.
- Primitive data structures are defined by the programming languages, or we can say that it is built-in.
- Some of the Primitive data types are integer, real, character, floating point number, and pointer.
- Basically, ‘data-type’ , ‘data structure’ are often used interchangeably.
Non-primitive data structures
- Non-primitive data structures are the data structures that are created using the primitive data structures.
- It is little bit complicated as it is derived from primitive data structures.
- Some of Non-primitive data structures are linked lists, stacks, trees, and graphs.
- Also we can say that is a grouping of same or different data items.
Non-primitive data structures are classified into two categories
- Linear data structures
- Non-Linear data structures.
1. Linear data structures
- If the elements are stored in a linear or sequential order of a data structure, then it is known as a linear data structure.
- For Examples arrays, linked lists, stacks, and queues are the linear data structures.
- In memory, Linear data structures can be represented in two different ways.
- In the first way, the linear relationship between the elements is because of sequentially memory locations where items are stored. For example an array take memory in sequential fashion.
- And in the second way, elements have a linear relationship because of the link. For example node of the linked list are linked together because its node are arrange in memory in non-sequential fashion.
2). Non-linear data structures
- In Non-linear data structures, elements are not stored in sequential order.
- For Examples, trees and graphs are non-linear data structures.
What did you think?
Similar Reads
-
Multiplications of Two variable polynomial
Polynomial multiplication is a common operation in algebra, used in areas such as scientific computing, engineering simulations, and symbolic algebra… -
Subtraction of Two-Variable Polynomial in C
Polynomials with two variables are common in engineering, graphics, and scientific computation. While addition is frequently discussed, subtraction is equally… -
Explain the Addition of Two variable polynomial
Polynomials are fundamental in mathematics, and their use extends into computer science, engineering, physics, and more. While single-variable polynomials are… -
Reverses the Doubly Circular Linked List
Algorithm to Reverse a Doubly Circular Linked List Check if the List is Empty or Has Only One Node: If… -
Algorithm and Program in C to traverse Doubly Circular Linked List
A doubly circular linked list is a special type of linked list in which every node is connected to both… -
Polynomial representation Using Array
Polynomials are fundamental mathematical expressions used extensively in various fields. Representing them efficiently in programming is crucial for calculations and… -
Multiplication of Single Variable Polynomial : Algorithm and Program
Multiplication of single-variable polynomials is a fundamental operation in polynomial algebra. The process involves multiplying each term of one polynomial… -
Subtraction of Single variable Polynomial : Algorithm and Program
Subtracting single-variable polynomials involves reducing each corresponding term of the polynomials from each other. This process is similar to addition,… -
Addition of Single variable Polynomial : Program and Algorithm
The addition of single-variable polynomials is a fundamental concept in algebra, often encountered in mathematics and computer science. Let's break… -
Polynomial Representation Using Linked List
Polynomial representation using linked lists is a critical concept in computer science and mathematics. In this guide, we explore how…