Forem: Pavithra C

Day-2:Resume build in frontend

Pavithra C — Thu, 22 May 2025 18:06:00 +0000

<!DOCTYPE html>
<html lang="en">

<head>
    <meta charset="UTF-8">
    <meta name="viewport" content="width=z, initial-scale=1.0">
    <title>Resume</title>
    <style>
        .container {
            border: 1px solid;
            width: 60%;
            margin: auto;
            display: grid;
            grid-template-columns: 1fr 2fr;


        }

        .sidelayout {
            /* border: 1px solid green;*/
            background-color: #1a4c81;
            color: white;
            padding: 15px;


        }

        .mainlayout {
            /*border: 1px solid blue;*/
            padding: 15px;

        }

        .avatar img {
            width: 100px;
            border-radius: 50%;
        }

        .avatar {
            display: flex;
            justify-content: center;
        }

        table,
        th,
        td {
            border: 1px solid;
            border-collapse: collapse;
            padding: 10px;
        }

        h1 {
            text-align: center;
        }
    </style>
</head>

<body>
    <div class="container">
        <div class="sidelayout">
            <div class="avatar">
                <img src="/images/avator.jpg" alt="">

            </div>
            <h2>Contact</h2>
            <hr />
            <h3>INDIA,CHENNAI</h3>
            <h3>vijay@gmail.com</h3>
            <h3>Contact No : 1245******</h3>
            <h2>Skills</h2>
            <hr />
            <ul>
                <li>Java Full Statck</li>
                <li>selenium Testing</li>
                <li>English higher typewriting</li>
                <li>Excel</li>
                <li>c,c++</li>
            </ul>

            <h2>STRENGTH</h2>
            <hr />
            <ul>
                <li>Good Communication Skills</li>
                <li>Focused and confident with positive attitude</li>
                <li>Good team player</li>
                <li>self learning and self motivated person</li>
            </ul>

            <h2>Language</h2>
            <hr />
            <ul>
                <li>Tamil</li>
                <li>English</li>
            </ul>




        </div>


        <div class="mainlayout">
            <h1>Vijayaragavan Nandagopal</h1>
            <h2>CAREER OBJECTIVE</h2>
            <hr />
            <p>To succeed in an environment of growth and excellence and earn a job which provides me job Satisfaction
                and self development and help me achieve personal as well as organization goals.</p>
            <h2>Personal Details</h2>
            <hr />
            <ul>
                <li>Name:Your name</li>
                <li>Married:No</li>
                <li>Hobbies:</li>
                <ul>
                    <li>Reading</li>
                    <li>Swimming</li>
                    <li>Chess Playing</li>
                </ul>
            </ul>

            <h2>ACADEMIC Qualification</h2>
            <hr />
            <table>
                <thead>
                    <tr>
                        <th>Qualification</th>
                        <th>Board/University</th>
                        <th>School/Collage</th>
                        <th>Year Of passing</th>
                        <th>Marks</th>
                    </tr>

                </thead>
                <tbody>
                    <tr>
                        <td>MBA</td>
                        <td>University Name</td>
                        <td>College Name</td>
                        <td>2015</td>
                        <td>85%</td>
                    </tr>
                    <tr>
                        <td>MBA</td>
                        <td>University Name</td>
                        <td>College Name</td>
                        <td>2015</td>
                        <td>85%</td>
                    </tr>
                    <tr>
                        <td>MBA</td>
                        <td>University Name</td>
                        <td>College Name</td>
                        <td>2015</td>
                        <td>85%</td>

                    </tr>

                </tbody>
            </table>




        </div>

    </div>
</body>

</html>

output:

different between href and src

href (Hypertext Reference)

Full form: Hypertext Reference
Used in: , , , and tags.
Purpose: Specifies the URL or link destination to another resource.

<a href="https://example.com">Visit Example</a>

src (Source)

Full form: Source
Used in: , , <iframe>, <audio>, <video>, etc.</li> <li>Purpose: Specifies the source file to be embedded or displayed within the page. </li> </ul> <div class="highlight"><pre class="highlight plaintext"><code><img src="image.jpg" alt="My Image"> </code></pre></div> <p></p> <hr> <p><strong>Grid</strong><br> </p> <div class="highlight"><pre class="highlight plaintext"><code>1).container { display: grid; } 2).container { display: inline-grid; }[TBD] 3).container { display: grid; column-gap: 50px; } 4).container { display: grid; row-gap: 50px; } 5).item1 { grid-column-start: 1; grid-column-end: 3; }[TBD] 6).item1 { grid-row-start: 1; grid-row-end: 3; }[TBD] 7).item1 { grid-row: 1 / span 2; }[TBD] 8).grid-container { display: grid; grid-template-columns: auto auto auto auto; } </code></pre></div> <p></p> <p><strong>REFERENCE LINK:</strong><br> <a href="https://www.w3schools.com/css/css_grid_item.asp">https://www.w3schools.com/css/css_grid_item.asp</a></p>

Day-47:String

Pavithra C — Mon, 19 May 2025 17:54:13 +0000

** String Constant Pool in Java**

The String Constant Pool (also called the String Intern Pool) is a special area in the heap memory where Java stores string literals to optimize memory usage and improve performance.

String is Immutable:
Immutable: Non-Changeable

public class StringImmutableDemo {
    public static void main(String[] args) {
        String str = "Hello";

        System.out.println("Original String: " + str);

        // Try to change the string
        str.concat(" World");

        System.out.println("After concat without assignment: " + str);

        // Now assign the result to the string
        str = str.concat(" World");

        System.out.println("After concat with assignment: " + str);
    }
}

output:
Original String: Hello
After concat without assignment: Hello
After concat with assignment: Hello World

String citizen1 = "Singapore Citizen";
String citizen2 = "Indian";
String citizen3 = "Indian";
String citizen4 = "Indian";
String citizen5 = "Indian";

System.out.println(citizen1.hashCode());
System.out.println(citizen2.hashCode());
System.out.println(citizen3.hashCode());

citizen1 = "Singapore Citizen"; // Reassigning the same string again

System.out.println(citizen1.hashCode());
System.out.println(citizen2.hashCode());
System.out.println(citizen3.hashCode());

output:
-1143432508
-2081375228
-2081375228
-1143432508
-2081375228

-2081375228

Hash code:[TBD]
In Java, every object has a method called hashCode() which returns an integer. This integer is called the hash code of the object and is used to efficiently store and retrieve objects in data structures like HashMap, HashSet, and Hashtable.

What is a Hashing Algorithm?
A hashing algorithm is a function that takes input data (like a string, number, file, etc.) and converts it into a fixed-size value (usually an integer or a hexadecimal string), called a hash code or hash value.

