D. A database is software which is designed to store massive amounts of data and organize them in such a way that information can easily be worked on (added, deleted, moved, etc...).
Answer:
1. There are many ways to write an algorithm. Some are very informal, some are quite formal and mathematical in nature, and some are quite graphical. The instructions for connecting a DVD player to a television are an algorithm. A mathematical formula such as πR2 is a special case of an algorithm. The form is not particularly important as long as it provides a good way to describe and check the logic of the plan. The development of an algorithm, a plan is a key step in solving a problem. Once we have an algorithm, we can translate it into a computer program in some programming language. Our algorithm development process consists of five major steps.
2. computers only do what you told them to do, so If you wrote something wrong or you wasn't precise enough it might cause a massive damage and cause you to lose a lot of money.
3. You know when a problem should be solved whenever you need to make a decision that is important, or requires human intelligence and a computer doesn’t have human intelligence.
4. The process does sound familiar to me; it is like the mechanism of operation of the computer. Through reflex actions, our bodies take in input and respond sometimes without our control, such as shivering, blinking, and sneezing.
5. The brain uses chemicals to transmit information; the computer uses electricity. Even though electrical signals travel at high speeds in the nervous system, they travel even faster through the wires in a computer. Both transmit information. A computer uses switches that are either on or off ("binary").
Access hundreds of professional development resources for museum professionals. Museum professionals can benefit at any career stage from student to retiree. Student Membership. Industry Membership. Established Since 1906. Museum Memebership. 501(c)3 Nonprofit Org.
The answer is Cloud computing
Hope this helps-
Answer:
Explanation:
The minimum depth occurs for the path that always takes the smaller portion of the
split, i.e., the nodes that takes α proportion of work from the parent node. The first
node in the path(after the root) gets α proportion of the work(the size of data
processed by this node is αn), the second one get (2)
so on. The recursion bottoms
out when the size of data becomes 1. Assume the recursion ends at level h, we have
(ℎ) = 1
h = log 1/ = lg(1/)/ lg = − lg / lg
Maximum depth m is similar with minimum depth
(1 − )() = 1
m = log1− 1/ = lg(1/)/ lg(1 − ) = − lg / lg(1 − )
