Skip to main content

Introduction to Variables and its stages in JAVA Programming

In Java, Variables represent named storage locations, whose values can be manipulated during program run. For instance, to store name of a student and marks of a student during a program run, we require storage locations that should be named too so that these can be distinguished easily. Variable called as symbolic variables (because these are named), serve the purpose.

Declaration of a variable

The declaration of a variable generally takes the following form
type variable-name;

Where type is any DataType in Java and variable-name is the variable to be used further, it is an identifier thus all rules of identifier naming apply to the name of variable. Following declaration creates a variable age of int type:
int age;

Following are some more examples of C variables declarations
double pival;
float res;

The above declaration creates a variable ‘pival’ of type double and a variable ‘res’ of type float. A simply definition consist of a type specifier followed by a variable-name. When more than one identifier of a type is being defined, a comma-separated list of identifiers may follow the type specifier. For example,
double salary, wage ;
int month, day, year ;
long distance, area ;

Initialization of Variables  

All the example definitions of previous paragraph are simple definitions. A simple definition does not provide a first value or initial value to the variable i.e. variable is uninitialized and the variable’s value said to be undefined. A first value (initial value) may be specified in the definition of a variable. A variable with declaration first value is said to be an initialised variable. Java supports two form of variable definition:

int val = 1001;

Here val is initialized with a first value of 1001. Following are some more examples of initialized variables:
double price = 214.70, discount = 0.12;
float fint =0.27 F;
long val = 25;
string name = “Rohan”;

Dynamic Initialization

The expression that initializes a variables (that assign it a value for initial use) can be an expression with:
a literal 
Byte a = 3
a reference to another variables e.g.
short a = 0;
short b = a ;
a call to a method, in which case the return value determines the initialization. This type of initialization is called dynamic initialization. In the below code a and b is initialized but not yet c. When program runs then c will have the value returned by the function invoked here i.e. math.sqrt().

double a =3.0, b =4.0 ;
double c = math.sqrt (a*a + b*b);

Initial Values of Variables

Every variable in a program must have a value before its value is used. Each class variable (also called Field variable), instance variable, or array components is initialized with a default value when it is created:

Introduction to Variables and its stages in JAVA Programming


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 …