The Luhn Algorithm, also known as the modulus 10 or mod 10 algorithm, is a simple checksum formula used to validate identification numbers, such as:

Credit card numbers
Debit card numbers
IMSI numbers (used in mobile phones)
National identification numbers

Purpose of the Luhn Algorithm
It helps detect simple errors like:

Typing a wrong digit
Swapping digits

How It Works (Step-by-Step)
Let's take an example: 4539 1488 0343 6467 (a credit card number)
Step 1: Start from the right, double every second digit

Card Number:        4 5 3 9  1 4 8 8  0 3 4 3  6 4 6 7
Index (L → R):      0 1 2 3  4 5 6 7  8 9 10 11 12 13 14 15
Double every 2nd:      ↑   ↑   ↑   ↑   ↑   ↑   ↑   ↑
Doubled Values:     4 10 3 18 1 8 8 16 0 6 4 6 6 8 6 14

Step 2: If any doubled value is greater than 9, subtract 9 from it

Adjusted:           4 1 3 9 1 8 8 7 0 6 4 3 6 8 6 5

Step 3: Sum all the digits

Total sum = 4 + 1 + 3 + 9 + 1 + 8 + 8 + 7 + 0 + 6 + 4 + 3 + 6 + 8 + 6 + 5 = 89

Step 4: If total sum mod 10 == 0, the number is valid

89 % 10 = 9 → ❌ Invalid

Day-46:Sorting

Pavithra C — Mon, 19 May 2025 16:48:01 +0000

Bubble sorting
Bubble Sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order. This process is repeated until the list is sorted.

notes:

package Sorting;

public class Example {
    public static void main(String[] args) {

    int[] a = {50,40,30,20,10}; 
    for(int i=0; i<a.length-1;i++)
    {
        if(a[i]>a[i+1])
        {
        int temp = a[i]; 
        a[i] = a[i+1]; 

        a[i+1] = temp; 
        }
    }
    for(int i=0; i<a.length; i++)
        System.out.print(a[i] + " "); 

    System.out.println("Maximum " + a[a.length-1]);
      }
}

output:
40 30 20 10 50 Maximum 50

notes2:

int[] a = {100,90,80,70,60,50,40,30,20,10}; 
        for(int j=1; j<a.length; j++)
        {
            for(int i=0; i<a.length-j;i++)
            {
                if(a[i]>a[i+1])
                {
                int temp = a[i]; 
                a[i] = a[i+1]; 
                a[i+1] = temp; 
                }
            }
        }

        for(int i=0; i<a.length; i++)
            System.out.print(a[i] + " ");

output:
10 20 30 40 50 60 70 80 90 100

Insertion sort
Insertion Sort is a simple sorting algorithm that sorts the array one element at a time by comparing it with the elements before it and inserting it into the correct position.

int[] arr = {5, 2, 4, 1, 3};

Step-by-step sorting:

Compare 2 with 5 → insert before 5 → [2, 5, 4, 1, 3]
Compare 4 → insert between 2 and 5 → [2, 4, 5, 1, 3]
Compare 1 → insert at beginning → [1, 2, 4, 5, 3]
Compare 3 → insert between 2 and 4 → [1, 2, 3, 4, 5]

[TBD]
public class InsertionSortExample {
    public static void main(String[] args) {
        int[] a = {100, 90, 80, 70, 60, 50, 40, 30, 20, 10};

        for (int j = 1; j < a.length; j++) {
            int key = a[j];
            int i = j - 1;

            // Move elements that are greater than key to one position ahead
            while (i >= 0 && a[i] > key) {
                a[i + 1] = a[i];
                i = i - 1;
            }

            a[i + 1] = key;
        }

        // Print sorted array
        for (int i = 0; i < a.length; i++)
            System.out.print(a[i] + " ");
    }
}

Merge sort:
Merge Sort is a divide and conquer algorithm.

Input array: [38, 27, 43, 3, 9, 82, 10]

Steps:

Split: [38, 27, 43] and [3, 9, 82, 10]
Recursively split until one element remains
Merge back in sorted order → Final result: [3, 9, 10, 27, 38, 43, 82]

[TBD]
public class MergeSortExample {

    // Function to merge two subarrays
    public static void merge(int[] arr, int left, int mid, int right) {
        int n1 = mid - left + 1;
        int n2 = right - mid;

        // Create temp arrays
        int[] L = new int[n1];
        int[] R = new int[n2];

        // Copy data
        for (int i = 0; i < n1; i++)
            L[i] = arr[left + i];
        for (int j = 0; j < n2; j++)
            R[j] = arr[mid + 1 + j];

        // Merge the temp arrays
        int i = 0, j = 0;
        int k = left;
        while (i < n1 && j < n2) {
            if (L[i] <= R[j]) {
                arr[k] = L[i];
                i++;
            } else {
                arr[k] = R[j];
                j++;
            }
            k++;
        }

        // Copy remaining elements
        while (i < n1) {
            arr[k] = L[i];
            i++;
            k++;
        }
        while (j < n2) {
            arr[k] = R[j];
            j++;
            k++;
        }
    }

    // Main mergeSort function
    public static void mergeSort(int[] arr, int left, int right) {
        if (left < right) {
            int mid = (left + right) / 2;

            // Sort first and second halves
            mergeSort(arr, left, mid);
            mergeSort(arr, mid + 1, right);

            // Merge sorted halves
            merge(arr, left, mid, right);
        }
    }

    public static void main(String[] args) {
        int[] arr = {38, 27, 43, 3, 9, 82, 10};

        mergeSort(arr, 0, arr.length - 1);

        // Print sorted array
        System.out.print("Sorted array: ");
        for (int i = 0; i < arr.length; i++)
            System.out.print(arr[i] + " ");
    }
}

Quick sort[TBD]
Quick Sort is a divide-and-conquer sorting algorithm.

It works by:
1.Choosing a pivot element from the array.
2.Partitioning the array so that:

Elements less than the pivot go to the left.
Elements greater than the pivot go to the right. 3.Then it recursively sorts the left and right parts.

Input: [30, 10, 50, 20, 60, 40]

Choose pivot = 40
Partition: [30, 10, 20] [40] [50, 60]
Then sort left and right recursively
Final result: [10, 20, 30, 40, 50, 60]

[TBD]
public class QuickSortExample {

    // Partition function
    public static int partition(int[] arr, int low, int high) {
        int pivot = arr[high]; // Choosing last element as pivot
        int i = low - 1; // Index of smaller element

        for (int j = low; j < high; j++) {
            if (arr[j] < pivot) {
                i++;

                // Swap arr[i] and arr[j]
                int temp = arr[i];
                arr[i] = arr[j];
                arr[j] = temp;
            }
        }

        // Swap arr[i+1] and pivot
        int temp = arr[i + 1];
        arr[i + 1] = arr[high];
        arr[high] = temp;

        return i + 1; // Return pivot index
    }

