Skip to main content

Primitive Data Types used in Java Programming

Data can be of many types e.g. character, integer, real, string etc. Anything enclosed in single quotes represents character data. Numbers without fraction represent integer data. Numbers with fractions represent real data and anything enclosed in double quotes represents a string.

Since the data to be dealt with are of many types, a programming language must provide ways and facilities to handle all types of data. Java, like other languages provide ways and facilities to handle different types of data by providing data types.

Java data types are two types:


Primitive data types we mean fundamental data types offered by Java programming language. Primitive are the basic data type values. The world ‘Primitive’ means a fundamentals component that may be used to create other large parts. Java supports following four categories of primitive data types:

Numeric Integral Types

The data types that are used to store numeric values fall under this sub category i.e. numeric primitive data types. Four numeric integral types in Java are Byte, Short, Int and Long. All integral numeric types store integer values i.e. whole numbers only.

The storage size and the range of values supported by numeric integral types are being listed below:
  • Byte (Size - 8 bits), Byte-length integer having range -128 to + 128.
  • Short (Size - 16 bits), Short integer having range -32,768 to + 32,767.
  • Int (Size – 32 bits), Integer having range (about) -2 billion to +2 billion.
  • Long (Size – 64 bits), Long Integer having range (about) -10E18 to +10E18.
Please note that an l (small L) or L suffix on an integer means the integer is of long data type e.g., 33L refer to a long integer value 33. Thus, we can say that 33 is an int value but 33L is a long value.

Depending upon your requirement, you can select appropriate data type. Consider this you need to store your phone no 12345678 in your program? What do you think should be the data type? Can you store in a byte or short data type? Well you need to store it in int data type. The reason behind is that the number to be stored does not fall into ranges supported by byte and short types.

One more thing that you must know about data types that all data types are singed i.e., they can store negative as well as positive numbers.


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 …