Skip to main content

Type of Fractional Numeric Data Types used in Java Programming

The integral numbers covered in earlier article could store only whole numbers i.e. they could not have decimal values. Fractional data types can store fractional numbers i.e. numbers having decimal points. There are also called floating-point data types.

Following list displays various floating-point data types available in Java, along with their ranges.

  • Float (Size – 32 bits), Single precision having range -3.4E+38 to +3.4E +38. This data type precision up to 6 digits like temperatures, currency, and percentage or may be some length.
  • Double (Size - 64 bits), Double precision having range -17E+308 to 1.7E+308. This data type precision up to 15 digits like large numbers or high precision, such as for astronomy or subatomic physics.

Now depending upon your requirements for the decimal precision of the data, you can select from float or double types.

For example, you can store the salary values of an employee using a data variable of the float type. To store decimal values with a higher degree of precision, such as values calculated using the functions, sin() and sqrt(), you see the double data type.

By default, Java treats fractional numbers as of double data type e.g. if you write 0.123, it will treated as a double value. To explicitly specify it to be of float type, use suffix F or f i.e. write 1.234f or 1.234F. Similarly if you use suffix d or D, it means double i.e., 1.234D or 1.234d means it is a double value.


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 …