    // QuickSort function
    public static void quickSort(int[] arr, int low, int high) {
        if (low < high) {
            int pi = partition(arr, low, high);

            // Recursively sort left and right
            quickSort(arr, low, pi - 1);
            quickSort(arr, pi + 1, high);
        }
    }

    public static void main(String[] args) {
        int[] arr = {30, 10, 50, 20, 60, 40};

        quickSort(arr, 0, arr.length - 1);

        // Print sorted array
        System.out.print("Sorted array: ");
        for (int i = 0; i < arr.length; i++)
            System.out.print(arr[i] + " ");
    }
}

Binary search
Binary Search is an efficient algorithm for finding an element in a sorted array by repeatedly dividing the search interval in half.

It compares the target value to the middle element.
If they are not equal, it eliminates half of the array where the target cannot lie.
Repeats until the target is found or the search interval is empty.

package Sorting;

import java.util.Scanner;

public class Example4 {
public static void main(String[] args) {
    int[] ar = {10,56,78,87,99,100}; 
    Scanner sc = new Scanner(System.in); 
    System.out.println("Enter key to search: ");
    int key = sc.nextInt(); 

    int min = 0, max = ar.length-1; 
    while(min<=max)
    {
    int mid = (min + max)/2; 
    if(key == ar[mid])
        {
        System.out.println("Your key is present in index " + mid); 
        break; 
        }
    else if(key<ar[mid])
        {
        max = mid - 1; 
        }
    else
        {
        min = mid + 1; 
        }

    }
}
}

output:
Enter key to search:
56

Your key is present in index 1

Linear Search is the simplest searching algorithm. It checks each element in the array one by one from the beginning until it finds the target element or reaches the end.

public class LinearSearchExample {
    public static int linearSearch(int[] arr, int target) {
        for (int i = 0; i < arr.length; i++) {
            if (arr[i] == target) {
                return i;  // Return index if found
            }
        }
        return -1;  // Return -1 if not found
    }

    public static void main(String[] args) {
        int[] arr = {10, 25, 30, 45, 50};
        int target = 45;

        int result = linearSearch(arr, target);

        if (result == -1) {
            System.out.println("Element not found");
        } else {
            System.out.println("Element found at index: " + result);
        }
    }
}

output:
Element found at index: 3

Day-45:Pattern Program 2

Pavithra C — Sun, 18 May 2025 12:01:24 +0000

Notes1:

package Pattern;

public class Training11 {
public static void main(String[] args) {
    int no = 1; 
    for(int row=1; row<=5; row++)
    {
    for(int col= 1; col<=6-row; col++)
        {
        System.out.print(no+"  "); no++; //  1   2   3   4   5
        }
    System.out.println();
    }   
}
}

output:
1 2 3 4 5

6 7 8 9

10 11 12

13 14

15

Notes2:

package Pattern;

public class Training12 {
public static void main(String[] args) {
    for(int row=1; row<=5; row++)
    {
        for(int col= 1; col<=row; col++)
            {
            System.out.print(col+ " ");
            }
    System.out.println();
    }
}
}

output:
1
1 2
1 2 3
1 2 3 4
1 2 3 4 5

Notes3:

package Pattern;

public class Training13 {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        for(int row=1; row<=5; row++)
        {
        for(int col= 1; col<=row; col++)
            {
            System.out.print(6-col+" "); //  1   2   3   4   5
            }
        System.out.println();
        }
    }

}

output:
5
5 4
5 4 3
5 4 3 2
5 4 3 2 1

Notes4:

package Pattern;

public class Training14 {
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        for(int row=1; row<=5; row++)
        {
        for(int col= 1; col<=row; col++)
            {
            System.out.print(6-row+" "); //  1   2   3   4   5
            }
        System.out.println();
        }
    }
}

output:
5
4 4
3 3 3
2 2 2 2
1 1 1 1 1

Notes5:

package Pattern;

public class Training15 {
public static void main(String[] args) {
    for(int row=1; row<=5; row++)
    {
        for(int col=1; col<=5; col++)
            System.out.print(" "); 
    for(int col= 1; col<=6-row; col++)
        {
        System.out.print(row+col-1+" "); //  1   2   3   4   5
        }
    System.out.println();
    }
}
}

output:
1 2 3 4 5
2 3 4 5
3 4 5
4 5
5

Notes6:

package Pattern;

public class Training16 {
public static void main(String[] args) {
    for(int row=1; row<=5; row++)
    {
        for(int col=1; col<=row; col++)
            System.out.print("  "); 
    for(int col= 1; col<=6-row; col++)
        {
        System.out.print(row+col-1+" "); //  1   2   3   4   5
        }
    System.out.println();
    }
}
}

output:
1 2 3 4 5
2 3 4 5
3 4 5
4 5
5

Notes7:

package Pattern;

public class Training17 {
public static void main(String[] args) {
    for(int row=1; row<=5; row++)
    {
        for(int col=1; col<=row; col++)
            System.out.print(" "); 
    for(int col= 1; col<=6-row; col++)
        {
        System.out.print(col+" "); //  1   2   3   4   5
        }
    System.out.println();
    }   
}
}

output:
1 2 3 4 5
1 2 3 4
1 2 3
1 2
1

Notes8:

package Pattern;

public class Training18 {
public static void main(String[] args) {
    for(int row=1; row<=5; row++){
        for(int col= 1; col<=row-1; col++){
            System.out.print( col +" "); 
            }
        System.out.println();
        }
}
}

output:

1
1 2
1 2 3
1 2 3 4

Notes9:

package Pattern;

public class Training19 {
public static void main(String[] args) {
    for(int row=1; row<=5; row++){
        for(int col= 1; col<row; col++)
            {
            System.out.print( col +" "); 
            }
        for(int col=1; col<=10; col++)
             System.out.print("* "); 
        System.out.println();
        }
}
}

output:

1 * * * * * * * * * *
1 2 * * * * * * * * * *
1 2 3 * * * * * * * * * *
1 2 3 4 * * * * * * * * * *

Notes10:

package Pattern;

public class Training20 {
public static void main(String[] args) {
    for(int row=1; row<=5; row++){
        for(int col= 1; col<row; col++){
            System.out.print( col +" "); 
            }
        System.out.println("*");
        System.out.println();
        }
}
}

output:
*

1 *

1 2 *

1 2 3 *

1 2 3 4 *

Notes11:

package Pattern;

public class Training21 {
public static void main(String[] args) {
    for(int row=1; row<=5; row++){
        for(int col= 1; col<row; col++)
            {
            System.out.print( col +" "); 
            }
        for(int col=1; col<=6-row; col++)
             System.out.print("* "); 
        System.out.println();
        }
}
}

