Numerical Problems

Find Roots of a quadratic equation

import java.util.Scanner;
public class QuadraticEquation {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);

System.out.print("Enter the coefficient a: ");
double a = scanner.nextDouble();

System.out.print("Enter the coefficient b: ");
double b = scanner.nextDouble();


System.out.print("Enter the coefficient c: ");
double c = scanner.nextDouble();


double discriminant = b * b - 4 * a * c;
double root1, root2;


if (discriminant > 0) {
    root1 = (-b + Math.sqrt(discriminant)) / (2 * a);
    root2 = (-b - Math.sqrt(discriminant)) / (2 * a);
    System.out.println("The roots are real and different.");
    System.out.println("Root 1: " + root1);
    System.out.println("Root 2: " + root2);

        } else if (discriminant == 0) {

root1 = root2 = -b / (2 * a);
System.out.println("The roots are real and the same.");
System.out.println("Root 1 = Root 2: " + root1);
}
else {
double realPart = -b / (2 * a);
double imaginaryPart = Math.sqrt(-discriminant) / (2 * a);
System.out.println("The roots are complex and different.");

System.out.println("Root 1: " + realPart + " + " + imaginaryPart + "i");
System.out.println("Root 2: " + realPart + " - " + imaginaryPart + "i");
}

scanner.close();
}
}

**********************************************************
Learn switch case

import java.util.Scanner;

public class CaseStatementExample {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        System.out.println("Choose an option:");
        System.out.println("1. Say Hello");
        System.out.println("2. Display Date");
        System.out.println("3. Exit");

        int choice = scanner.nextInt();

        switch (choice) {
            case 1:
                System.out.println("Hello!");
                break;
            case 2:
                java.util.Date date = new java.util.Date();
                System.out.println("Current date and time: " + date.toString());
                break;
            case 3:
                System.out.println("Exiting the program...");
                break;
            default:
                System.out.println("Invalid choice! Please choose a valid option.");
                break;
        }

        scanner.close();
    }
}

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

Check for Prime

import java.util.Scanner;

public class PrimeChecker {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a number: ");
int number = scanner.nextInt();
if (isPrime(number)) {
System.out.println(number + " is a prime number.");
} else {
System.out.println(number + " is not a prime number.");
}
scanner.close();
}

public static boolean isPrime(int num) {
if (num <= 1) {
return false;
}

for (int i = 2; i <= Math.sqrt(num); i++) {
if (num % i == 0) {
    return false;
}
}
return true;
}
}
***********************************************
Fibonacci Series Using Recursion
import java.util.Scanner;

public class FibonacciSeries {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        System.out.print("Enter the number of terms: ");
        int terms = scanner.nextInt();

        System.out.println("Fibonacci Series up to " + terms + " terms:");

        for (int i = 0; i < terms; i++) {
            System.out.print(fibonacci(i) + " ");
        }

        scanner.close();
    }

    public static int fibonacci(int n) {
        if (n <= 1) {
            return n;
        }
        return fibonacci(n - 1) + fibonacci(n - 2);
    }
}
****************************************************
Prime number <1000 using nested loops
public class PrimeNumbers {
    public static void main(String[] args) {
        System.out.println("Prime numbers less than 1000:");

        for (int num = 2; num < 1000; num++) {
            boolean isPrime = true;

            for (int i = 2; i <= Math.sqrt(num); i++) {
                if (num % i == 0) {
                    isPrime = false;
                    break;
                }
            }

            if (isPrime) {
                System.out.print(num + " ");
            }
        }
    }
}

*************************************************************
gcd of two numbers using Euclid algorithm

import java.util.Scanner;

public class GCD {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        System.out.print("Enter the first number: ");
        int num1 = scanner.nextInt();

        System.out.print("Enter the second number: ");
        int num2 = scanner.nextInt();

        int gcd = findGCD(num1, num2);

        System.out.println("The GCD of " + num1 + " and " + num2 + " is: " + gcd);

        scanner.close();
    }

    public static int findGCD(int a, int b) {
        while (b != 0) {
            int temp = b;
            b = a % b;
            a = temp;
        }
        return a;
    }
}

