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
Rama09 [41]
4 years ago
11

Which option in presentation software can you use to apply a “fly in” effect to the objects on a slide? A)flowchart B)shapes C)

animation D) slide transition
Computers and Technology
2 answers:
galben [10]4 years ago
7 0
It is animation because you can't use it on a flowchart and slide transition and shapes is a 50/50 answer and animation is more definite  <span />
LUCKY_DIMON [66]4 years ago
6 0

The answer is Animation.  

In PowerPoint, If you want to make a piece of text or an object have a “Fly in” entrance effect, then the Animation option or Tab is where you would be required to click. Once this option is selected, a list of animation style will pop up. Continue to click on the “Fly in” animation style. This effect makes the objects fly in from the bottom, top, right, or left.


You might be interested in
Differences between the first four generations of computers​
Lisa [10]
Hey man

The first generation computers were developed during 1943-1958. It used vacuum tubes as the active electronic components and was therefore very large. However some of the features are as follows-

a) They were extremely large and occupied a very large space.

b) They used vacuum tubes as memory device.

c) They were very expensive and consumed a lot of electrical power.

d) The operating speed was measured in milliseconds.

e) These computers had low level of accuracy and reliability.

f) Storage capacity was too small only 1 to 4Kb.

g) They used machine level programming language.

The examples are- UNIVAC, ENIAC, EDSAC, EDVAC, and UNIVAC.

The second generation computers were developed during 1959-1965. The invention of the transistor by three scientists of Bell Telephone Laboratories in 1947 greatly changed the development of computers. However some of the features are as follows-

a) These computers used transistor.

b) They were smaller, faster and cheaper than first generation of computer.

c) They consumed less electrical power than first generation.

d) The operating speed was measured in microseconds.

e) They were more reliable and accurate than the first generation computers.

f) They could understand high level language such as COBOL.

g) Magnetic tapes were used as secondary storage media.

The examples are – IBM 1620, IBM 1401, and CDC 3600.

The third generation computers were developed during 1966-1973. The development of Integrated Circuit (IC) signaled the beginning of the third generation computers. However some of the features are as follows-

a) These computers used integrated circuits.

b) They were small, efficient and reliable.

c) Operating systems were developed.

d) Monitors and keyboards were introduced for input and output of data.

e) Magnetic disks were used for secondary storage.

f) The operating speed was measured in nano seconds.

g) They could understand large number of high level languages.

The examples are – IBM 360, ICL -1900, and IBM 370 etc.

The fourth generation computers were developed during 1974-1990. This generation of computer is presently in use. The development of microprocessor signaled the beginning of the fourth generation of computers. However some of the features are as follows-

a) These computers use LSI and VLSI technologies.

b) Its sizes were reduced to desktop and laptop computer.

c) These computers are highly reliable and accurate.

d) They have a large memory and high functional speed.

e) The operating speed is measured in beyond picoseconds and MIPS (Million of instruction per second)

f) Magnetic disk is the common source of external storage.

g) Multiprocessing and multiprogramming OS (operating system) are used.

h) 4GL are also used.

The examples are – IBM PC, Apple/Macintosh, 8086, 80286 SX, 80386 SX etc.

The computers having artificial intelligence (AI) and high processing capacity undergoing on the development stage from 1990 are said to be fifth generation computers. However some of the features are as follows-

a) The speed will be extremely high in fifth generation computer.

b) These computers will be using Ultra Large Scale Integration (ULSI) technology.

c) The goal of fifth generation computers is to develop machines that will be able to think and take decisions.

d) It can perform large number of parallel processing.

e) Biochips and Gallium Arsenide (GaAS) will be used as memory devices.

f) Large uses of natural language processing and user friendly.

Able to make decisions like human beings.
4 0
3 years ago
___________ is a task pane used to correct grammar errors; opens when you click the Spelling &amp; Grammar button in the Proofin
BaLLatris [955]

Answer:

Spelling Task Pane

Explanation:

According to my research on Microsoft Office Studio, I can say that based on the information provided within the question the feature being mentioned in the question is called the Spelling Task Pane. By selecting this pane word will offer various grammar and spelling assistance, such as correcting words and offering one or more suggestions.

I hope this answered your question. If you have any more questions feel free to ask away at Brainly.

7 0
4 years ago
Read 2 more answers
Information systems include all of these
Ulleksa [173]

Answer:

D

Explanation:

because you need people to access software through hardware and data through information and procedures.

4 0
3 years ago
A ________ attack uses software to try thousands of common words sequentially in an attempt to gain unauthorized access to a use
Andrej [43]
Malware
Hope this helps
3 0
3 years ago
My friend Leo wants to have an emergency plan for his final exams on University of Southern Algorithmville. He has N subjects to
leonid [27]

Answer:

Greedy is an algorithmic paradigm that builds up a solution piece by piece, always choosing the next piece that offers the most obvious and immediate benefit. Greedy algorithms are used for optimization problems. An optimization problem can be solved using Greedy if the problem has the following property: At every step, we can make a choice that looks best at the moment, and we get the optimal solution of the complete problem.

If a Greedy Algorithm can solve a problem, then it generally becomes the best method to solve that problem as the Greedy algorithms are in general more efficient than other techniques like Dynamic Programming. But Greedy algorithms cannot always be applied. For example, the Fractional Knapsack problem (See this) can be solved using Greedy, but 0-1 Knapsack cannot be solved using Greedy.

The following are some standard algorithms that are Greedy algorithms.

1) Kruskal’s Minimum Spanning Tree (MST): In Kruskal’s algorithm, we create an MST by picking edges one by one. The Greedy Choice is to pick the smallest weight edge that doesn’t cause a cycle in the MST constructed so far.

2) Prim’s Minimum Spanning Tree: In Prim’s algorithm also, we create an MST by picking edges one by one. We maintain two sets: a set of the vertices already included in MST and the set of the vertices not yet included. The Greedy Choice is to pick the smallest weight edge that connects the two sets.

3) Dijkstra’s Shortest Path: Dijkstra’s algorithm is very similar to Prim’s algorithm. The shortest-path tree is built up, edge by edge. We maintain two sets: a set of the vertices already included in the tree and the set of the vertices not yet included. The Greedy Choice is to pick the edge that connects the two sets and is on the smallest weight path from source to the set that contains not yet included vertices.

4) Huffman Coding: Huffman Coding is a loss-less compression technique. It assigns variable-length bit codes to different characters. The Greedy Choice is to assign the least bit length code to the most frequent character. The greedy algorithms are sometimes also used to get an approximation for Hard optimization problems. For example, the Traveling Salesman Problem is an NP-Hard problem. A Greedy choice for this problem is to pick the nearest unvisited city from the current city at every step. These solutions don’t always produce the best optimal solution but can be used to get an approximately optimal solution.

6 0
3 years ago
Other questions:
  • What is the output of this code? import java.util.HashSet; class A { public static void main(String[ ] args) { HashSet set = new
    15·1 answer
  • How can the connection to salesforce be restricted only to the employee portal server? Universal containers (UC) uses a legacy E
    13·1 answer
  • How do you mark somebody the brainliest?
    14·2 answers
  • Eric is working on a computer that has a device driver error. Eric can find the name of the device driver however the actual dev
    13·2 answers
  • To move to the beginning of the line with the keyboard, press the _______ key(s).
    6·1 answer
  • A large electronic game manufacturer decides to establish a customer service center in Lahore, Pakistan. This is an example of _
    10·1 answer
  • It's fill the gap homework
    7·1 answer
  • Display the total number of parking tickets.
    5·1 answer
  • An array A[0..n - 2] contains `n-1` integers from 1 to `n` in increasing order. (Thus one integer in this range is missing.) Des
    11·1 answer
  • Write a program using integers userNum and divNum as input, and output userNum divided by divNum three times.
    7·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!