output:

1 * * * *
1 2 * * *
1 2 3 * *
1 2 3 4 *

Notes12:

package Pattern;

public class Training22 {
public static void main(String[] args) {
    for(int row=1; row<=5; row++){
        for(int col= 1; col<row; col++)
            {
            System.out.print( col +" "); 
            }
        for(int col=1; col<=6-row; col++)
             System.out.print(col+row-1+" "); 
        System.out.println();
        }
}
}

output:
1 2 3 4 5
1 2 3 4 5
1 2 3 4 5
1 2 3 4 5
1 2 3 4 5

Notes23:

package Pattern;

public class Training23 {
public static void main(String[] args) {
    for(int row=1; row<=5; row++){
        for(int col= 1; col<row; col++)
            {
            System.out.print( col +" "); 
            }
        for(int col=1; col<=6-row; col++)
             System.out.print(row+" "); 
        System.out.println();
        }
}
}

output:
1 1 1 1 1
1 2 2 2 2
1 2 3 3 3
1 2 3 4 4
1 2 3 4 5

Notes24:

package Pattern;

public class Training24 {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        for(int row=1; row<=5; row++){
            for(int col= 1; col<row; col++)
                {
                System.out.print("  "); 
                }
            for(int col=1; col<=6-row; col++)
                 System.out.print("* "); 
            System.out.println();
            }
    }

}

output:

* * * * * 
  * * * * 
    * * * 
      * * 
        *

Notes25:

package Pattern;

public class Training25 {
public static void main(String[] args) {
    for(int row=1; row<=5; row++){
        for(int col= 1; col<=6-row; col++)
            {
            System.out.print("  "); 
            }
        for(int col=1; col<=row; col++)
             System.out.print("* "); 
        System.out.println();
        }
}
}

output:

          * 
        * * 
      * * * 
    * * * * 
  * * * * *

Notes26:

package Pattern;

public class Training26 {
public static void main(String[] args) {
    for(int row=1; row<=5; row++){
        for(int col= 1; col<=6-row; col++)
            {
            System.out.print(" "); 
            }
        for(int col=1; col<=row; col++)
             System.out.print("* "); 
        System.out.println();
        }

}
}

output:


     * 
    * * 
   * * * 
  * * * * 
 * * * * *

Notes27:

package Pattern;

public class Training27 {
public static void main(String[] args) {
    for(int row=1; row<=5; row++){
        for(int col= 1; col<row; col++)
            {
            System.out.print(" "); 
            }
        for(int col=1; col<=6-row; col++)
             System.out.print("* "); 
        System.out.println();
        }
}
}

output:

* * * * * 
 * * * * 
  * * * 
   * * 
    *

Day-44:Pattern Program

Pavithra C — Sun, 18 May 2025 11:29:13 +0000

Notes1:

package Pattern;

public class Training {
public static void main(String[] args) {
    for(int end = 1; end<=5; end++)
    {
    for(int col = 1; col<=end; col++)     //1 2
        {
        System.out.print(col+" ");
        }
    System.out.println();  
    }
}
}

output:
1
1 2
1 2 3
1 2 3 4
1 2 3 4 5

Notes2:

package Pattern;

public class Training2 {
public static void main(String[] args) {
    for(int end = 5; end>=1; end--)
    {
    for(int col = 1; col<=end; col++)
        System.out.print(col + " "); 
    System.out.println(); 
    }
}
}

output:
1 2 3 4 5
1 2 3 4
1 2 3
1 2
1

Notes3:

package Pattern;

public class Training3 {
    public static void main(String[] args) {
        for(int end = 1; end<=5; end++)
        {
        for(int col = 1; col<=end; col++)
            System.out.print(end+" "); 
        System.out.println(); 
        }
    }
}

output:
1
2 2
3 3 3
4 4 4 4
5 5 5 5 5

Notes4:

package Pattern;

public class Training4 {
    public static void main(String[] args) {

        for(int row=1; row<=5; row++)
        {
        for(int col= 1 ; col<=6-row; col++) 
            {   
            System.out.print("* "); 
            }
        System.out.println();
        }
    }
}

output:

Notes5:

package Pattern;

public class Training5 {
public static void main(String[] args) {
    for(int row=1; row<=5; row++)
    {
    for(int col= 1; col<=6-row; col++)
        {
        System.out.print(col +" "); //  1   2   3   4   5
        }
    System.out.println();
    }
}
}

output:
1 2 3 4 5
1 2 3 4
1 2 3
1 2
1

Notes6:

package Pattern;

public class Training6 {
public static void main(String[] args) {
    for(int row=1; row<=5; row++)
    {
    for(int col= 1; col<=6-row; col++)
        {
        System.out.print(row+" "); //  1   2   3   4   5
        }
    System.out.println();
    }
}
}

output:
1 1 1 1 1
2 2 2 2
3 3 3
4 4
5

Notes7:

package Pattern;

public class Training7 {
public static void main(String[] args) {
    for(int row=1; row<=5; row++)
    {
    for(int col= 1; col<=6-row; col++)
        {
        System.out.print(col*row +" "); //  1   2   3   4   5
        }
    System.out.println();
    }
}
}

output:
1 2 3 4 5
2 4 6 8
3 6 9
4 8
5

notes8:

package Pattern;

public class Training8 {
public static void main(String[] args) {
    for(int row=1; row<=5; row++)
    {
    for(int col= 1; col<=6-row; col++)
        {
        System.out.print(row+col+" "); //  1   2   3   4   5
        }
    System.out.println();
    }
}
}

output:
2 3 4 5 6
3 4 5 6
4 5 6
5 6
6

notes9:

package Pattern;

public class Training9 {
    public static void main(String[] args) {
        for(int row=1; row<=5; row++)
        {
        for(int col= 1; col<=6-row; col++)
            {
            System.out.print(row+col-1+" "); 
            }
        System.out.println();
        }
    }
}

output:
1 2 3 4 5
2 3 4 5
3 4 5
4 5
5

Notes10:

package Pattern;

public class Training10 {
    public static void main(String[] args) {
        for(int row=1; row<=5; row++)
        {
        for(int col= 1; col<=6-row; col++)
            {
            System.out.print(6-col+" "); //  1   2   3   4   5
            }
        System.out.println();
        }
    }
}

output:
5 4 3 2 1
5 4 3 2
5 4 3
5 4
5

Day-43:Maximum and minimum and Dimensional Array

Pavithra C — Sun, 18 May 2025 07:19:57 +0000

Notes1:

package Array;