***************************************************************************
Sum of digits, reverse and palindrome check

import java.util.Scanner;

public class DigitBasedOperations {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        System.out.print("Enter a positive integer: ");
        int number = scanner.nextInt();

        int sumOfDigits = calculateSumOfDigits(number);
        int reversedNumber = reverseNumber(number);
        boolean isPalindrome = checkPalindrome(number);

        System.out.println("Sum of digits: " + sumOfDigits);
        System.out.println("Reversed number: " + reversedNumber);
        System.out.println("Is palindrome: " + isPalindrome);

        scanner.close();
    }

    public static int calculateSumOfDigits(int num) {
        int sum = 0;
        while (num != 0) {
            sum += num % 10;
            num /= 10;
        }
        return sum;
    }

    public static int reverseNumber(int num) {
        int reversed = 0;
        while (num != 0) {
            int digit = num % 10;
            reversed = reversed * 10 + digit;
            num /= 10;
        }
        return reversed;
    }

    public static boolean checkPalindrome(int num) {
        return num == reverseNumber(num);
    }
}

Comments

Post a Comment

Popular posts from this blog

Introduction to Java Swing

Introduction to Java Swing Java Swing is a part of Java Foundation Classes (JFC) and provides a set of APIs for creating graphical user interfaces (GUIs) in Java. It is built on top of the Abstract Window Toolkit (AWT) and offers a richer set of GUI components. Swing is a platform-independent, lightweight toolkit that can be used to create window-based applications. Key Features of Swing Lightweight Components : Swing components are lightweight because they are written entirely in Java and do not rely on native platform components. Pluggable Look and Feel : Swing supports pluggable look and feel, which means you can change the appearance of your application to match different platforms (e.g., Windows, macOS, Linux) or create a custom look and feel. Component-based Architecture : Swing follows a component-based architecture, allowing for reusable, modular, and easily extendable components. MVC Architecture : Swing components follow the Model-View-Controller (MVC) design pattern, separa...
Read more

KTU OOP LAB JAVA CSL 203 BTech CS S3 - Dr Binu V P

About Me Scheme and Evaluation Syllabus and Practice Questions ******************************** How to do Java Programs in  Debian PART A Basic Java Programs Using Control  Statements 1.String Problems 2.Numerical Problems 3.Arrays 4.Matrix Lab Exercise Java-1 PART B  Object Oriented Programming 1.Creating classes and objects. constructor for initializing object 2.Method overloading in Java 3.Single Inheritance 4.Multilevel Inheritance 5.Method overriding in Java 6. Hierarchical Inheritance 7.Interface in Java 8.Abstract classes in java  PART C Exception and File Handling 1.Exception Handling in Java 2.Reading and Writing Text Files 3.Buffered Reader and String Tokenizer PART D Multi-Threading  Creating Threads in Java Thread Synchronization in Java Thread Priorities in Java Programs using Multi-Threading PART E Graphics and Database Programming Introduction to Java Swing Drawing Shapes Drawing  a Sine Wave Handling Mouse Events Handling Keyboard ...
Read more

JDBC Application Program

Write a program to accept rollno, name, CGPA of “n” students and store the data to a database using JDBC connectivity. Display the list of students having CGPA greater than 7. (Use MySQL /PostgreSQL). Steps: Set up MySQL Database : Ensure MySQL is running and create a database and table. Add MySQL Connector/J : Include the JDBC driver for MySQL in your project. Java Program : Write the Java program to interact with the database. 1. Set up MySQL Database Execute the following SQL commands to create a database and table: CREATE DATABASE studentdb; USE studentdb; CREATE TABLE students (     rollno INT PRIMARY KEY,     name VARCHAR(50),     cgpa FLOAT ); 2. Add MySQL Connector/J Dependency If you are using Gradle, add the following to your build.gradle implementation 'mysql:mysql-connector-java:8.0.33' 3.Java Program import java.sql.Connection; import java.sql.DriverManager; import java.sql.PreparedStatement; import java.sql.ResultSet; import java.sql.SQLExcept...
Read more