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
MA_775_DIABLO [31]
3 years ago
5

What is the nearest ten cents of 453.56

Computers and Technology
1 answer:
Nutka1998 [239]3 years ago
3 0

Answer:

453.6

Explanation:

It is 453.6 because you are rounding to the nearest ten cents place and in the number 453.56, 5 is in the ten cents place or the tenths place so you look at the number to its right, which is 6 and when you round, numbers 0-4 cause the rounding number to stay the same, numbers 5-9 cause them to go up one. In this situation, it is six so the number 5 would go up one, making it 6 and then you get rid of the numbers to the right side making it 453.6

You might be interested in
Stuck on where to go with this one.
garri49 [273]

1

7

6 I think how many do you have to answer

8 0
3 years ago
What's the full form of SEO?
sweet [91]
ANSWER:

The full form of SEO is Search Engine Optimisation.

Hope this helps! :)
Have a lovely day! <3
5 0
3 years ago
Read 2 more answers
Which devices are most likely to communicate with the internet? Select 3 options.
Anon25 [30]
<h2>Answer:</h2>

<h3>smart phone </h3>

<h3>cars </h3>

<h3>delivery trucks</h3>
5 0
3 years ago
Design and implement an application that reads an integer value representing a year from the user. The purpose of the program is
olga55 [171]

Answer :

Written in java

import java.util.Scanner;

public class Main{

   public static void main(String[] args) {

       int year;

       Scanner scanner = new Scanner(System.in);

       System.out.print("Please enter a year\n\n");

       year = scanner.nextInt();

       while (year < 1582) {

           System.out.print("\nPlease enter a different year above 1582\n");

           year = scanner.nextInt();

       }

       if (year % 4 == 0) {

           if(year % 100 ==0 && year % 400 != 0){

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

           }else {

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

           }

       } else {

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

       }

   }

}

4 0
3 years ago
g Given a 5 by 5 matrix of all positive values, write a program to find and display the greatest product of the 2 adjacent value
Rom4ik [11]

Answer:

Check the explanation

Explanation:

% iterate through each column (outer loop) , then iterate rows-1 (inner loop)

%take product of adjacent rows

mat = input('enter 5 by 5 matrix : ');

[R,C] = size(mat);

max_prod =0;

for c =[1:C]

for r=[1:(R-1)]

temp = mat(r,c)*mat((r+1),c);

if max_prod<temp

max_prod=temp;

end

end

end

fprintf('Greatest product : %i\n', max_prod)

Kindly check the output in the attached image below.

7 0
3 years ago
Other questions:
  • Required
    12·1 answer
  • A _____ attack keeps the target so busy responding to a stream of automated requests that legitimate users cannot get in
    9·1 answer
  • Store operations has installed a new inventory ordering system that is expected to reduce the time it takes to place orders by 2
    11·1 answer
  • Why is personal responsibility important when considering technology?​
    14·2 answers
  • Primitives of transport service assume asymmetry between the two end points during connection establishment, one end (server) ex
    8·1 answer
  • Before a new email application could be released to the public, it was released for a few days to some account holders of a webs
    14·2 answers
  • Need help asap
    5·1 answer
  • What is denial service attack?
    14·2 answers
  • Becca is working on a program that will store data. The program will need quick access to data and data persistence is not impor
    15·1 answer
  • How have cell phones improved our lives​
    5·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!