InstanceOfJava

Difference between float and double java

Posted by: Instanceofjava Posted date: 4:55 PM / comment : 0 java programming interview questions

Float data type in java is represented in 32 bits, with 1 sign bit, 8 bits of exponent, and 23 bits of the mantissa

Where as Double is is represented in 64 bits, with 1 sign bit, 11 bits of exponent, and 52 bits of mantissa.
Default value of float is 0.0f.
Default value of double is 0.0d.
Floating points numbers also known as real numbers and in java there are two types of floating point one is float and another one is double.

In Java, both double ;and float are used for storing decimal numbers, but they are not the same in the following ways:

	float	double
Size	32-bit (4 bytes)	64-bit (8 bytes)
Precision	~6-7 decimal digits	~15-16 decimal digits
Default Type	No (needs f or F)	Yes (default for decimals)
Performance	Faster on some processors	Higher precision, may be slower
Range	±3.4 × 10³⁸	±1.8 × 10³⁰⁸
Usage	When memory is a concern	When high precision is needed

When to Use:

Use float when dealing with graphics or in game development when memory savings are more significant than precision.
Use double for scientific calculations, financial applications, or whenever high precision is critical.

Float specifies single precision and double specifies double precision.
According to the IEEE standards, float is a 32 bit representation of a real number while double is a 64 bit representation
Normally we use double instead of float to avoid common overflow of range of numbers
Check below diagram for width and range of float and double data types

When do you use float and when do you use double:

Use double data type for all your calculations and temp variables.
Use float when you need to maintain an array of numbers - float[] array (if precision is sufficient), and you are dealing with over tens of thousands of float numbers.
Most of the math functions or operators convert/return double, and you don't want to cast the numbers back to float for any intermediate steps.

How many significant digits have floats and doubles in java?

In java float can handle about 7 decimal places.
And double can handle about 16 decimal places

Program #1: write a java example program which explains differences between float and double in java

package com.instanceofjava.floatvsdouble;
import java.math.BigDecimal;
public class FloatVsDouble {
/**
* @website: www.instanceofjava.com
* @category: float vs double in java with example program
*/
public static void main(String[] args) {
float a=10.8632667283322234f;
double b=10.8632667283322234f;
System.out.println("float value="+a);
System.out.println("double value="+b);
b=10.8632667283322234d;
System.out.println("float value="+a);
System.out.println("double value="+b);
}
}

Output:

float value=10.863267
double value=10.863266944885254
float value=10.863267
double value=10.863266728332224

Difference between float and double java

How to open a webpage using java code

Posted by: Instanceofjava Posted date: 1:14 PM / comment : 1 java programming interview questions

We can open a website or web page using java.
By calling browse() method of java.awt.Desktop.getDesktop() and passing required webpage url as an URI.
In order to make URI create a object fro java.net.uri class objet by passing URL of the web page which need to open
java.awt.Desktop.getDesktop().browse(uri);
Lets see a java program on how to open website url.

Program #1: Simple Java Program to open a website or webpage using java.awt.Desktop

package com.instanceofjava.openwebpage;
import java.awt.Desktop;
import java.io.File;
import java.io.IOException;
import java.net.URI;
public class OpenVLCPlayer {
/**
* @website: www.instanceofjava.com
* @category: how to open a webpage in browser using java code
*/
public static void main(String[] args) {
try {
URI uri= new URI("http://www.instanceofjava.com");
java.awt.Desktop.getDesktop().browse(uri);
System.out.println("Web page opened in browser");
} catch (Exception e) {
e.printStackTrace();
}
}
}

Output:

Web page opened in browser

JSP Jstl if else statement with mutilple conditions

Posted by: Instanceofjava Posted date: 11:44 AM / comment : 0 Jsp interview questions

JSTL means Java Server pages standard Tag Library.
JSTL is a collection of useful JSP tags to simplify the JSP development.
Lets see how to write if and if else statements in java server pages using JSTL

JSTL If condition in JSP :

We can use JSTL tags by providing
<%@ taglib uri="http://java.sun.com/jsp/jstl/core" prefix="c" %>

Program #1: Write a program to how to use JSTL if condition in Java server pages

<%@ page language="java" contentType="text/html; charset=ISO-8859-1"
pageEncoding="ISO-8859-1"%>
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.or
/TR/html4/loose.dtd">
<%@ taglib uri="http://java.sun.com/jsp/jstl/core" prefix="c" %>
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
<title>JSTL if condition</title>
</head>
<body>
<c:set var="age" scope="session" value="${20}"/>
<c:if test="${age > 18}">
<p>My age is: <c:out value="${age}"/><p>
</c:if>
</body>
</html>

Output:

JSTL If else condition in JSP :

We use c:when and c:otherwise tags in JSTL like if else in java

Program #2: Write a program to how to use JSTL if else condition in Java server pages