public class MaxValue {
public static void main(String[] args) {
    int[] marks = {88,73, 82,88,95}; 
    int max  = 0; 
    for(int i=0; i<marks.length; i++)
    {
        if(marks[i]>max)    
            max = marks[i]; 
    }
    System.out.println(max);
}
}

output:
95

Notes2:

package Array;

public class MaxValue2 {
public static void main(String[] args) {
    int[] marks = {-188,-873, 1082,788,995}; 
    int max  =  Integer.MIN_VALUE; 
    for(int i=0; i<marks.length; i++)
    {
        if(marks[i]>max)    
            max = marks[i]; 
    }
    System.out.println(max);
}
}

output:
1082

Notes3:

package Array;

public class MaxValue3 {
public static void main(String[] args) {
    int[] marks = {95,97,96,100,99}; 
    int max = marks[0];
    int second_max = marks[0]; 
    for(int i=1; i<marks.length; i++)
    {
    if(marks[i]>max)
        {
         second_max =   max;
         max = marks[i];            
        }
    else if(marks[i]> second_max)
        {
        second_max = marks[i];
        }
    }
    System.out.println(max); 
    System.out.println(second_max); 
}
}

output:
100
99

Notes4:

package Array;

public class MaxValue4 {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        int[] marks = {-95,-97,-96,-100,-99}; 
        int max = Integer.MIN_VALUE;
        int second_max = Integer.MIN_VALUE; 
        for(int i=0; i<marks.length; i++)
        {
        if(marks[i]>max)
            {
             second_max =   max;
             max = marks[i];          
            }
        else if(marks[i]> second_max)
            {
            second_max = marks[i];
            }
        }
        System.out.println(max); 
        System.out.println(second_max);
    }

}

output:
-95
-96

Notes5:

package Array;

public class MinValue {
    public static void main(String[] args) {
        int[] marks = {88,73, 82,88,95}; 
        int min  = 100; 
        for(int i=0; i<marks.length; i++)
        {
            if(marks[i]<min)    
                min = marks[i]; 
        }
        System.out.println(min);
    }

}

output:
73

Notes6:

package Array;

public class MinValue2 {
public static void main(String[] args) {
    int[] marks = {-188,-873, 1082,788,995}; 
    int min  =  Integer.MAX_VALUE; 
    for(int i=0; i<marks.length; i++)
    {
        if(marks[i]<min)    
            min = marks[i]; 
    }
    System.out.println(min);
}
}

output:
-873

Notes7:

package Array;

public class Dimension {
public static void main(String[] args) {
    int [] a = {10,20,30,40}; 
    int[] b = {40,50,60,70}; 
    int[] c = {70,80,90,100};

    int[][] ar = {a,b,c}; 
    System.out.println(ar.length);

     System.out.print(ar[0][0] + " "+ar[0][1]+" "+ar[0][2]+ " "+ar[0][3]);
     System.out.println();
     System.out.print(ar[1][0] + " "+ar[1][1]+" "+ar[1][2]+ " "+ar[1][3]);
     System.out.println();
     System.out.print(ar[2][0] + " "+ar[2][1]+" "+ar[2][2]+ " "+ar[2][3]);


}
}

output:
3
10 20 30 40
40 50 60 70
70 80 90 100

Notes8:

package Array;

public class Dimension2 {
public static void main(String[] args) {
    int [] a = {10,20,30,40}; 
    int[] b = {40,50,60,70}; 
    int[] c = {70,80,90,100};

    int[][] ar = {a,b,c}; 
    System.out.println(ar.length);
    int row=0;
    System.out.print(ar[row][0] + " "+ar[row][1]+" "+ar[row][2]+ " "+
    ar[row][3]);
            System.out.println(); 
            row++; 
    System.out.print(ar[row][0] + " "+ar[row][1]+" "+ar[row][2]+ " "+
    ar[row][3]);
            System.out.println();
            row++;
    System.out.print(ar[row][0] + " "+ar[row][1]+" "+ar[row][2]+ " "+ar[row][3]);

}
}

output:
3
10 20 30 40
40 50 60 70
70 80 90 100

Notes9:

package Array;

public class Dimension3 {
public static void main(String[] args) {
    int [] a = {10,20,30,40}; 
    int[] b = {40,50,60,70}; 
    int[] c = {70,80,90,100};

    int[][] ar = {a,b,c}; 
    System.out.println(ar.length);

for(int row=0; row<ar.length; row++)
{
System.out.print(ar[row][0] + " "+ar[row][1]+" "+ar[row][2]+ " "+
ar[row][3]);
    System.out.println();
}

}
}

output:
3
10 20 30 40
40 50 60 70
70 80 90 100

Notes10:

package Array;

public class Dimension4 {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        int [] a = {10,20,30,40}; 
        int[] b = {40,50,60,70}; 
        int[] c = {70,80,90,100};
        System.out.println(a.length);

        int[][] ar = {a,b,c};
        for(int col=0; col<ar[0].length; col++)
            System.out.print(ar[0][col]+" ");
        System.out.println();
        for(int col=0; col<ar[1].length; col++)
            System.out.print(ar[1][col]+" ");
        System.out.println();
        for(int col=0; col<ar[2].length; col++)
            System.out.print(ar[2][col]+" ");
    }

}

output:
3
10 20 30 40
40 50 60 70
70 80 90 100

Notes11:

package Array;

public class Dimension5 {
public static void main(String[] args) {
    int [] a = {10,20,30,40}; 
    int[] b = {40,50,60,70}; 
    int[] c = {70,80,90,100};
    System.out.println(a.length);

    int[][] ar = {a,b,c}; 
int row = 0; 
    for(int col=0; col<ar[row].length; col++)
        System.out.print(ar[row][col]+" ");
    System.out.println(); row++; 
    for(int col=0; col<ar[row].length; col++)
        System.out.print(ar[row][col]+" ");
    System.out.println();row++; 
    for(int col=0; col<ar[row].length; col++)
        System.out.print(ar[row][col]+" ");
}
}

output:
4
10 20 30 40
40 50 60 70
70 80 90 100

Notes12:

package Array;

public class Dimension6 {
public static void main(String[] args) {
    int [] a = {10,20,30,40}; 
    int[] b = {40,50,60,70}; 
    int[] c = {70,80,90,100};
    System.out.println(a.length);

    int[][] ar = {a,b,c}; 
for(int row = 0; row<ar.length; row++)
{
    for(int col=0; col<ar[row].length; col++)
        {
        System.out.print(ar[row][col]+" ");
        }
    System.out.println(); 
}
}
}

output:
4
10 20 30 40
40 50 60 70
70 80 90 100

Task:
int[] ar = { {10,20,30}, {40,50,60}, {70,80,90}};

1) Print only first column values - 10,40,70

package Array;

