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
solniwko [45]
3 years ago
13

Which is an advantage that electronic scheduling tools have over paper calendars?

Computers and Technology
2 answers:
erik [133]3 years ago
3 0

Answer:C. Electronic Scheduling tools have automatic reminders that can be set up

Explanation:edge2020

Fed [463]3 years ago
3 0

Answer:

C

Explanation:

You might be interested in
brielle is researching substitution ciphers. she came across a cipher in which the entire alphabet was rotated 13 steps. what ty
kogti [31]

Caesar cipher is a very common type of substitution cipher where each letter in the plaintext is moved or shifted to a known number of places down the alphabet.

The type of cipher is this is ROT13

  • ROT13ROT13 is a simple letter substitution cipher. It functions by the replacement of a letter with the 13th letter after it in the alphabet. It is commonly known as Caesar cipher used in ancient Rome

Conclusively we can say that ROT13 is a commonly known Caesar cipher that replaces a letter with the 13th letter after it in the alphabet.

Learn more from

brainly.com/question/15300028

3 0
3 years ago
Is it possible to have the present value of a future payment that is greater than the future payment (i.e. the present value is
asambeis [7]

Note that the present value always less than the future value and so Is it not possible to have the present value of a future payment that is greater than the future payment.

<h3>Can present value be greater than future cash flows?</h3>

The present value is known to be often less than the future value this is due to the reason that money has interest-earning rate on top of it.

So therefore, that base on the fact that as long as interest rates are positive, then the present value of a sum of money will have to be less than its future value.

Learn more about present value from

brainly.com/question/20813161

6 0
3 years ago
To find all the prime numbers less than or equal to a given integer n by Eratosthenes' method: 1. Create a list of consecutive i
natta225 [31]

Answer:

I am writing a Python program:

def Eratosthenes(n):  

   primeNo = [True for i in range(n+1)]  # this is a boolean array

   p = 2  # the first prime number is initialized as 2

   while (p * p <= n):     # enumerates all multiples of p

       if (primeNo[p] == True):                

           for i in range(p * p, n+1, p):  #update multiples

               primeNo[i] = False

       p = p + 1        

   for p in range(2, n):   #display all the prime numbers

       if primeNo[p]:  

           print(p),    

def main():     #to take value of n from user and display prime numbers #less than or equal to n by calling Eratosthenes method

   n= int(input("Enter an integer n: "))

   print("The prime numbers less than or equal to",n, "are: ")  

   Eratosthenes(n)      

main()      

Explanation:

The program contains a Boolean type array primeNo that is initialized by True which means that any value i in prime array will be true if i is a prime otherwise it will be false. The while loop keeps enumerating all multiples of p starting from 2, and striking them off from the original array list and for loops keep updating the multiples. This process will continue till the p is greater than n.  The last for loop displays all the prime numbers less than or equal to n which is input by user. main() function prompts user to enter the value of integer n and then calls Eratosthenes() function to print all the prime numbers less than or equal to a given integer n.

   

7 0
3 years ago
1 _ A Unit of information containing the object's position: rotation, and scale values is called:
Damm [24]

Answer:

an inform

Explanation:

A information is an inform

4 0
3 years ago
What is the Big-Oh of the following computation? int sum = 0; for (int counter = 1; counter &lt; n; counter++) sum = sum + count
Brilliant_brown [7]

Answer:

The Big-O notation of the algorithm is O(n)

Explanation:

The declaration and update of the integer variable sum is a constant of O(1). The for loop statement, however, would repeat relative to the size of "n", increasing the counter variable and updating the sum total by the counter.

3 0
3 years ago
Other questions:
  • What percentage of the global population of about seven billion people used the Internet in 2012?
    5·2 answers
  • ____ software consists of the operating system and utility programs that control a computer system and allow you to use your com
    9·1 answer
  • What is the advantage of using a high-level language over machine language for writing computer programs?
    12·2 answers
  • The index number of a combobox object can be assigned to a(n) ____ data type variable
    13·1 answer
  • Jasmine is writing a shopping app. She has created a variable to keep track of the number of items in the shopping cart. Everyti
    11·1 answer
  • Memory is the place of the computer where data and instructions are stored either permanently or temporarily. True or false.​
    11·1 answer
  • Which of the following is a Microsoft solution
    11·1 answer
  • Dispositivo de computo
    5·1 answer
  • You need to implement a class that represents the state of a room or game section. The class will contain a room_id, a descripti
    15·1 answer
  • STOP DELETING MY ANSWERS AND QUESTIONS!!!!!!!
    9·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!