Difference between Linier and Non Linier / Primitive and Non Primitive

Data Structure

Data Structure: Arrangement is a mathematical or logical way of organizing data in memory. The arrangement doesn't represent only data in memory but it also represents the connection among the info that's stored in memory.

1.       Primitive Data Structure

The info Structure which is directly operated by machine level instruction is understood as Primitive arrangement. All primary data types are referred to as Primitive arrangement. Ex. Integer, float, character.

2.       None Primitive Data Structure

Array

The info Structure which isn't directly operated by machine level instruction is understood as Non Primitive arrangement. Non Primitive arrangement springs from Primitive arrangement. Non Primitive arrangement are classified into two categories:

·         Linear Data Structure: The Data Structure in which elements are arranged such that we can process them in a linear fashion is called a linear data structure. Ex. Array, stack, queue, linked list.

Stack

·      None Linear Data Structure: The Data Structure in which elements are arranged such that we cannot process them in a linear fashion is called the Non-Linier data structure. Non-Linier arrangement are useful to represent more complex relationships as compared to linear data structures. Ex. Tree, graph.

What is the difference between oop and pop?

Basic short form of computer

Difference Simple and Circular Queue/Stack and Queue

Difference Malloc and calloc/Local and Static Variable/Auto and Extern

 

Tree

      Difference between Non-Linear Data structure and Linear Data Structure

Non-Linear Data structure	Linear Data Structure
Processing of knowledge item is feasible in a linear fashion.	Processing of knowledge item isn't possible in a linear fashion.
Easy to implement.	Difficult to implement.
Example: Array, Stack, Queue	Example: Tree, Graph

                 

Graph

  Difference between Non-Primitive Data Structure and Primitive Data Structure

Non-Primitive Data Structure	Primitive Data Structure
The arrangement which is directly operated by machine level instruction is understood as Primitive Data Structure.	The arrangement which isn't directly operated by machine level instruction is understood as Non-Primitive Data Structure.
All Primary data types are known as Primitive Data Structure.	Non Primitive arrangement springs from Primitive arrangement.
Example: integer, float, character.	Example: array, stack, queue, tree.