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
Klio2033 [76]
4 years ago
6

Slide layouts can be changed by _________

Computers and Technology
1 answer:
tiny-mole [99]4 years ago
6 0

In powerpoint you would go here and click the dropdown menu


You might be interested in
Effective presentations must have _____.
kherson [118]
A clear central message
6 0
3 years ago
Read 2 more answers
1. What does VolP stand for? *
kenny6666 [7]
Answer : c

Explanation:
6 0
3 years ago
Read 2 more answers
The ipv6 address fields are 128 bits long, and as such there is no need to extend ip addressing by using either dhcp or nat (i.e
Minchanka [31]

Answer:

True

Explanation:

according to coursehero it's true

6 0
2 years ago
An animal shelter recently held an adoption event and found homes for 48 of their shelter animals. If they found home for 80% of
vredina [299]

Answer:

9.6

Explanation:

4 0
3 years ago
Read 2 more answers
You will complete 3 tasks. Task 1: Determine if the input number is prime or not You will ask the user for an integer You will d
GuDViN [60]

Answer:

Program is written in C++

#include<iostream>

using namespace std;

int main()

{

//1. Prime Number

int num;

cout<<"Input Number: ";

cin>>num;

int chk = 0;

for(int i =2; i <num;i++)

{

 if(num%i==0)

 {

  chk = 1;

  break;

 }

}

if(chk == 0)

{

 cout<<num<<" is prime"<<endl;

}

else

{

 cout<<num<<" is not prime"<<endl;

}

//2. Greatest Common Factor

int num1, num2, x, y, temp, gcf;  

cout<<"Enter two numbers: ";

cin>>num1;

cin>>num2;

x = num1;

y = num2;

while (y != 0) {

   temp = y;

   y = x % y;

   x = temp;

 }

 gcf = x;

 cout<<"Greatest Common Factor: "<<gcf<<endl;

 

// 3. LCM  

cout<<"Enter two numbers: ";

cin>>num1;

cin>>num2;

x = num1;

y = num2;

while (y != 0) {

   temp = y;

   y = x % y;

   x = temp;

 }

 gcf = x;

 int lcm =(num1 * num2)/gcf;

cout<<"Least Common Multiple: "<<lcm<<endl;

return 0;

}

Explanation:

<em>I've added the full source code as an attachment where I make use of comments to explain some lines</em>

Download cpp
6 0
3 years ago
Other questions:
  • 6.6 Write a function named timesTen. The function should have an integer parameter named number. When timesTen is called, it sho
    7·1 answer
  • Use a physical stopwatch to record the length of time it takes to run the program. Calculate the difference obtained by calls to
    11·1 answer
  • Sequence encryption is a series of encryptions and decryptions between a number of systems, wherein each system in a network dec
    9·1 answer
  • Write code for iterative merge sort algorithm. It is also known as bottom-up merge sort. There should not be any recursive call
    14·1 answer
  • Have you ever watched Full House? Who is your favorite character and why? EXPLAIN AND ILL GIVE BRAINLIEST!
    12·1 answer
  • If the old and new systems are operated side by side until the new system has proven itself, this type of system conversion plan
    11·1 answer
  • You are the network administrator for a small company that implements NAT to access the internet. However, you recently acquired
    13·1 answer
  • For this activity, you will practice being both proactive and reactive to bugs. Both are necessary to get rid of errors in code.
    5·1 answer
  • What network security tool, usually included with Kali Linux, allows a user to ping multiple IP addresses
    8·1 answer
  • 20 Points!
    15·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!