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
daser333 [38]
3 years ago
11

Kellyn needs to move Slide 8 of his presentation up so that it becomes Slide 6. What best describes how he can do this using the

slide thumbnails to the left of the main view?
A. He can right-click on Slide 6, then choose “Insert Before” and select Slide 8 from the options given.
B. He can right-click on Slide 8 and hold the mouse button while dragging up until the insertion point is after Slide 6.
C. He can left-click on Slide 8 and hold the mouse button while dragging up until the insertion point is after Slide 5.
D. He can left-click on Slide 6, then choose “Move To” and select Slide 8 from the options given.
Computers and Technology
2 answers:
uranmaximum [27]3 years ago
8 0

Answer:

C

Explanation:

Most programs for slides allow the individual to click and drag a slide where it belongs.

Thepotemich [5.8K]3 years ago
4 0
C is the answer , it’s very easy
You might be interested in
Clicking the _____ box completes an entry. cancel formula enter tab
DaniilM [7]
Enter tab would complete an entry. I hope that helped ya! 
4 0
3 years ago
Select the correct answer. Which sign or symbol will you use to lock cells for absolute cell reference?
worty [1.4K]

Answer:

A. ampersand

Explanation:

7 0
2 years ago
Read 2 more answers
Which of the following shows a list of Big-Oh running times in order from slowest to fastest?
Rufina [12.5K]

Answer:

O(N!), O(2N), O(N2), O(N), O(logN)

Explanation:

N! grows faster than any exponential functions, leave alone polynomials and logarithm. so O( N! ) would be slowest.

2^N would be bigger than N². Any exponential functions are slower than polynomial. So O( 2^N ) is next slowest.

Rest of them should be easier.

N² is slower than N and N is slower than logN as you can check in a graphing calculator.

NOTE: It is just nitpick but big-Oh is not necessary about speed / running time ( many programmers treat it like that anyway ) but rather how the time taken for an algorithm increase as the size of the input increases. Subtle difference.

5 0
2 years ago
Read 2 more answers
Which activity is performed during high-level design in the V-model?
SVETLANKA909090 [29]

Answer:

understanding component interaction

4 0
2 years ago
Select the correct answer.
Veronika [31]
I think it’s c. llS....
6 0
3 years ago
Read 2 more answers
Other questions:
  • Which of the Arts, A/V Technology, and Communication career cluster pathways are involved with producing a product for an audien
    8·2 answers
  • How can you autohide the taskbar in Windows 10?
    8·2 answers
  • Write a definition of the function printDottedLine, which has no parameters and doesn't return anything. The function prints to
    14·1 answer
  • What is the purpose of an arraignment?
    9·2 answers
  • Managing your calendar and emails can be easily accomplished through ___ software
    8·1 answer
  • Online Book Merchants offers premium customers 1 free book with every purchase of 5 or more books and offers 2 free books with e
    11·1 answer
  • PLEASE HELP!!! THIS IS WORTH A TEST GRADE!!!
    13·1 answer
  • Gary has to complete a form before enrolling into an online course. A few of the fields require Gary to respond with either a "Y
    7·2 answers
  • Dynamics
    11·1 answer
  • I will give brainyest
    15·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!