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
alexandr402 [8]
2 years ago
10

Write a python program to accept a number and check whether it is divisible by 4 or not​

Computers and Technology
1 answer:
Alenkasestr [34]2 years ago
5 0

Answer:

number = int(input("Enter number: "))

if (number % 4):

 print("{} is not divisible by 4".format(number))

else:

 print("{} is divisible by 4".format(number))

Explanation:

If the %4 operation returns a non-zero number, there is a remainder and thus the number is not divisable by 4.

You might be interested in
You can use the Ignore All button to ignore the current and all future occurrences of a flagged word. True or False
Pepsi [2]

Answer: True

Explanation: "Ignore All" button is the button that operates when the user wants to ignore the word that is flagged .Flagged words are those which chosen by user to be banned and don't want to use in future.

Ignore all button helps in the ignoring of the spelling check of the words that the user is sure about and the words that user don't want to be the part of their content.This banning is for the future use and current time as well.Thus, the statement is true.

4 0
3 years ago
Identify the causes of configuration problems. (choose all that apply)
jolli1 [7]

Answer: The computer does not meet minimum requirements of the software program because too much energy gets put in it

Explanation:

Good luck

4 0
3 years ago
Read 2 more answers
You create a storyboard at the _____ stage of web development
ddd [48]

Answer:

initial stage of web development.

4 0
3 years ago
Read 2 more answers
An algorithm whose worst-case time complexity is bounded above by a polynomial function of its size is called a(n)
Sedaia [141]

Answer:

polynomial-bounded algorithms

Explanation:

There are two algorithm complexities and they are time and space complexities. They can be denoted with the big-O notation. The big-o notation for a time and space complexity gets the worst-case time and space respectively.

The time complexity gets the measure of the execution time of an algorithm. When the time function is a polynomial ( k^n + k^n-1 ...) then the algorithm is said to be a polynomial-bounded algorithm.

4 0
2 years ago
The security administrator for Corp wants to provide wireless access for employees as well as guests. Multiple wireless access p
Artemon [7]
It’s B I took the test
7 0
3 years ago
Other questions:
  • ____ is a special type of large, integrated system that ties together all types of a company’s activities, such as planning, man
    11·2 answers
  • What is the best overall approach to education and career development for IT professionals?
    14·2 answers
  • If an M/M/1 queue in a server has task arrivals at a rate of 30 per second and serves at a rate of 50 per second, how many tasks
    10·1 answer
  • The principle of time preference requries a larger payment in the future than the present. Which situation best illustrates this
    12·1 answer
  • What is the decrypted binary
    9·1 answer
  • When planning the structure of a spreadsheet, columns are for _______ items and rows are for _______ items.
    10·2 answers
  • Read the argument below and determine the underlying principle that was used to come to the conclusion presented: It is recommen
    5·1 answer
  • Are you allowed to copy and paste answers on brainy to give answers to other people?
    5·2 answers
  • When machining rotors, what is the reason for setting the indexing collars to zero?
    9·1 answer
  • Deirdre has a hearing disability. One of her friends advised her to use real-time text or RTT on her phone. In which of these
    13·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!