Simple loop =========== public class Main { public static void main(String[] args) { int i = 10; while (i > 0) i--; System.out.println(i); } } Test the Day class ================== public class Day { private int year; private int month; private int day; public Day(int y, int m, int d) { year = y; month = m; day = d; } public String toString() { return day + "-" + month + "-" + year; } } public class Main { public static void main(String[] args) { Day d = new Day(2025, 9, 3); System.out.println(d); } } Constructor 1 OK? ================== public Day(int y, int m, int d) { year = y; month = m; day = d; } Constructor 2 OK? ================== public Day(int y, int m, int d) { int year = y; int month = m; int day = d; } Constructor 3 OK? ================== public Day(int y, int m, int d) { y = year; m = month; d = day; } Compilation errors ================== public class Main { // public static void main(String[] args) { // int sum = 0; // // for (int i=0; i<10; i++) // sum = sum + i; // // System.out.println(sum); // System.out.println(i); // // // } // // int m(int i) { // return i*2; // i++; // } // // int larger(int i, int j) // { // if (i>j) return i; // if (i<=j) return j; // } } 0.899999999 =========== public static void main(String[] args) { System.out.println(2.0-1.1); //output 0.8999999999999999 } casting ======= public static void main(String [] args) { int i=97; char c; c=(char)i; System.out.println(i); //output: 97 System.out.println(c); //output: a } Ability Test //Can try on https://repl.it/languages/cpp ============ #include using namespace std; ____ search_section (const int values[ ]____________________) { while (________) { } } int main() { const int arr[ ]={1,3,5,7,9,2,4,7,8,7}; cout << "Within arr[2..8], the value 7 occurs: "; cout << search_section(arr, 2, 8, 7); cout << " times"; return 0; } fibo ===== public class Main { public static int f(int n) { System.out.println(n); if (n == 0 || n == 1) return 1; else return f(n-1) + f(n-2); } public static void main(String[] args) { System.out.println( "Final result: "+f(5)); } }