Count number of digits in an integer using while loop We can count the number of digits in a given number in many ways using java. One of the approach is that, we shall take the number, remove the last digit, and increment our counter for number of digits in the number. We can continue this, until there is no digit in the number. Another approach is that, we can convert the given number into a string, and use the method string.length() to count the number of character in this string. This results in the number of digits in given number. Here, while the loop is iterated until the test expression number != 0 is evaluated to 0(false). After the first iteration, number will be divided by 10 and its value will be 345. Then, the count is incremented to 1. After the second iteration, the value of number will be 34 and the count is increased to 2. After the third iteration, the value of number will be 3 and the count is increased to 3. After the fourth iteration, the value of number will be 0 ...

Write a java program to display alphabets (A to Z) using loop In this program, we can loop through  A  to  Z  using for loop because they are stored as ASCII characters in java. This java program iterates the ASCII code from  65  to  90 , representing the alphabets  A  to  Z  and print them. With a little modification you can display lowercase alphabets to simply replace the  A  with  a  and  Z  with  z . In this case, internally your loop through  97  to  122 . Program: class Main { public static void main (String[] args) { char n; for (n = 'A' ; n <= 'Z' ; ++n) // For lowercase: for (n = 'a' ; n <= 'b' ; ++n) System.out.print(n + " " ); } } Output: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Write a java program to display Fibonacci series In this program, Fibonacci series means to next number is the sum previous two numbers for example 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55 etc. The first two numbers of Fibonacci series are 0 and 1. There are two ways to write the Fibonacci series program in java: Fibonacci series without using recursion Fibonacci series using recursion Program: class Main { public static void main (String[] args) { int n = 10 , firstTerm = 0 , secondTerm = 1 ; System.out.println( "Fibonacci Series till " + n + " terms:" ); for ( int i = 1 ; i <= n; ++i) { System.out.print(firstTerm + ", " ); // compute the next term int nextTerm = firstTerm + secondTerm; firstTerm = secondTerm; secondTerm = nextTerm; } } } Output: Fibonacci Series till 10 terms: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34,