public class Task5 {
public static void main(String[] args) {



    int[][] ar = {{10,20,30},{40,50,60},{70,80,90}}; 
    System.out.println(ar.length);

    for (int i = 0; i < ar.length; i++) {
        System.out.println(ar[i][0]);
    }


}
}

output:
3
10
40
70

2) Calculate sum of diagonal values - 10+50+90

package Array;

public class Task6 {
public static void main(String[] args) {
    int[][] ar = {{10,20,30},{40,50,60},{70,80,90}}; 

    int total=0;
    for (int i = 0; i < ar.length; i++) {
          System.out.println(ar[i][i]);
          total=total+(ar[i][i]); 
    }

    System.out.println(total);
}
}

output:
10
50
90
150

3) Sum of each row

package Array;

public class Task7 {
public static void main(String[] args) {
    int[][] ar = {{10,20,30},{40,50,60},{70,80,90}}; 

    int total=0;
    for(int row = 0; row<ar.length; row++)
    {
        for(int col=0; col<ar[row].length; col++)
            {
            System.out.print(ar[row][col]+" ");
            total=total+(ar[row][col]);
            }
        System.out.println(); 
        System.out.println(total);
    }
}
}

output:
10 20 30
60
40 50 60
210
70 80 90
450

Day42:Post and Pre Increment Operators

Pavithra C — Sun, 18 May 2025 06:34:19 +0000

Notes1:

package IncrementOperators;

public class Post {
public static void main(String[] args) {
    int no = 1; 
    no = no+1;  //no+=1 --> no++; 
    System.out.println(no); //2

}
}

output:
2

Notes2:

package IncrementOperators;

public class Post2 {
public static void main(String[] args) {
    int no = 1; 
    System.out.println(no++);   //no = no+1; Post Increment Operator
    System.out.println(no); //2

}
}

output:
1
2

Notes3:

package IncrementOperators;

public class Post3 {
public static void main(String[] args) {
    int no = 1;

    System.out.println(no--);   
    System.out.println(no); 

}
}

output:
1
0

Notes4:

package IncrementOperators;

public class Post4 {
public static void main(String[] args) {
    int no = 10;
    System.out.println(no++ + no); 

}
}

output:
21

Notes5:

package IncrementOperators;

public class Post5 {
    public static void main(String[] args) {
        int no = 1; 
        while(no<=5)
        {
            System.out.println(no);
            no++; 
        }
    }

}

output:
1
2
3
4
5

Notes6:

package IncrementOperators;

public class Pre {
    public static void main(String[] args) {
        int no = 1;

        System.out.println(++no);   //no = no+1; Pre Increment Operator
        System.out.println(no); //2

    }

}

output:
2
2

Notes7:

package IncrementOperators;

public class Pre2 {
public static void main(String[] args) {
    int no = 1;

    System.out.println(--no);   //no = no+1; Pre Increment Operator
    System.out.println(no); //2

}
}

output:
0
0

Notes8:

package IncrementOperators;

public class Pre3 {
    public static void main(String[] args) {
    int no = 1; 
    while(no<=5)
    {
        System.out.println(no);
        ++no; 
    }
} 

}

output:
1
2
3
4
5

Notes9:

package IncrementOperators;

public class Pre4 {
public static void main(String[] args) {

    for(int no=1; no<=5; ++no)
        System.out.println(no);
}
}

output:
1
2
3
4
5

Notes10:

package IncrementOperators;

public class PrePost {
public static void main(String[] args) {
    int no = 10;
    //System.out.println(no++ + no++ + ++no + ++no + no-- + --no); 
    System.out.println(no++);   
    System.out.println(no++);   //11++
    System.out.println(++no);   //13
    System.out.println(++no);   //14
    System.out.println(no--);   //14
    System.out.println(--no);   //12              
}
}

output:
10
11
13
14
14
12

Notes11:

package IncrementOperators;

public class PrePost2 {
public static void main(String[] args) {
    int no1=10, no2=20; 
    System.out.println(no1++ + no2++ + no1-- + no2-- - --no1 - --no2);
    System.out.println(no1++);  //10
    System.out.println(no2++);  //20
    System.out.println(no1--);  //11
    System.out.println(no2--);  //21
    System.out.println(--no1);   //9
    System.out.println(--no2);//19
}
}

output:
34

Notes12:

package IncrementOperators;

public class PrePost3 {
    public static void main(String[] args) {
    int no = 1; 
    while(no<=5)    //2<=5
    {
        no++; 
        System.out.println(no);//2
        ++no;
} 
}
}

output:
2
4
6

Task:

package Array;

public class EbBill {
public static void main(String[] args) {
    int[] marks = {200,600,300,700,500}; 
    int max  = 0; 
    for(int i=0; i<marks.length; i++)
    {
        if(marks[i]>max)    
            max = marks[i]; 
    }   
    System.out.println(max);
}
}

output:
700

Day-41:Array Task

Pavithra C — Sun, 18 May 2025 05:44:01 +0000

Task:
1) Use scanner class to get your name and print it.

package Array;

import java.util.Scanner;

public class InputTest2 {
public static void main(String[] args) {
    Scanner scanner = new Scanner(System.in);
    System.out.println("Tell Me your name ");
    String name = scanner.nextLine();
    System.out.println("Welcome to Java "+ name);
}
}

output:
Tell Me your name
pavithra
Welcome to Java pavithra

2) Using scanner class, get 5 subjects marks as float and calculate Total, Percentage

package Array;

import java.util.Scanner;

public class Task2 {
     public static void main(String[] args) {

          Scanner sc = new Scanner(System.in);
          float[] marks = new float[5];
          float total=0;

          for(int i=0; i < marks.length; i++  ) {
            System.out.println("Enter Mark:");
            marks[i] = sc.nextInt();
            total=total+marks[i];


          }  
          float percentage=(total/500)*100;
          System.out.println("total:"+total);
          System.out.println("percentage:"+percentage);
         }

}

Output:

Enter Mark:
90
Enter Mark:
80
Enter Mark:
85
Enter Mark:
99
Enter Mark:
98
total:452.0
percentage:90.4

3) Create an array as below
int[] ar = new int[5];
Use for loop and print values of this array. Observe the result

package Array;
import java.util.Scanner;
public class Task3 {

     public static void main(String[] args) {


      int[] ar = new int[5];

      for (int i = 0; i<=ar.length; i++) {
       System.out.println("enter you number: " +i);

      }
     }

}

Output:

enter you number: 0
enter you number: 1
enter you number: 2
enter you number: 3
enter you number: 4
enter you number: 5

4)int[] marks = new int[5];
Get Marks from user (using Scanner) and store it in array. Print the values in reverse order. i.e., from last index to first index.

package Array;

import java.util.Scanner;

