Scribd
Upload
3 views5 pages

Java Programming: BMI, Fibonacci, Primes

This document contains 3 Java programs written by Ricky Sabharwal for their CSE1007 - Java Programming course. The first program calculates BMI based on user-input weight in kg and height in cm. The second program generates the Fibonacci series up to a number entered by the user. The third program prints all prime numbers within a range of numbers input by the user.

Uploaded by

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

Java Programming: BMI, Fibonacci, Primes

This document contains 3 Java programs written by Ricky Sabharwal for their CSE1007 - Java Programming course. The first program calculates BMI based on user-input weight in kg and height in cm. The second program generates the Fibonacci series up to a number entered by the user. The third program prints all prime numbers within a range of numbers input by the user.

Uploaded by

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

17BCE0159

Ricky Sabharwal
CSE1007 – Java Programming

Q1. Find BMI of a person by getting weight and height in kg and cm respectively from
user. [Formula BMI = kg/m2]

import [Link];
public class Bmi_17BCE0159 {
public static void main(String args[]) {
Scanner sc = new Scanner([Link]);
[Link]("Input weight in kilogram: ");
double weight = [Link]();
[Link]();("Input height in cm: ");
double height = [Link]();
height=height/100;
double BMI = weight / (height * height);
[Link](BMI + " kg/m2");
}
}
Q2. Generate Fibonacci Series by getting n value from user.

import [Link].*;

public class Fibo_17BCE0159


{
public static void main(String[] args)
{
Scanner sc = new Scanner([Link]);
int n = [Link]();
int a = 1,b=1;
int c;
if(n==1)
[Link](a+" ");
if(n==2)
[Link](a+" "+b);
[Link](a+" "+b+" ");
for(int i=2;i<n;i++)
{
c=a+b;
[Link](c+" ");
a=b;
b=c;
}
}
}
Q3. Print all prime numbers in a given range.

import [Link].*;
public class Prime_17BCE0159{
public static void main(String[] args)
{
Scanner sc = new Scanner([Link]);
int a, b, i, j,flag;
[Link]( "Enter lower bound of the interval: ");
a = [Link]();
[Link]( "\nEnter upper bound of the interval: ");
b = [Link]();
[Link]("\nPrime numbers between %d and %d are: ", a, b);
if (a == 1) {
[Link](a);
a++;
if (b >= 2) {
[Link](a);
a++;
}
}
if (a == 2)
[Link](a);
if (a % 2 == 0)
a++;
for (i = a; i <= b; i = i + 2) {
flag = 1;
for (j = 2; j * j <= i; ++j) {
if (i % j == 0) {
flag = 0;
break;
}
}
if (flag == 1)
[Link](i);
}

}
}

You might also like