In: Computer Science
With the aid of diagram, discuss in details primitive and non-primitive classifications of data structures
ANSWER :
GIVEN THAT :
Primitive data structure :- This type of data structure are very old and defined during creation of programming language. These are also called basic or fundamental data structure/data type. These data structures are working on machine code of program.Various computer and programming languages have various representation of primitive data structure.
Example- char, int, float, double,pointer etc
Non-Primitive data structure :- This type of data structures are non primitive(new) , latest and sophisticated. it is formed with the help of primitive data structure. It can also store two or more types of data elements. These are also called ADT (Abstract Data Type) or user defined data structures. Operations performed on data elements of these data structures are predefined and user cannot allow to make any change in it.
Example :- array, stack, queue, linked list, tree, graph