Scribd
Upload
15 views4 pages

Java Python All Programs

The document contains Java and Python code examples for basic programming tasks including printing 'Hello, World!', calculating the sum of two numbers, generating a Fibonacci series, and checking for prime numbers. Each task is presented with corresponding code snippets in both languages. These examples serve as foundational programming exercises for beginners.

Uploaded by

ckesava474
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
15 views4 pages

Java Python All Programs

The document contains Java and Python code examples for basic programming tasks including printing 'Hello, World!', calculating the sum of two numbers, generating a Fibonacci series, and checking for prime numbers. Each task is presented with corresponding code snippets in both languages. These examples serve as foundational programming exercises for beginners.

Uploaded by

ckesava474
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Java and Python Programs

Hello World

Java Code:

public class HelloWorld {

public static void main(String[] args) {

System.out.println("Hello, World!");

Python Code:

print("Hello, World!")

Sum of Two Numbers

Java Code:

import java.util.Scanner;

public class SumOfTwoNumbers {

public static void main(String[] args) {

Scanner sc = new Scanner(System.in);

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

int num1 = sc.nextInt();

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

int num2 = sc.nextInt();

int sum = num1 + num2;

System.out.println("Sum: " + sum);


}

Python Code:

num1 = int(input("Enter first number: "))

num2 = int(input("Enter second number: "))

sum = num1 + num2

print(f"Sum: {sum}")

Fibonacci Series

Java Code:

import java.util.Scanner;

public class FibonacciSeries {

public static void main(String[] args) {

Scanner sc = new Scanner(System.in);

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

int n = sc.nextInt();

int a = 0, b = 1;

System.out.print("Fibonacci Series: " + a + " " + b);

for (int i = 2; i < n; i++) {

int next = a + b;

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

a = b;

b = next;

}
}

Python Code:

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

a, b = 0, 1

print("Fibonacci Series:", a, b, end=" ")

for _ in range(2, n):

next = a + b

print(next, end=" ")

a, b = b, next

Prime Number Check

Java Code:

import java.util.Scanner;

public class PrimeCheck {

public static void main(String[] args) {

Scanner sc = new Scanner(System.in);

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

int num = sc.nextInt();

boolean isPrime = num > 1;

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

if (num % i == 0) {

isPrime = false;

break;

}
System.out.println(num + (isPrime ? " is a Prime Number" : " is not a Prime

Number"));

Python Code:

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

is_prime = num > 1

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

if num % i == 0:

is_prime = False

break

print(f"{num} is{' ' if is_prime else ' not '}a Prime Number")

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy