Computers and Technology, 31.01.2022 08:50 carlosbs71

Please help! I will award any one who provides me with the correct code that produces no errors with brainliest! For this assignment, you will create a calendar program that allows the user
to enter a day, month, and year in three separate variables as shown below.
Day:
Month:
Year:
Then, your program should ask the user to select from a menu of choices
using this formatting
Menu:
1) Calculate the number of days in the given month.
2) calculate the number of days left in the given year.

Your program must include the three following functions:
leap_year
number_of_days
days_left

Parameters:
leap_year(y)
number_of_days(m, y)
days_left(d, m, y)

Sample Output 1:

Please enter a date
Menu:
1) Calculate the number of days in the given month.
2) Calculate the number of days left in the given year.
31

Sample Run 2:

Please enter a date
Day: 21
Month: 6
Year: 2016
Menu:
1) Calculate the number of days in the given month.
2) Calculate the number of days left in the given year.
2
193

Answers: 2

Show answers

Another question on Computers and Technology

Computers and Technology, 21.06.2019 19:30

Keep your choice of a major there is probably no single correct choice.

Answers: 1

Answer

Computers and Technology, 21.06.2019 22:30

What are compression artifacts? 1) visible defects in the picture caused by the nature of the compression algorithm. 2) numbers that tell a web server how much to compress a picture for faster transmission. 3) invisible defects in the picture preserved by lossless compression. 4) numbers that tell a photo editing program how much to compress a picture for faster transmission.

Answers: 3

Answer

Computers and Technology, 22.06.2019 05:20

Write a program called assignment3 (saved in a ﬁle assignment3.java) that computes the greatest common divisor of two given integers. one of the oldest numerical algorithms was described by the greek mathematician, euclid, in 300 b.c. it is a simple but very e↵ective algorithm that computes the greatest common divisor of two given integers. for instance, given integers 24 and 18, the greatest common divisor is 6, because 6 is the largest integer that divides evenly into both 24 and 18. we will denote the greatest common divisor of x and y as gcd(x, y). the algorithm is based on the clever idea that the gcd(x, y) = gcd(x ! y, y) if x > = y and gcd(x, y) = gcd(x, y ! x) if x < y. the algorithm consists of a series of steps (loop iterations) where the “larger” integer is replaced by the di↵erence of the larger and smaller integer. this continues until the two values are equal. that is then the gcd.

Answers: 3

Answer

Computers and Technology, 22.06.2019 07:30

Events and conditions that happen within an organization that are somewhat easier to deal with when responding to change are called

Answers: 1

Answer

You know the right answer?

Please help! I will award any one who provides me with the correct code that produces no errors with...

Questions