Programs using While Loop:

1.Print Odd Numbers:

private void printOddNumbers() {
      int no = 1;
      while (no <= 19) {
      System.out.print(no + " ");
      no = no + 2;
    }

2.Multiples of 3:

private void printMultiplesOf3() {
    // TODO Auto-generated method stub
    int count = 15;
    int no = 3;
    while (count > 0) {
      System.out.print(no + " ");
      count = count - 1;
      no = no + 3;
    }

3.Multiple of 3 Table format:

private void printMultiplesOf3_2() {
    // TODO Auto-generated method stub
    int mul = 1, no = 3;
    while (mul <= 15) {
      System.out.println(mul + " * 3 = " + (mul * no));
      mul = mul + 1;
    }

4.Print_no_series_1:

private void print_no_series_1() {
    // TODO Auto-generated method stub
    int no = 36;
    int count = 1;
    while (count <= 13) {
      System.out.print(no + " "); // 18
      no = no - 2;
      if (count == 13)
        break;
      System.out.print(no + " "); // 34
      no = no - 4;
      count = count + 1;
    }

5.Count_of_digits:

  private void count_of_digits(int no) {
    // TODO Auto-generated method stub
    int count = 0;
    while (no > 0) {

      no = no / 10;
      count = count + 1;
    }
    System.out.println("Count of digits is " + count);

  }

6.Sum_of_digits:

 private void sum_of_digits(int no) {
    // TODO Auto-generated method stub
    int count = 0;
    int sum = 0;
    while (no > 0) {
      int rem = no % 10;
      sum = sum + rem;
      no = no / 10;
      count = count + 1;
    }

    System.out.println("Sum of Digits is " + sum);

  }

7.Reverse_no:

private void reverse_no(int no) {
    // TODO Auto-generated method stub
    System.out.println("Given number is " + no);
    int count = 0;
    int sum = 0;
    while (no > 0) {
      int rem = no % 10;
      sum = (sum * 10) + rem;
      no = no / 10;
      count = count + 1;
    }
    System.out.println("Now, Reversed no is " + sum);
  }

8.Palindrome:

private void find_palindrome(int no) {
    System.out.println("Given number is " + no);
    int no2 = no; 
    int count = 0;
    int sum = 0;
    while (no > 0) {
      int rem = no % 10;
      sum = (sum * 10) + rem;
      no = no / 10;
      count = count + 1;
    }
    System.out.println("Now, Reversed no is " + sum);
    System.out.println(no);
    if (no2 == sum)
      System.out.println("Palindrome");
    else
      System.out.println("Not Palindrome");

  }

9.Sum until Single Digit:

private int sum_until_single_digit(int no) {
    // TODO Auto-generated method stub
    int count = 0;
    int sum = 0;
    while (no > 0) {
      int rem = no % 10;
      sum = sum + rem;
      no = no / 10;
      count = count + 1;
    }
    System.out.println(sum);//39
     
    return sum; 
    
  }

10.Divisors:

wd.find_divisors(53);
wd.find_divisors(52);
private void find_divisors(int no) {
    // TODO Auto-generated method stub
    
    int div = 2; 
    int count  = 0; 
    while(div<no)
    {
    if(no%div==0)
      {
        System.out.println(div);
        count = count+1; 
        }
    div = div+1; 
    }
    System.out.println("No. of divisors is "+ count);
    if(count ==0)
      System.out.println("Prime Number");
    else
      System.out.println("Not Prime Number");
  }

11.Find_common_divisors:

 private void find_common_divisors(int no1, int no2) {
    // TODO Auto-generated method stub
    int div = 2; 
    //int small = 0;
    // Ternary Operator expression? result1: result2
    int small = no1<no2? no1: no2; 
    
    int greatest = 0; 
    while(div<=small)
    {
    if(no1%div==0 && no2%div==0) {
      System.out.println(div);
      greatest = div; //
    }
        
    div = div+1; 
    }
    System.out.println(greatest);
  }

12.Greatest_common_divisor:

private void greatest_common_divisor(int no1, int no2) {
    // TODO Auto-generated method stub
    int div = 2; 
    //int small = 0;
    // Ternary Operator expression? result1: result2
    int small = no1<no2? no1: no2; 
    
    int greatest = 0; 
    while(div<=small)
    {
    if(no1%div==0 && no2%div==0) {
      greatest = div; //
    }
        
    div = div+1; 
    }
    System.out.println("Greatest Common Divisor is " + greatest);
    
    
  }

13.Binary_to_decimal:

private void binary_to_decimal(int no) {
    int decimal = 0; 
    int power_value = 1; 
    while(no>0)
    {
    int rem = no%10; 
    decimal = decimal + (rem * power_value);
    no = no/10;
    power_value = power_value*2; 
    }
    System.out.println(decimal);
    
  }

14.Binary_to_decimal:

private void decimal_to_binary(int no) {
    
    String output = "";
    while(no>0)
      {
    int rem = no%2; 
    output = rem+output; //
    no = no/2; 
      }  
    System.out.println("Decimal to binary:"+output);
  }

15.Learn_wrapper:

 private void learn_wrapper() {
    // TODO Auto-generated method stub
    int a = 5; 
    Integer b = 10; 
    Short s = b.shortValue(); 
    System.out.println(s);
  }

16.LCM:

private void find_LCM(int no1, int no2) {
    // TODO Auto-generated method stub

    int big = no1>no2? no1: no2; 
    int no = 5; 
    while(true) //5>0
    {
    if(big%no1 ==0 && big%no2 ==0)
    {
    System.out.println("Least Common Multiple is "+ big);
    break;
    }
    big = big +1; 
    }

    
  }

17.Post and Pre Increment Operator:

private void post_pre_operators() {
    // TODO Auto-generated method stub
    
    int no1 = 10, no2 = 20; 
    System.out.println(no1++ + ++no1+no2++ + ++no2);
    
  }

18.Do while:

private void do_while_learning() {
    // TODO Auto-generated method stub
    // Even when the condition is false, 
    // do..while will get executed once. 
    // Exit Criteria loop
    int no=10; 
    do
    {
    System.out.println(no); 
    no++; 
    }while(no<=5); 
    System.out.println(no);
    
  }

19.For Loop:

 private void for_learning() {
    // TODO Auto-generated method stub
    for(int i=1; i<=5; i++)
    {
    System.out.println(i); 
    }
    
  }