Skip to main content

Primitive data types in C language

Introduction

Definition : “Basic data types are those that are not composed of other data types.

Primitive Data types are:

  • int
  • char
  • float
  • double
  • void
Note: The primitive data types are also called basic data types or simple data types or
fundamental data types.

int

It is a keyword which is used to define integer numbers. Normally they are associated with the
Variables to store singed integer values in memory  locations. That is, using this data type both
Positive and negative numbers can be stored in the memory . To represent only unsigned numbers
it is normally associated with a qualifier unsigned.
For example, unsigned int is used to define only positive numbers. Negative numbers cannot be
Stored if a variable is associated with unsigned int. the size and the range of integer vary from
Machine to machine as shown below:


n- bit machine
Size of int
Range of unsigned int
0 to 2n -1
Range of signed int
-2n-1 to 2n-1 -1
16-bit machine
2 bytes
0 to 216-1
Or
0 to 65532
-215 to 215-1
Or
-32768 to 32767
32-bit machine
4 bytes
0 to 232-1
Or
0 to 4294967295
-231 to 231 -1
Or
-2147483648 to 2147483647


Float

 It is a keyword which is used to define floating point numbers. The floating point numbers are Also called real numbers. Normally they are associated with the variables (also called identifiers) To store floating point numbers in memory locations. That is , using this data type both positive And  negative floating point numbers can be stored in the memory.

 Double

It is a keyword which is used to define  high precision floating point numbers Normally they are       Associated with the variables to store large floating point numbers in memory locations. That is, Using this data type both positive and negative large floating point numbers can be stored in the Memory.

Char

 It is a keyword which is used to define single character or a sequence of character called string.
Normally , They are associated with the variables to store a character or a string  in  memory
Locations. Each character stored in the memory is associated with a unique value called an ASCII
(American standard Code For Information Interchange) value.

Void

It is an empty data type. It is normally used in functions to indicate that the function does not
Return any value. Since no value is associated with this data type, it does not occupy any space
in the memory. Normally, it is not associated any variable (except pointers).

Table- Size and Range of Data types on a 10-bit machine.

Type
Size (bits)
Range
Format
Char of signed char
Unsigned char
Short signed int
Shot unsigned int
Signed int
unsigned int
long signed int or long int
long unsigned int
Float
double
long double
8
8
16
16
16
16
32
32
32
64
80
-128 to 127
0 to 255
-32768 to +32767
0 to65535
-32768 to +32767
0 to 65535
-2147483648 to +2147483647
   0 to 429467295
-3.4e38 to +3.4e38
-1.7e308 to +1.7e308
-1.7e4932 to +1.7e4932
%c
%c
%d
%u
%d
%u
%ld
%lu
%f
%lf
% lf

Comments

Popular posts from this blog

difference between structure and union in C Language

In c language article we will see the difference between union and structure. Both are the user define datatype in c language. See the table which is mentioned below: ASP.NET Video Tutorial Series Structure Union1.The keywordstruct is used to define a structure 1. The keyword union is used to define a union. 2. When a variable is associated with a structure, the compiler allocates the memory for each member. The size of structure is greater than or equal to the sum ofsizes of its members. The smaller members may end with unused slack bytes. 2. When a variable is associated with a union, thecompiler allocates thememory by considering the size of the largest memory. So, size of union is equal to the size of largest member. 3. Each member within a structure is assigned unique storage area of location. 3. Memory allocated is shared by individual members of union. 4. The address of each member will be in ascending order This indicates that memory for each member will start at different offset v…

Difference between Linear search and Binary Search in c language

SQL Video Channel : Download all SQL Video



Binary Search Linear Search Works only on sorted items. such as  1,2,3,4,5,6  etc
Works on sorted as well as unsorted items. 12,4,5,3,2,1 etc Very efficient if the items are sorted Very efficient if the items are less and present in the beginning of the list. such as Suppose your list items are : 12,3,4,5,1 and you want to search 12 number then you get beginning in the list. Works well with arrays and not on linked lists. Works with arrays and linked lists.
Number of comparisons are less More number of comparisons are required if the items are present in the later part of the array or its elements are more.

Memory representation of Linked List Data Structures in C Language

Memory representation of Linked List

             In memory the linked list is stored in scattered cells (locations).The memory for each node is allocated dynamically means as and when required. So the Linked List can increase as per the user wish and the size is not fixed, it can vary.

               Suppose first node of linked list is allocated with an address 1008. Its graphical representation looks like the figure shown below:


      Suppose next node is allocated at an address 506, so the list becomes,



  Suppose next node is allocated with an address with an address 10,s the list become,


The other way to represent the linked list is as shown below:




 In the above representation the data stored in the linked list is “INDIA”, the information part of each node contains one character. The external pointer root points to first node’s address 1005. The link part of the node containing information I contains 1007, the address of next node. The last node …