<%@ page language="java" contentType="text/html; charset=ISO-8859-1"
pageEncoding="ISO-8859-1"%>
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.or
/TR/html4/loose.dtd">
<%@ taglib uri="http://java.sun.com/jsp/jstl/core" prefix="c" %>
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
<title>JSTL if else condition</title>
</head>
<body>
<h1>c:when, c:otherwise, c:choose</h1>
<c:set var="year" value="2016" ></c:set>
<c:choose>
<c:when test="${year%4==0}">
<c:out value="leap year"></c:out>
</c:when>
<c:otherwise>
<c:out value="Not Leap year"></c:out>
</c:otherwise>
</c:choose>
</body>
</html>

Output:

JSTL multiple If else conditions in JSP :

We use c:when and c:otherwise tags in JSTL like if else if else in java server pages.
Lest wee how to use if else ladder and compare string in jstl multiple if else conditions.
Jstl if else statement multiple conditions

Program #3: Write a program to how to use comparing string in JSTL multiple if else condition in Java server pages

<%@ page language="java" contentType="text/html; charset=ISO-8859-1"
pageEncoding="ISO-8859-1"%>
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.or
/TR/html4/loose.dtd">
<%@ taglib uri="http://java.sun.com/jsp/jstl/core" prefix="c" %>
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
<title>JSTL multiple if else condition/ if else ladder</title>
</head>
<body>
<c:set var="Day" value="Friday" ></c:set>
<c:choose>
<c:when test="${Day=='Sunday'}">
<c:out value="Its SunDay"></c:out>
</c:when>
<c:when test="${Day=='Monday'}">
<c:out value="Its MonDay"></c:out>
</c:when>
<c:when test="${Day=='Tuesday'}">
<c:out value="Its TuesDay"></c:out>
</c:when>
<c:when test="${Day=='Wednesday'}">
<c:out value="Its Wednesday"></c:out>
</c:when>
<c:when test="${Day=='Thursday'}">
<c:out value="Its ThursDay"></c:out>
</c:when>
<c:when test="${Day=='Friday'}">
<c:out value="Its FriDay"></c:out>
</c:when>
<c:otherwise>
<c:out value="Its Saturday"></c:out>
</c:otherwise>
</c:choose>
</body>
</html>

Output:

Merge sort algorithm in java with example program

Posted by: Instanceofjava Posted date: 7:40 PM / comment : 0 java programming interview questions , java sorting algorithms

Merge sort one of the recursive sorting algorithm.
First divide the list of unsorted elements in two two parts. left half and right half.

Divide the left part elements in to sub lists until it become single element.
Divide right half of array or list of elements in to sub lists until it becomes one element in list.
After dividing all elements in two parts in to single entity.
Merge the elements into two by comparing lesser element will be first. apply same at right half
Merge all the elements in the left part until it become single sorted list
Now we have two sorted parts.
Means two parts sorted in ascending order and smaller element will be in first position.
Compare fist elements of two parts , lesser one should be takes first place in new sorted list
New sorted list or array having only one element now.
Compare two lists elements and place in sorting order and merge it.
Finally we have all elements sorted.
Compared to remaining algorithms like selection sort, insertion sort and bubble sort merge sort works faster.
Lets see what will be the time complexity of merge sort algorithm.

Time complexity of merge sort algorithm:

1.Best case time complexity: O(n log (n))
2.Average case time complexity: O(n log (n))
3.Worst case time complexity: O(n log (n))
4.Worst case space complexity: O(n)

Merge sort in java with explanation diagram

Program#1: Java program to implement merge sort algorithm data structure

package com.instanceofjava.mergesortalgorithm;
public class MergeSortAlgorithm {
private int[] resarray;
private int[] tempMergArray;
private int length;
public static void main(String a[]){
int[] inputArr ={6,42,2,32,15,8,23,4};
System.out.println("Before sorting");
for(int i:inputArr){
System.out.print(i);
System.out.print(" ");
}
MergeSortAlgorithm mergesortalg = new MergeSortAlgorithm();
mergesortalg.sort(inputArr);
System.out.println();
System.out.println("After sorting");
for(int i:inputArr){
System.out.print(i);
System.out.print(" ");
}
}
public void sort(int inputArray[]) {
this.resarray = inputArray;
this.length = inputArray.length;
this.tempMergArray = new int[length];
doMergeSort(0, length - 1);
}
private void doMergeSort(int lowerIndex, int higherIndex) {
if (lowerIndex < higherIndex) {
int middle = lowerIndex + (higherIndex - lowerIndex) / 2;
//to sort left half of the array
doMergeSort(lowerIndex, middle);
// to sort right half of the array
doMergeSort(middle + 1, higherIndex);
//merge two halfs
mergehalfs(lowerIndex, middle, higherIndex);
}
}
private void mergehalfs(int lowerIndex, int middle, int higherIndex) {
for (int i = lowerIndex; i <= higherIndex; i++) {
tempMergArray[i] = resarray[i];
}
int i = lowerIndex;
int j = middle + 1;
int k = lowerIndex;
while (i <= middle && j <= higherIndex) {
if (tempMergArray[i] <= tempMergArray[j]) {
resarray[k] = tempMergArray[i];
i++;
} else {
resarray[k] = tempMergArray[j];
j++;
}
k++;
}
while (i <= middle) {
resarray[k] = tempMergArray[i];
k++;
i++;
}
}
}

