Primitive and Non-Primitive Data Types

-


 Primitive and Non-Primitive Data Types :



Data can be either primitive data types or Non-Primitive data types. The data structures can contain any of these data types.

       Primitive data types are those data types,which are not composed of other data types. Primitive data types are Integer, Real and Character data types.

      Non-Primitive data types are those data types,which are composed of primitive data types. Normally these are defined by the users,that is why,these are sometimes called user- defined data types. Examples of non primitive data types in C are arrey , structure, class,union etc.

           

           Pointers :




A special data type pointers has been introduced by some programing languages. The pointer data type enables storage of pointers i.e., addressed of some other data location. Pointers are of great use in some popular and efficient data structures like linked lists , stacks, queues and trees etc.

Abstract Data Type (ADT) :-



A useful tool for specifying the logical properties of a data type is the abstract data type or ADT . Fundamentally a data  types  is a collection of values and a set of operations on those values. That collection and these operations form a mathematical construct that may be implemented using particular hardware and software data structure.
   An ADT is a data type that is organised in such a way that the specification of the values and the specification of the operations on those values are separated from the representation of the values and the implementation of the operations. For example, consider a list of abstract data type. A list is basically a collection of elements which can be ordered or unordered. The primitive operations on a list may include  adding new elements , deleting elements, determining number of elements in the list and applying a particular process to each element in the list. Here we can not concerned with how a list is represented and how the above mentioned operations are implemented. 
      We only need to know what is a list whose elements are given and what can we do with the list. We also can defined an array as Abstract data type, Pointer as Abstract data  type and Structure as Abstract data type.

Parts of ADT  :

   An ADT consists of two parts -

(1) Value Definition
(2) Operator Definition

       (1) Value Definition :-
                                                 A value definition defines the collection of values for  the ADT and consists of two parts -
                 1. Definition Clause
                  2. Condition Clause

        (2) Operator Definition :-
                                                     Each operator is defined as an abstract function with three parts : a header, the optinal precondition and the post condition.


                  






            Thank You

  
        

Comments

Post a Comment

Hello Friends,

Popular posts from this blog

Array Declaration

-
Image
Array Declaration Declaration is an important process for a variable so that the compiler will know what kind of variable , containing which type of value and of what size is required by the user .         Therefore , an array is also declared as other variables. In declaration we provides the name and the size of array. Syntax of array declaration is as follows : -            Int - N  [a]; Int : Type of Data N : Name of Variable [a] : Size of Length Type of Data or data type defines the type or category of element's can be stored in the arrays . Like - int type only store number's, Name (n) specifies the name of array or variable. [a] Size or Length specifies the capacity of storing elements. Like [10] means it can only store 10 elements. For example -                  int N [10]. In the above example, the name of array is N and it can accept only 10 integer (number) type of el...
Read more

Data Structure and C

-
Image
  Data Structure and C A C programmer can think of the C language as defining a new machine with  its own capabilities , data types and types and operations . the user can state a problem solution in terms of the more useful C constructers. Thus , problem can be solved more easily because a larger set of tools is available in C. The study of data structure therefore involves two complementary goals. The first goal is to identify  and develop useful mathematical entities and operations and to determine what classes of problems  can be solved by using these entities and operations  The second goal is to determine representation for those abstract entities and to implement the abstract operations on these concrete  representation . The first of these goals views a high-level data types as a tool that can be used to solve other problems and the second views the implementation of such a data type as a problem to be solved using already existing data types . In d...
Read more

Description of Various Data Structures

-
Image
Description Of Various Data Structures : 1. Arrays :            An array can be defined as a set of finite numbe r of homogeneous elements  or data items. It means an array can contain one type only, either all Integers, all floating-point numbers or all characters. Declaration of arrays is as follows :-                          int a[10]; Where int specifies the data types or type of elements array stores. "a" is the name of arry and the number specified inside the square brackets is the number of elements an array can store. This is also called size or length of array. Following are some of the points to be remembered about arrays - 1. The individual elements of an array can be accessed by specifying name of the array , followed by index or subscript (which is an integer number specifying the location of element in the array) inside square brackets.      For example to ac...
Read more