1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
Norma-Jean [14]
3 years ago
10

A year in the modern Gregorian Calendar consists of 365 days. In reality, the earth takes longer to rotate around the sun. To ac

count for the difference in time, every 4 years, a leap year takes place. A leap year is when a year has 366 days: An extra day, February 29th. The requirements for a given year to be a leap year are:
1) The year must be divisible by 4

2) If the year is a century year (1700, 1800, etc.), the year must be evenly divisible by 400

Some example leap years are 1600, 1712, and 2016.

Write a program that takes in a year and determines whether that year is a leap year.

Ex: If the input is:

1712
the output is:

1712 - leap year
Ex: If the input is:

1913
the output is:

1913 - not a leap year
LABACTIVITY

5.24.1: LAB: Leap year

0 / 10

main.py

Load default template...

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

else

isLeapYear = false;

}

else

isLeapYear = true;

}

else

isLeapYear = false;

if(isLeapYear)

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

else

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

}
Computers and Technology
1 answer:
alexgriva [62]3 years ago
5 0

Answer:

hmmmmmmmmmmmmmmmmmmmmmmmmmmm

You might be interested in
Describe the conceptual design.
drek231 [11]

Answer:

Conceptual design is the first stage that involves defining a concept.

Explanation:

In the conceptual design phase it is important to understand the needs, doing research and find out how to meet them defining models and plans. In this stage, you have to define the steps you will need to take to develop the design and identify the challenges you may face in order to be prepare.

7 0
3 years ago
Read 2 more answers
2.Consider the following algorithm and A is a 2-D array of size ???? × ????: int any_equal(int n, int A[][]) { int i, j, k, m; f
Elis [28]

Answer:

(a) What is the best case time complexity of the algorithm (assuming n > 1)?

Answer: O(1)

(b) What is the worst case time complexity of the algorithm?

Answer: O(n^4)

Explanation:

(a) In the best case, the if condition will be true, the program will only run once and return so complexity of the algorithm is O(1) .

(b) In the worst case, the program will run n^4 times so complexity of the algorithm is O(n^4).

5 0
3 years ago
What Intel socket recommends the use of a liquid cooling system?
Marizza181 [45]
The Intel socket that Intel recommends you use a liquid-cooling system on is the LGA2011.
5 0
3 years ago
Is recursion ever required to solve a problem? What other approach can you use to solve a problem that is repetitive in nature?
Setler79 [48]

Answer:

No you can not tell that recursion is ever required to solve a problem.

Recursion is required when in the problem, the solution of the input depends on the solution of the subsets of the input.

Iteration is also another form of repetitive approach we follow to solve that kind of problems.

But the difference between recursion and iteration is :

  • In recursion we call the function repeatedly to return the result to next level.
  • In iteration certain bunch of instructions in a loop are executed until certain conditions met.

Explanation:

For example in the Fibonacci sequence problem, to find f_{n}, we need to compute f_{n-1} and f_{n-2} before that.

  • In case of recursion we just call the method Fibonacci(n) repeatedly only changing the parameter Fibonacci(n-1), that calculates the value and return it.

                           Fibonacci(n)

                           1. if(n==0 or n==1)

                           2.       return 1.

                           3.else

                           4.      return( Fibonacci(n-1)+Fibonacci(n-1) )

  • But in case of iteration we run a loop for i=2 to n, within which we add the value of current f_{i-1} and f_{i-2} to find the value of f_{i}

                           Fibonacci(n)

                           1. if(n<=2)

                           2.    result = 1

                           3.     else

                           4. result1 =1 and result2=1.

                           5.      {  result = result1 +result2.

                           6.         result1= result2.

                           7.         result2 = result.

                           8.      }

                           9.  output result.

8 0
3 years ago
I got a question in computer science I don't understand, can someone please help.​
AnnyKZ [126]

Answer:

Hi, this program allows you to calculate a sphere’s area and volume depending on the radius of your choosing.

Please give brainliest, means alot!

6 0
3 years ago
Other questions:
  • In a "block" containment strategy, in which the attacker's path into the environment is disrupted, you should use the most preci
    15·1 answer
  • How many ways can you add an image into google slides?
    8·1 answer
  • A user found that their personal data had been exfiltrated from their computer by a malicious program that they clicked on sever
    12·1 answer
  • Help with this robotics hw pls
    5·1 answer
  • In networking, bandwidth is the volume of computer data carried via a conductor in a period of time. Which one of these could be
    11·1 answer
  • Explain word processing ​
    11·2 answers
  • HELP 99PTS If Answered
    12·2 answers
  • A website's ____ page provides basic information about the individual or organization and includes a navigation bar with links t
    13·1 answer
  • 4.15 LAB: Password modifier
    14·1 answer
  • Select the correct answer.
    7·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!