public class Task4 {
     public static void main(String[] args) {
          Scanner sc = new Scanner(System.in);
        //  Get Marks from user (using Scanner) and store it in array.  Print the values in reverse order.  i.e., from last index to first index.
          int[] marks = new int[5];

          for (int i = 0; i < marks.length; i++) {
           System.out.println("Enter your marks: ");
           marks[i] = sc.nextInt();



          }
          for (int j = marks.length-1; j >=0; j--) {
           System.out.println(marks[j]);
          }
         }
}

Output:

Enter your marks: 
90
Enter your marks: 
80
Enter your marks: 
70
Enter your marks: 
60
Enter your marks: 
87

87
60
70
80
90

Notes:

package Array;


import java.util.Scanner; // Import Scanner class from java.util

public class InputTest {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in); // Create Scanner object
        System.out.println("Enter Mark:");
        int mark1 = scanner.nextInt(); // Read integer input
        System.out.println("hi " + mark1); // Print the input value
    }
}

Output:
Enter Mark:
90
hi 90

Notes2:

package Array;

import java.util.Scanner;

public class InputTest2 {
public static void main(String[] args) {
    Scanner scanner = new Scanner(System.in);
    System.out.println("Tell Me your name ");
    String name = scanner.nextLine();
    System.out.println("Welcome to Java "+ name);
}
}

Output:
Tell Me your name
pavithra
Welcome to Java pavithra

Notes3:

package Array;

public class Mark {
    public static void main(String[] args) {

    int[] marks = new int[5]; 
    marks[0] = 90;  
    marks[1] = 95; 
    marks[2] = 100; 
    marks[3] = 78; 
    marks[4] = 94;

    int i =0; 
    while(i<5)
    {
    System.out.println(marks[i]); 
    i = i+1; 
    }
    }
}

output:
90
95
100
78
94

Notes4:

package Array;

public class Mark2 {
    public static void main(String[] args) {

        int[] marks = new int[5]; 
        marks[0] = 90;  
        marks[1] = 95; 
        marks[2] = 100; 
        marks[3] = 78; 
        marks[4] = 94;

        for(int i =0; i<marks.length; i = i+1)
        {
        System.out.println(marks[i]); 
        }
        }
}

Output:
90
95
100
78
94

Notes5:

package Array;

import java.util.Scanner;

public class Mark3 {
public static void main(String[] args) {
    Scanner scanner = new Scanner(System.in);
    int[] marks = new int[5];
    int i =0;
    int total=0;
    while(i<marks.length)
    {
    System.out.println("Enter Mark:"); 
    marks[i] = scanner.nextInt();
    total=total+marks[i];
    i+=1 ;
    }
    System.out.println(total);
}
}

Output:
Enter Mark:
80
Enter Mark:
50
Enter Mark:
89
Enter Mark:
90
Enter Mark:
86
395

Notes6:

package Array;

public class Mark4 {
    public static void main(String[] args) {
        int[] marks = {88,73, 82,88,95};
        int total=0;
         for(int i=0; i < marks.length; i++  ) 
         {
             total=total+marks[i];
         }
         System.out.println(total);
    }

}

output:
426

Notes7:

package Array;

public class Mark5 {
public static void main(String[] args) {
    int[] marks = {88,73, 82,88,95}; 
    int max  = 0; 
    if(88>max) max = 88; 
    if(73>max) max = 73;
    if(82>max) max = 82; 
    if(88>max) max = 88; 
    if(95>max) max = 95; 

    System.out.println(max);

}
}

output:
95

Notes8:

package Array;

public class Mark6 {
public static void main(String[] args) {
    int[] marks = {88,73, 82,88,95}; 
    int max  = 0; 
    if(marks[0]>max)    max = marks[0]; 
    if(marks[1]>max)    max = marks[1];
    if(marks[2]>max)    max = marks[2]; 
    if(marks[3]>max)    max = marks[3]; 
    if(marks[4]>max)    max = marks[4]; 

    System.out.println(max);

}
}

output:
95

Notes9:

package Array;

public class Mark7 {
public static void main(String[] args) {
    int[] marks = {88,73, 82,88,95}; 
    int max  = 0; 
    for(int i=0; i<marks.length; i++)
    {
        if(marks[i]>max)    
            max = marks[i]; 
    }   
    System.out.println(max);
}
}

output:
95

Day-40:Array in java

Pavithra C — Fri, 09 May 2025 01:03:26 +0000

Array
An array is a container object that holds a fixed number of values of a single type. The length of an array is established when the array is created. After creation, its length is fixed.

The following program, ArrayDemo, creates an array of integers, puts some values in the array, and prints each value to standard output.

class ArrayDemo {
    public static void main(String[] args) {
        // declares an array of integers
        int[] anArray;

        // allocates memory for 10 integers
        anArray = new int[10];

        // initialize first element
        anArray[0] = 100;
        // initialize second element
        anArray[1] = 200;
        // and so forth
        anArray[2] = 300;
        anArray[3] = 400;
        anArray[4] = 500;
        anArray[5] = 600;
        anArray[6] = 700;
        anArray[7] = 800;
        anArray[8] = 900;
        anArray[9] = 1000;

        System.out.println("Element at index 0: "
                           + anArray[0]);
        System.out.println("Element at index 1: "
                           + anArray[1]);
        System.out.println("Element at index 2: "
                           + anArray[2]);
        System.out.println("Element at index 3: "
                           + anArray[3]);
        System.out.println("Element at index 4: "
                           + anArray[4]);
        System.out.println("Element at index 5: "
                           + anArray[5]);
        System.out.println("Element at index 6: "
                           + anArray[6]);
        System.out.println("Element at index 7: "
                           + anArray[7]);
        System.out.println("Element at index 8: "
                           + anArray[8]);
        System.out.println("Element at index 9: "
                           + anArray[9]);
    }
}

output:

The output from this program is:

Element at index 0: 100
Element at index 1: 200
Element at index 2: 300
Element at index 3: 400
Element at index 4: 500
Element at index 5: 600
Element at index 6: 700
Element at index 7: 800
Element at index 8: 900
Element at index 9: 1000

Declaring a Variable to Refer to an Array

The preceding program declares an array (named anArray) with the following line of code:

// declares an array of integers
int[] anArray;

Like declarations for variables of other types, an array declaration has two components: the array's type and the array's name. An array's type is written as type[], where type is the data type of the contained elements; the brackets are special symbols indicating that this variable holds an array. The size of the array is not part of its type (which is why the brackets are empty).[TBD]

Similarly, you can declare arrays of other types:

byte[] anArrayOfBytes;
short[] anArrayOfShorts;
long[] anArrayOfLongs;
float[] anArrayOfFloats;
double[] anArrayOfDoubles;
boolean[] anArrayOfBooleans;
char[] anArrayOfChars;
String[] anArrayOfStrings;

