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
ankoles [38]
3 years ago
15

In which circumstances would the view side by side feature be useful or helpful.

Computers and Technology
2 answers:
muminat3 years ago
3 0
<span>D. Editing or comparing two different documents </span>
lara [203]3 years ago
3 0

Answer

Editing or comparing two different documents

Explanation

View by view side is where you scroll two documents at the same time By this you click synchronous scrolling in the window group on the view tab.  The view by view side is useful when  Editing or comparing two different documents

You might be interested in
Technically
Sedaia [141]

The answer should be True


7 0
3 years ago
What are frames in anamation
navik [9.2K]

Answer:

It is where the picture drawn is is quickly moved

Explanation:

5 0
3 years ago
Read 2 more answers
What is the total number of time zones that can be configured to show by default in a calendar in Outlook 2016?
olganol [36]

Answer:

I think its 2, but correct me if i'm wrong. :>

Explanation:

6 0
2 years ago
First write a method to calculate the greatest common divisor (GCD) of two positive integers using Euclid’s algorithm (also know
MAVERICK [17]

Answer:

import java.util.Scanner;

public class Gcd

{

public static void main(String[] args) {

 Scanner input = new Scanner(System.in);

 System.out.print("Enter two numbers to find their GCD: ");

 int number1 = input.nextInt();

 int number2 = input.nextInt();

 

 if(number1 > 0 && number2 > 0)

     System.out.println("GCD of " + number1 +" and " + number2 +" is: " + findGCD(number1, number2));

       else

           System.out.println("Invalid Input!");

}  

public static int findGCD(int number1, int number2) {

    if(number2 == 0){

        return number1;

    }

return findGCD(number2, number1 % number2);

}

}

Explanation:

To be able to find GCD, we need to factorize the numbers and multiply common factors.

- <u>Inside the function:</u>

- Recursively divide <em>number1</em> by <em>number2</em> until <em>number2</em> is equal to zero.

- Return <em>number1</em>  when the <em>number2</em> is equal to zero. That means we found all the divisors of <em>number1</em>

- <u>Inside the main:</u>

- Ask user to input numbers

- Check if both numbers are greater than zero

- If they satisfy the condition, call the method and print the result.

7 0
3 years ago
You have repaired a broken LCD panel in a laptop computer. However, when you disabled the laptop, you bent the hinge on the lid
Alex787 [66]
Yes it would take a second or todo
8 0
3 years ago
Other questions:
  • Which of the following information security technology is used for avoiding browser-based hacking?
    11·2 answers
  • What command would you run from a windows command line to test a computer's network stack?
    7·1 answer
  • Which statement best represents the denotation for the word “woman”? A woman is an adult human female. Both man and woman are re
    11·2 answers
  • Does Windows 7 support secure boot in UEFI? Windows eight? Linux UBUNTU version 14?
    8·1 answer
  • What movie would be greatly improved if it was made into a musical?
    6·1 answer
  • Which of the following specific components are incorporated on HDInsight clusters?
    13·1 answer
  • What do you mean by GIGO (Garbage-In-Garbage-Out) in computer system?​
    6·1 answer
  • How do you remove management from your chrome book [administrator]
    12·1 answer
  • What is ‘situational awareness” in game design?please answer in a full sentence!
    10·1 answer
  • ______________ are used to store information that will be referenced and manipulated in a computer program. They label data with
    6·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!