Friday, March 1, 2024
HomeC ProgrammingPrimitive, Non-Primitive and Summary Information Sort

Primitive, Non-Primitive and Summary Information Sort

Information sort is a system to outline primary properties and operations allowed on the information. Properties equivalent to โ€“ acceptable values, vary, bytes required in reminiscence and many others. Information sorts could be additional labeled in three main classes.

  1. Primitive knowledge sort
  2. Non-Primitive knowledge sort
  3. Summary knowledge sort (ADT)
Primitive Information Sort Non-Primitive Information Sort Summary Information Sort (ADT)
Normal knowledge sorts that comes built-in with a programming language, from which different knowledge sorts are composed is called primitive knowledge sort. Information sort created from assortment of primitive and/or different composite sort is referred as composite knowledge sort. ADT doesn’t outline a concrete illustration of knowledge. Slightly it specifies the operation carried out on the information sort.
Outlined by the programming language. Outlined by the programmer. Specification is given, implementation could also be given by programming language.
Also called built-in or commonplace knowledge sort. Also called user-defined or composite knowledge sort.
Atomic in nature, saved knowledge can’t be additional damaged down and accessed individually. Non-atomic in nature, saved knowledge could be accessed individually. Doesn’t outline concrete knowledge.
Should have a concrete worth. Can have null values. Doesn’t outline concrete knowledge.
Defines concrete knowledge in reminiscence. Consumer can outline each concrete knowledge and strategies to function on knowledge. Specifies strategies to function on the information.
Instance: int, float, boolean, char Instance: struct, class and many others. Instance: Record, Stack, Queue and many others.


Please enter your comment!
Please enter your name here

Most Popular

Recent Comments