public class Main {
    public static void main(String[] args)
    {

        // initializing array
        int[] arr = { 1, 2, 3, 4, 5 };

        // size of array
        int n = arr.length;

        // traversing array
        for (int i = 0; i < n; i++)
            System.out.print(arr[i] + " ");
    }
}

Create an Array To create an array, you need to allocate memory for it using the new keyword:

// Creating an array of 5 integers
int[] numbers = new int[5];

Access an Element of an Array[TBD] We can access array elements using their index, which starts from 0:

// Setting the first element of the array
numbers[0] = 10; 

// Accessing the first element
int firstElement = numbers[0];

Change an Array Element To change an element, assign a new value to a specific index:

    // Changing the first element to 20
    numbers[0] = 20;

Array Length We can get the length of an array using the length property:

    // Getting the length of the array
    int length = numbers.length;

Creating, Initializing, and Accessing an Arrays in Java

For understanding the array we need to understand how it actually works. To understand this follow the flow mentioned below:

Declare
Initialize
Access

1. Declaring an Array

Reference link:
https://docs.oracle.com/javase/tutorial/java/nutsandbolts/arrays.html

Day-39:While loop practice -5

Pavithra C — Thu, 08 May 2025 16:46:28 +0000

Example1:[TBD]

package While;

public class Div4 {

    public static void main(String[] args) {

        Looping l=new Looping();

        boolean prime=l.find_prime(17);

        if (prime==true) 
            System.out.println("Prime Number");

        else 
            System.out.println("Not Prime Number");
    }


    private boolean find_Prime(int no) {
        int div =2;
        while (div < no) {
            if (no % div == 0) 
            {
               return false;
            } 
            div++;
        }
        return true;

    }    
}

Example2:[TBD]

package While;

public class Basepower {

public static void main(String[] args) {
    Looping l =new Looping(); 

    int result = l.find_power(2,5);
    System.out.println(result); 

}
    public int find_power(int base, int power){
        int result = 1;
        while(power>0){
            result = result * base;
            power-=1;
        }
        return result;
    }



}

Example3:[TBD]

package While;

public class Smalldiv { 
    public static void main(String[] args) { 

        Looping l =new Looping(); 

         l.find_common_divisors(2,5);
    }

    private void find_common_divisors(int no1, int no2) {
    // TODO Auto-generated method stub
    int div = 2; 
    int small = 0; 
    if(no1<no2)
        small = no1; 
    else
        small = no2;

    while(div<=small)
    {
    if(no1%div == 0 && no2%div==0)
        System.out.println(div);
    div+=1;
    }       
}

}

Example4:

package While;

public class Smallbreakdiv {

public static void main(String[] args) { 

        Looping l =new Looping(); 

         l.find_common_divisors(2,5);
    }

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

Example5:

package While;

public class smalldiv2 {

public static void main(String[] args) { 

        Looping l =new Looping(); 

         l.find_common_divisors(2,5);
    }

    private void find_common_divisors(int no1, int no2) {
        // TODO Auto-generated method stub
        int last = 0; 
        int div = 2; 

        int small = no1 < no2 ? no1: no2; 
        while(div<=small)
        {
        if(no1%div == 0 && no2%div==0)
        {
            System.out.println(div); 
            last = div;     

        }
        div+=1;
        } 
        System.out.println("Greatest Common Divisor is "+ last);

    }
}

Day:38-While loop practice 4

Pavithra C — Wed, 07 May 2025 10:36:33 +0000

Example1:[TBD]

package While;

public class Eaten { 
public static void main(String[] args) {

    int total=8;
    int count=1; 

    while (count<=3) {
        eaten = total/2;
        total=total+eaten;
        count+=1;
    } 
    System.out.println(total);
    }

}

Example2:

package While;

public class Div {  
    public static void main(String[] args) {

    int no = 120;
    int div = 1;
    int count_of_divisors = 0;
    while (div<=no) {
        if(no%div == 0)
          { 
            //System.out.println(div);

            count_of_divisors+=1;
           }
        div+=1;
    }
System.out.println(count_of_divisors);
    }

}

output:
16

Example3:

package While;

public class Div2 {
    public static void findDivisors(int no) {
        int div = 2;
        int countOfDivisors = 0;

        while (div < no) {
            if (no % div == 0) {
                System.out.println(div);
                countOfDivisors++;
            }
            div++;
        }

        System.out.println(countOfDivisors);
    }

    public static void main(String[] args) {
        findDivisors(17);
    }

}

output:
0

Example4:

package While;

public class Div3 {
        public static boolean checkPrime(int no) {
            int countOfDivisors = 0;

            for (int div = 2; div < no; div++) {
                if (no % div == 0) {
                    System.out.println(div);
                    countOfDivisors++;
                }
            }

            if (countOfDivisors == 0) {
                return true;  // It's a prime number
            }
            return false;     // Not a prime number
        }

        public static void main(String[] args) {
            boolean result = checkPrime(120);

            if (result) {
                System.out.println("Prime Number");
            } else {
                System.out.println("Not Prime Number");
            }
        }


}

output:
2
3
4
5
6
8
10
12
15
20
24
30
40
60
Not Prime Number

Example5:

package While;

public class Box {  

        public static void main(String[] args) {
            double box = 1024;
            int securityCount = 0;

            while (box > 1) {
                box = box / 2;
                securityCount++;
            }

            System.out.println(securityCount);
        }



}

output:
10

Different between / and // in python

/ — Floating-point division
// — Floor division (Integer division)

/ — Floating-point division Always returns a float, even if the division is exact. Example:

print(10 / 2)   # Output: 5.0 (float)
print(7 / 2)    # Output: 3.5

// — Floor division (Integer division)
Returns the largest integer less than or equal to the result.[TBD]
Can return int or float depending on operands.
It truncates the decimal part.[TBD] Example:

print(10 // 2)  # Output: 5
print(7 // 2)   # Output: 3
print(-7 // 2)  # Output: -4 (floors toward negative infinity)

Day:37-While loop practice 3

Pavithra C — Tue, 06 May 2025 13:06:34 +0000

Example1:

package While;

public class Police { 
    public static void main(String[] args) {
        int police=0;
        int thief=40;

        while(police<thief) {
            thief=thief+3;
            police=police+5;

        }
        System.out.println(police);     
    } 

}

Output:
100

Example2:

package While;

public class Wrapper {

    public static void main(String[] args) {
        int choco=15;
        int wrapper=15;

        while(wrapper>=3) {
            wrapper= wrapper-3;
            choco=choco+1;
            wrapper=wrapper+1;
        }
        System.out.println(choco);
    }

}

Output:
22