Output:

Before sorting
6 42 2 32 15 8 23 4
After sorting
2 4 6 8 15 23 32 42

How to use Javascript confirm dialogue box

Posted by: Instanceofjava Posted date: 4:03 PM / comment : 0 Javascript interview questions

Confirm dialogue box in java script used to display a message for an action weather its is required to perform or not.
JavaScript confirm dialogue box contains two buttons "Ok" and "Cancel".
If user clicks on OK button confirm dialogue box returns true. If user clicks on cancel button it returns false.
So based on the user entered option we can continue our program. So confirm dialogue box used to test an action is required or not from user.

Its not possible to change values of confirm dialogue box buttons from "Ok" and "Cancel"to "Yes" and "No".
We need to use custom popups or jquery popups to use "Yes" and "No".
var res= confirm("Are you sure to continue?");

How to use Javascript confirm dialogue box:

function myFunction() {
var text;
var res= confirm("Are you sure to continue?");
if (res == true) {
text= "You clicked OK!";
} else {
text= "You clicked Cancel!";
}
document.getElementById("demo").innerHTML = txt
}
</script>

Javascript confirm delete onclick:

If we are deleting a record from database then we need to ask user to confirm deletion if ye really want to delete record then user checks Ok otherwise cancel based on this we can proceed furthur.
To implement this functionality we need to call a JavaScript function onClick() whenever user clicks on delete record button.

Program#1: JavaScript program to show confirm dialogue box on clicking delete student record.

<!DOCTYPE html>
<html>
<body>
<p>Click the button to delete student record</p>
<button onclick="toConfirm()">Delete student record </button>
<p id="student"></p>
<script>
function toConfirm() {
var text;
var r = confirm("You clicked on a button to delete student recored. Clik ok ro proceed");
if (r == true) {
//code to delete student record.
text = "You clikced on ok. Student record deleted";
} else {
text = "You clicked on cancel. transaction cancelled.";
}
document.getElementById("student").innerHTML = text;
}
</script>
</body>
</html>

If we click on Ok then it will delete student record. otherwise it wont.

Insertion sort algorithm in java programming

Posted by: Instanceofjava Posted date: 10:35 AM / comment : 0 java programming interview questions , java sorting algorithms

Sorting means arranging elements of a array or list in ascending or descending order.
We have various sorting algorithms in java.

Iterative and recursive algorithms.
Insertion sort is iterative type of algorithm.
Insertion sort algorithm is in place algorithm
The basic idea behind insertion sort is to divide our list in to two parts , sorted and un sorted.
At each step of algorithm a number is moved from un sorted part to sorted part.
Initially take 1st element as sorted element.
Noe take second element and compare with first element if it less than the 1st element then swap two numbers means place lesser value in first position.
So now have two elements in sorted part. Take third element and compare with second element if it is less than the second element then we need to compare it with 1st element if is less than first element we need keep that in first place. Take an element from unsorted portion and compare with sorted portion and place it in correct position in order to make sorted.
This will be repeated until entire list will be sorted.

Time complexity of Insertion sort:

1.Best case time complexity: O(n²)
2.Average case time complexity: O(n²)
3.Worst case time complexity: O (n²)
4.Worst case space complexity: O(1)

Implementation of Insertion sort algorithm in java

Program #1: Write a java example program on insertion sort algorithm.

package com.instanceofjava.insertionsortalgorithm;
public class InsertionSort {
/**
* @website: www.instanceofjava.com
* @category: insertion sort algorithm in java
*/
public static int[] doInsertionSort(int[] array){
int temp;
for (int i = 1; i < array.length; i++) {
for(int j = i ; j > 0 ; j--){
if(array[j] < array[j-1]){
temp = array[j];
array[j] = array[j-1];
array[j-1] = temp;
}
}
}
return array;
}
static void printArray(int[] inputarray){
for(int i:inputarray){
System.out.print(i);
System.out.print(", ");
}
System.out.println();
}
public static void main(String a[]){
int[] array = {16,12,3,11,9,21,5,6};
System.out.println("Before sorting elements");
printArray(array);
int[] resarray = doInsertionSort(array);
System.out.println("After sorting elements");
printArray(array);
}
}

Output:

Before sorting elements
16, 12, 3, 11, 9, 21, 5, 6,
After sorting elements
3, 5, 6, 9, 11, 12, 16, 21,

Subscribe to: Posts ( Atom )