Wednesday, April 29, 2026

Some Important Java and Python Programs

 Prepared By: Uday Shah 

Ruparel Education Pvt. Ltd – (HOD-IT)

Asst. Prof., 

Faculty of Computer Applications,

Nobile University


Some Important Java and Python Programs


Armstrong Number Program.. 2

Python Program (Armstrong) 2

2. Palindrome Number Program.. 3

Python Program (Palindrome) 4

# Python program to perform insertion, deletion, searching, and traversal on Python List (used as Dynamic Array) 4

Java Program: Banking Application with Exception Handling. 6

Java Program: Student Class with Static Count 8

Java Program: Prime Numbers Between Start and End. 9

Java Program: Palindrome Number. 10

Java Program: Sort Array in Ascending Order. 11

Python Program: Prime Numbers Between Start and End. 12

3. Python Program: Palindrome Number. 12

Python Program: Sort Array in Ascending Order. 12


Java Program (Armstrong)

import java.util.Scanner;

 

public class ArmstrongNumber

{

             public static void main(String[] args)

{

                         Scanner sc = new Scanner(System.in);

                         System.out.print("Enter a number: ");

                         int num = sc.nextInt();

                         int original = num;

                         int result = 0;

                         int digits = String.valueOf(num).length();

                         while (num != 0)

{

                                     int rem = num % 10;

                                     result += Math.pow(rem, digits);

                                     num /= 10;

                         }

                         if (result == original)

{

                                     System.out.println("Armstrong Number");

                         }

else

{

                                     System.out.println("Not Armstrong Number");

                         }

             }

}

Python Program (Armstrong)

num = int(input("Enter a number: "))

original = num

result = 0

 

digits = len(str(num))

 

while num != 0:

    rem = num % 10

    result += rem ** digits

    num //= 10

 

if result == original:

    print("Armstrong Number")

else:

    print("Not Armstrong Number")

 

2. Palindrome Number Program

Definition:
A palindrome number is a number that reads the same forward and backward.
Example: 121, 1331

Java Program (Palindrome)

import java.util.Scanner;

 

public class PalindromeNumber

{

             public static void main(String[] args)

{

                         Scanner sc = new Scanner(System.in);

 

                         System.out.print("Enter a number: ");

                         int num = sc.nextInt();

                         int original = num;

                         int reverse = 0;

 

                         while (num != 0)

{

                                     int rem = num % 10;

                                     reverse = reverse * 10 + rem;

                                     num /= 10;

                         }

 

                         if (original == reverse)

{

                                     System.out.println("Palindrome Number");

                         }

else

{

                                     System.out.println("Not Palindrome Number");

                         }

             }

}

Python Program (Palindrome)

num = int(input("Enter a number: "))

original = num

reverse = 0

 

while num != 0:

    rem = num % 10

    reverse = reverse * 10 + rem

    num //= 10

 

if original == reverse:

    print("Palindrome Number")

else:

    print("Not Palindrome Number")

 

# Python program to perform insertion, deletion, searching, and traversal on Python List (used as Dynamic Array)

 

# Create an empty list

arr = []

 

# Insertion

arr.append(10)

arr.append(20)

arr.append(30)

arr.insert(1, 15)   # Insert 15 at index 1

 

print("List after insertion:", arr)

 

# Deletion

arr.remove(20)      # Remove value 20

del arr[0]          # Delete element at index 0

 

print("List after deletion:", arr)

 

# Searching

key = 30

 

if key in arr:

    print(key, "found at index", arr.index(key))

else:

    print(key, "not found")

 

# Traversal

print("Traversing list elements:")

for item in arr:

    print(item)

 

# Python program to evaluate postfix expression using stack

 

def evaluate_postfix(expression):

    stack = []

 

    for ch in expression.split():

        if ch.isdigit():   # If operand, push into stack

            stack.append(int(ch))

        else:

            val2 = stack.pop()

            val1 = stack.pop()

 

            if ch == '+':

                stack.append(val1 + val2)

            elif ch == '-':

                stack.append(val1 - val2)

            elif ch == '*':

                stack.append(val1 * val2)

            elif ch == '/':

                stack.append(val1 / val2)

            elif ch == '%':

                stack.append(val1 % val2)

 

    return stack.pop()

 

# Input postfix expression

exp = "5 3 + 2 * 4 /"

 

result = evaluate_postfix(exp)

 

print("Postfix Expression :", exp)

print("Result =", result)


 

Java Program: Banking Application with Exception Handling

// Custom Exception Class

 

class InsufficientFundException extends Exception

{

             public InsufficientFundException(String message)

{

                         super(message);

             }

}

 

// Bank Class

class BankAccount

{

             double balance;

             // Constructor

            BankAccount(double balance)

{

                         this.balance = balance;

             }

 

             // Deposit Method

             void deposit(double amount)

{

                         balance += amount;

                         System.out.println("Deposited: Rs " + amount);

                         System.out.println("Current Balance: Rs " + balance);

             }

 

             // Withdraw Method

             void withdraw(double amount) throws InsufficientFundException

{

                         if (amount > balance)

{

                                    throw new InsufficientFundException("Not Sufficient Fund");

                         }

else

{

                                     balance -= amount;

                                     System.out.println("Withdrawn: Rs " + amount);

                                     System.out.println("Remaining Balance: Rs " + balance);

                         }

             }

}

 

// Main Class

 

public class BankingApp

{

             public static void main(String[] args)

{

                         BankAccount account = new BankAccount(0);

                         try

{

                                     // Deposit Rs 1000

                                     account.deposit(1000);

 

                                     // Withdraw Rs 400

                                     account.withdraw(400);

 

                                     // Withdraw Rs 300

                                     account.withdraw(300);

 

                                     // Withdraw Rs 500 (should throw exception)

                                     account.withdraw(500);

 

                         } catch (InsufficientFundException e)

{

                                     System.out.println("Exception: " + e.getMessage());

                         }

             }

}

 

