Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
838 views

Y Y Y Yyyyy Y Y Y! "# Y$%&' ( (%) '' '++%&''' Y, Y

The document contains 4 Java programs: 1. A program that checks if a year entered by the user is a leap year. 2. A program that displays leap years from 2001 to 2100, ten per line. 3. A program that prompts the user to enter a month and year and displays the number of days in that month. 4. A program that calculates and displays approximations of e for values of i from 10,000 to 100,000.

Uploaded by

Angela C
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
838 views

Y Y Y Yyyyy Y Y Y! "# Y$%&' ( (%) '' '++%&''' Y, Y

The document contains 4 Java programs: 1. A program that checks if a year entered by the user is a leap year. 2. A program that displays leap years from 2001 to 2100, ten per line. 3. A program that prompts the user to enter a month and year and displays the number of days in that month. 4. A program that calculates and displays approximations of e for values of i from 10,000 to 100,000.

Uploaded by

Angela C
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

1. Write a program that lets the user enter a year and checks whether it is a leap year.

A year is a
leap year if it is divisible by 4 but not 100 or if it is divisible by 400.

import java.util.Scanner;

public class Year {

public static void main(String[] args) {

Scanner keyboard=new Scanner(System.in);

int year;

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


year=keyboard.nextInt();

if (((year%4==0)&&(year%100!=0))||(year%400==0))

System.out.println(year+" is a leap year.");

else

System.out.println(year+" is not a leap year.");

}
}

2. Write a program that displays all the leap years, ten per line, in the twenty-first century (from
2001 to 2100).

public class Year {


public static void main(String[] args) {

int columnCounter=1;

for(int counter = 1; counter <= 10; columnCounter++) {

for(int year=2001; year<=2100; year++) {

if(((year%4==0)&&(year%100!=0))||(year%400==0))

columnCounter =colomns(year,column Counter);

break;
}
}

public static int colomns(int year, int columnCounter){

if(columnCounter < 10){


System.out.print(year + " ");
columnCounter++;
}
else{
System.out.println(year + " ");
columnCounter = 1;
}

return columnCounter;

3. Write a program that prompts the user to enter the month and year and displays the number of
days in the month. For example, if the user entered month 2 and year 2000, the program
should display that February 2000 has 29 days. If the user entered month 3 and year 2005, the
program should display that March 2005 has 31 days.
import java.util.Scanner;
public class Days {
   public static void main(String[] args) {
    Scanner keyboard = new Scanner (System.in);
    int m, y, month ;
    System.out.print("Enter month number: ");
    m=keyboard.nextInt();
    System.out.print("Enter year: ");
    y=keyboard.nextInt();

  String d = null;
  switch (m) {
   case 2: if (((y%4==0)&&(y%100!=0))||(y%400==0)){
     d="29";}
    else{
     d="28";};break;
   case 1:case 3:case 5:case 7:case 8:case 10:case 12:d="31";break;
   case 4:case 6:case 9:case 11:d="30";break;
   default:d="Invalid";break;}
  String g = null;
  switch (m) {
   case 1:g="January ";break;
   case 2:g="Febuary ";break;
   case 3:g="March ";break;
   case 4:g="April ";break;
   case 5:g="May ";break;
   case 6:g="June ";break;
   case 7:g="July ";break;
   case 8:g="August ";break;
   case 9:g="September ";break;
   case 10:g="October ";break;
   case 11:g="November ";break;
   case 12:g="December ";break;
   default:g="Invalid ";break;}
  System.out.println(g+y+" has "+d+" days. ");
  }
}

4. Computing e – You can approximate e by using the following series:

1 1 1 1
e=1+ + + +…+
1! 2 ! 3 ! i!

Write a program that displays the e value for i= 10000, 20000, ….. , and 100000.

Hint
1 1
Since i! = i x (i – 1) x ….. x 2 x 1, is . Initialize e and item to be 1 and keep
i ! i ( i−1 ) !
adding a new item to e. The new item is the previous item divided by i for i = 2, 3, 4, …. .

You might also like