Print calendar Program plan: Import necessary package. Create a class “Calendar”, Define the function “is_LeapYear()”, Check whether the year is multiple of “400”, If it is true, return “true”. Check whether the year is not multiple of “100”, If it is true, return “false”. Check whether the year is multiple of “4”, If it is true, return “true”. Otherwise, return “false”. Define the function “get_NDays()”, Check whether the month is “2”February, If it is “true”, Call the function to check whether the year is leap year, Return “29” as number of days. Otherwise, Return “28” as number of days. Check whether the month is either “4”(April) or “6”(June) or “9”(September) or “11”(November), Return “30” as number of days. Otherwise, Return “31” as number of days. Define “main()” function, Declare the necessary variables. Create “Scanner” object. Prompt the user to enter month and year. Get the month and year from the user. Assign the value return from “get_NDays()”. Print the heading. Create for loop to iterate over all days, Get the first day of month. Check whether day is “1”(Monday), Create “for” loop to iterate till the first day of month, Print space. Print the formatted output. Check whether the first day of month is “6”(Saturday), Print new line.

Question

Want to see the full answer?

Answer 1

Question

Chapter 5, Problem 14PP

Program Plan Intro

Print calendar

Program plan:

Import necessary package.

Create a class “Calendar”,

Define the function “is_LeapYear()”,

Check whether the year is multiple of “400”,

If it is true, return “true”.

Check whether the year is not multiple of “100”,

If it is true, return “false”.

Check whether the year is multiple of “4”,

If it is true, return “true”.

Otherwise, return “false”.

Define the function “get_NDays()”,

Check whether the month is “2”February,

If it is “true”, Call the function to check whether the year is leap year,

Return “29” as number of days.

Otherwise,

Return “28” as number of days.

Check whether the month is either “4”(April) or “6”(June) or “9”(September) or “11”(November),

Return “30” as number of days.

Otherwise,

Return “31” as number of days.

Define “main()” function,

Declare the necessary variables.

Create “Scanner” object.

Prompt the user to enter month and year.

Get the month and year from the user.

Assign the value return from “get_NDays()”.

Print the heading.

Create for loop to iterate over all days,

Get the first day of month.

Check whether day is “1”(Monday),

Create “for” loop to iterate till the first day of month,

Print space.

Print the formatted output.

Check whether the first day of month is “6”(Saturday),

Print new line.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

1. Create a Person.java file. Implement the public Person and Student classes in Person.java, including all the variables and methods in the UMLS. Person -name: String -street: String -city: String +Person(String name, String, street, String, city) +getName(): String +setName(String name): void +getStreet(): String +setStreet(String street): void +getCity(): String +setCity(String City): void +toString(): String Student -Id: int +Person(String name, String, street, String, city, int Id) +getId(): int +setId(int Id): void +toString(): String 2. Create a StudentTest.java file. Implement a public StudentTest class with a main method. In the main method, create one student object and print the object using System.out.println(). Your printing result must follow the example output: name: Mike, street: Morris Ave, city: Union, Id: 1000 Hint: You need to modify the toString methods in the Student class and Person class!

1) Apply the Paint Blue algorithm discussed in class to the following Finite Automata. a a a b b a COIS-3050H-R-W01-2025WI-COMB Formal Languages & Automata a b Show the status of the Finite Automata at the conclusion of the Paint Blue Algorithm (mark the visited states with an X and only include edges that have not been followed). 2) Use the pumping lemma to prove the following language is nonregular: L= {ab} = {abbb, aabbbbbb, aaabbbbbbbbb, ...}

3) Find CFGs that for these regular languages over the alphabet Σ= {a, b}. Draw a Finite Automata e CFG. 1 COIS-3050H-R-W01-2025WI-COMB Formal anguages & Automata Is that contain the substring aba. (b) The language of all words that have an odd number letters and contains the string bb. (c) The language of all words that begin with the substring ba and contains an odd number of letters. 4) Convert the following FA into a PDA. a a S± b a a Ν Ꮓ