Output Example

Deposited: Rs 1000

Current Balance: Rs 1000

Withdrawn: Rs 400

Remaining Balance: Rs 600

Withdrawn: Rs 300

Remaining Balance: Rs 300

Exception: Not Sufficient Fund


 

Java Program: Student Class with Static Count

// Student Class

class Student

{

// Instance variables

             int enrollmentNo;

             String name;

             String gender;

             double marks;

 

             // Static variable to count objects

             static int count = 0;

 

            // Constructor

             Student(int enrollmentNo, String name, String gender, double marks)

{

                         this.enrollmentNo = enrollmentNo;

                         this.name = name;

                         this.gender = gender;

                         this.marks = marks;

                         count++;  // Increment count when object is created

             }

 

             // Display method

             void display()

{

                         System.out.println("Enrollment No: " + enrollmentNo);

                         System.out.println("Name: " + name);

                         System.out.println("Gender: " + gender);

                         System.out.println("Marks: " + marks);

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

             }

}

 

// Main Class

public class StudentDemo

{

             public static void main(String[] args)

{

                         // Creating objects

                         Student s1 = new Student(101, "Uday", "Male", 85.5);

                         Student s2 = new Student(102, "Riya", "Female", 90.0);

                         Student s3 = new Student(103, "Amit", "Male", 78.0);

 

                         // Display student details

                         s1.display();

                         s2.display();

                         s3.display();

 

                         // Display total count of objects

                         System.out.println("Total Students: " + Student.count);

             }

}

 

Output Example

Enrollment No: 101

Name: Uday

Gender: Male

Marks: 85.5

---------------------------

Enrollment No: 102

Name: Riya

Gender: Female

Marks: 90.0

---------------------------

Enrollment No: 103

Name: Amit

Gender: Male

Marks: 78.0

---------------------------

Total Students: 3

 

Java Program: Prime Numbers Between Start and End

import java.util.Scanner;

 

public class PrimeRange

{

             public static void main(String[] args)

{

                         Scanner sc = new Scanner(System.in);

                         System.out.print("Enter start number: ");

                         int start = sc.nextInt();

           

                         System.out.print("Enter end number: ");

                         int end = sc.nextInt();

           

                         System.out.println("Prime numbers are:");

                         for (int i = start; i <= end; i++)

{

                                     if (i < 2) continue;

                                     boolean isPrime = true;

                                     for (int j = 2; j <= Math.sqrt(i); j++)

{

                                                  if (i % j == 0)

{

                                                              isPrime = false;

                                                              break;

                                                  }

                                     }

                                     if (isPrime)

{

                                                  System.out.print(i + " ");

                                     }

                         }

             }

}

Java Program: Palindrome Number

import java.util.Scanner;

 

public class PalindromeNumber

{

             public static void main(String[] args)

{

                         Scanner sc = new Scanner(System.in);

System.out.print("Enter a number: ");

                         int num = sc.nextInt();

 

                         int original = num;

                         int reverse = 0;

 

                         while (num != 0)

{

                                     int digit = num % 10;

                         reverse = reverse * 10 + digit;

                                     num = num / 10;

                         }

 

                         if (original == reverse)

{

                                     System.out.println("Palindrome Number");

}

else

{

                                     System.out.println("Not a Palindrome Number");

                         }          

             }

}

Java Program: Sort Array in Ascending Order

import java.util.Scanner;

 

public class SortArray

{

             public static void main(String[] args)

{

                         Scanner sc = new Scanner(System.in);

                         System.out.print("Enter number of elements: ");

                         int n = sc.nextInt();

 

int arr[] = new int[n];

                         System.out.println("Enter elements:");

                         for (int i = 0; i < n; i++)

{

                                     arr[i] = sc.nextInt();

                         }

                         // Sorting (Bubble Sort)

                         for (int i = 0; i < n - 1; i++)

{

                                     for (int j = 0; j < n - i - 1; j++)

{

                                                  if (arr[j] > arr[j + 1])

{

                                                              // Swap

                                                              int temp = arr[j];

                                                              arr[j] = arr[j + 1];

                                                              arr[j + 1] = temp;

                                                  }

                                     }

                         }

 

                         System.out.println("Sorted Array:");

                         for (int i = 0; i < n; i++)

{

                                     System.out.print(arr[i] + " ");

                         }

             }

}

 

Python Program: Prime Numbers Between Start and End

start = int(input("Enter start number: "))

end = int(input("Enter end number: "))

 

print("Prime numbers are:")

 

for i in range(start, end + 1):

    if i < 2:

        continue

 

    is_prime = True

 

    for j in range(2, int(i ** 0.5) + 1):

        if i % j == 0:

            is_prime = False

            break

 

    if is_prime:

        print(i, end=" ")

3. Python Program: Palindrome Number

num = int(input("Enter a number: "))

 

original = num

reverse = 0

 

while num != 0:

    digit = num % 10

    reverse = reverse * 10 + digit

    num = num // 10

 

if original == reverse:

    print("Palindrome Number")

else:

    print("Not a Palindrome Number")

Python Program: Sort Array in Ascending Order

n = int(input("Enter number of elements: "))

 

arr = []

 

print("Enter elements:")

for i in range(n):

    arr.append(int(input()))

 

# Bubble Sort

for i in range(n - 1):

    for j in range(n - i - 1):

        if arr[j] > arr[j + 1]:

            arr[j], arr[j + 1] = arr[j + 1], arr[j]

 

print("Sorted Array:")

for i in arr:

    print(i, end=" ")

 

 ::: Best of Luck ::