Commit 560ababb authored by Arsam Ali's avatar Arsam Ali

Task 2

parent c8703491
package Task2;
public class IsPrimeNumber {
public static void main(String[] args) {
int countPrimes = 0;
for (int i = 2; i < 10000; i++) {
if (isPrime(i)) countPrimes++;
}
System.out.println("Number of prime numbers less than 10000: " + countPrimes);
}
public static boolean isPrime(int number) {
return number > 1 && java.math.BigInteger.valueOf(number).isProbablePrime(50);
}
}
package Task2;
import java.util.Scanner;
public class Palindrome {
public static void main(String[] args) {
try (Scanner scanner = new Scanner(System.in)) {
System.out.print("Enter an integer: ");
int number = scanner.nextInt();
System.out.println(isPalindrome(number) ? "Palindrome" : "Not a palindrome");
}
}
public static boolean isPalindrome(int number) {
return number == reverse(number); // Use iterative reverse for simplicity
}
// Iterative reverse function for clarity
public static int reverse(int number) {
int reversed = 0;
while (number != 0) {
reversed = reversed * 10 + number % 10;
number /= 10;
}
return reversed;
}
}
package Task2;
public class PalindromePrimes {
public static void main(String[] args) {
int targetCount = 100;
int numbersPerLine = 10;
int count = 0;
for (int num = 2; count < targetCount; num++) { // Combine main logic for brevity
if (isPalindromicPrime(num)) {
System.out.print(num + " ");
count++;
if (count % numbersPerLine == 0) {
System.out.println();
}
}
}
}
public static boolean isPalindromicPrime(int num) {
return isPrime(num) && isPalindrome(num);
}
public static boolean isPrime(int num) {
if (num <= 1) { // Handle invalid cases upfront
return false;
}
for (int i = 2; i * i <= num; i++) { // Only check up to the square root
if (num % i == 0) {
return false;
}
}
return true;
}
public static boolean isPalindrome(int num) {
int reversed = 0;
int original = num;
while (num > 0) { // Reverse the number
reversed = reversed * 10 + num % 10;
num /= 10;
}
return reversed == original;
}
}
package Task2;
import java.util.Scanner;
public class PasswordChecker {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a password: ");
String password = scanner.nextLine();
boolean valid = password.length() >= 8 && password.matches("[a-zA-Z0-9]*") && password.replaceAll("[^0-9]", "").length() >= 2;
if (valid) {
System.out.println("Valid Password");
} else {
System.out.println("Invalid Password");
}
}
}
package Task2;
public class PatternDisplay {
public static void main(String[] args) {
displayPattern(5);
}
public static void displayPattern(int n) {
for (int i = 1; i <= n; i++) {
// Print leading spaces
for (int j = 1; j <= n - i; j++) {
System.out.print(" ");
}
// Print numbers in descending order
for (int k = i; k >= 1; k--) {
System.out.print(k + " ");
}
System.out.println();
}
}
}
package Task2;
import java.util.Scanner;
public class RandomMatrix {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter number: ");
int n = scanner.nextInt();
for (int i = 0; i < n; i++) { // Combine logic for brevity
for (int j = 0; j < n; j++) {
System.out.print((int) (Math.random() * 2) + " ");
}
System.out.println();
}
}
}
package Task2;
import java.util.Scanner;
public class ReverseInteger {
public static void main(String[] args) {
try (Scanner scanner = new Scanner(System.in)) { // Use try-with-resources for cleaner resource management
System.out.print("Enter an integer: ");
int number = scanner.nextInt();
System.out.print("The reversed integer is: ");
reverse(number); // Use iterative reverse for clarity
}
}
public static void reverse(int number) {
int reversed = 0;
while (number != 0) {
reversed = reversed * 10 + number % 10; // Build the reversed number digit by digit
number /= 10; // Remove the last digit from the original number
}
System.out.println(reversed);
}
}
package Task2;
public class SeriesComputation {
public static void main(String[] args) {
System.out.println("i\tm(i)");
System.out.println("----------");
for (int a = 1; a <= 20; a++) {
double m = 0; // Initialize m within the loop for clarity
for (int j = 1; j <= a; j++) {
m += j / (double) (j + 1); // Cast to double for accuracy
}
System.out.printf("%d\t%.4f\n", a, m);
}
}
}
package Task2;
import java.util.Scanner;
public class SortedNumbers {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter three numbers: ");
double input1 = scanner.nextDouble();
double input2 = scanner.nextDouble();
double input3 = scanner.nextDouble();
System.out.println("Numbers in increasing order:");
if (input1 <= input2 && input1 <= input3) {
if (input2 <= input3) {
System.out.println(input1 + ", " + input2 + ", " + input3);
} else {
System.out.println(input1 + ", " + input3 + ", " + input2);
}
} else if (input2 <= input1 && input2 <= input3) {
if (input1 <= input3) {
System.out.println(input2 + ", " + input1 + ", " + input3);
} else {
System.out.println(input2 + ", " + input3 + ", " + input1);
}
} else {
if (input1 <= input2) {
System.out.println(input3 + ", " + input1 + ", " + input2);
} else {
System.out.println(input3 + ", " + input2 + ", " + input1);
}
}
}
}
package Task2;
public class pentagonal {
public static void main(String[] args) {
int count = 0;
for (int i = 1; i <= 100; i++) {
System.out.printf("%7d", getPentagonalNumber(i));
count++;
if (count % 10 == 0) {
System.out.println();
count = 0;
}
}
}
public static int getPentagonalNumber(int n) {
return n * (3 * n - 1) / 2;
}
}
package org.example;
package org.Task1;
import java.util.Scanner;
......
package org.example;
package org.Task1;
import java.util.Scanner;
......
package org.example;
package org.Task1;
import java.util.Scanner;
......
package org.example;
package org.Task1;
import java.util.Scanner;
......
package org.example;
package org.Task1;
public class JavaDiagram {
......
package org.example;
package org.Task1;
import java.util.Scanner;
......
package org.example;
package org.Task1;
import java.util.Random;
......
package org.example;
package org.Task1;
public class PopulationOfUs {
public static void main(String[] args) {
......
package org.example;
package org.Task1;
import java.util.Scanner;
......
package org.example;
package org.Task1;
import java.util.Scanner;
......
package org.example;
package org.Task1;
public class SpeedMeter {
......
package org.example;
package org.Task1;
import java.util.Scanner;
......
package org.example;
package org.Task1;
public class TableofAndNumeric {
......
package org.example;
package org.Task1;
import java.util.Scanner;
......
File deleted
File deleted
File deleted
File deleted
File deleted
File deleted
File deleted
File deleted
File deleted
File deleted
File deleted
File deleted
File deleted
File deleted
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment