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
N76 [4]
3 years ago
8

What are three softwares for cloud computing

Computers and Technology
1 answer:
Gnoma [55]3 years ago
8 0

Cloud computing can be broken up into three main services: Software-as-a-Service (SaaS), Infrastructure-as-a-Service (IaaS) and Platform-as-a-Service (PaaS). These three services make up what Rackspace calls the Cloud Computing Stack, with SaaS on top, PaaS in the middle, and IaaS on the bottom.

You might be interested in
Examples of ________, which is hosted on a web site, include e-mail, word processing, tax preparation, and game programs.
Keith_Richards [23]

Answer:Web Application

Explanation:Web hosting is more or less like having an ordinary computer in the cloud in order share information and resources with others world wide.One cannot make effective use of a computer without software applications . Similarly hosting just normal html pages and documents on a server cannot help increase productivity,hence the creation of cloud computer applications also known as "Web Apps (Web Applications)" to aid boost productivity and information dissemination via quality task automations.

4 0
2 years ago
A _____ is a device that helps capture action without losing focus. It stabilizes camera movement by reducing the impact of shak
lyudmila [28]

Answer:crane

Explanation:

4 0
2 years ago
Assuming P != NP, which of the following is true ?
White raven [17]

Answer:

Answer is B, see explanations.

Explanation:

Answer is (B) NP−complete∩P=ϕ

Since, P≠NP, there is at least one problem in NP, which is harder than all P problems. Lets take the hardest such problem, say X. Since, P≠NP,X∉P .

Now, by definition, NP−complete problems are the hardest problems in NP and so X problem is in NP−complete. And being in NP, X can be reduced to all problems in NP−complete, making any other NP−complete problem as hard as X. So, since X∉P, none of the other NP−complete problems also cannot be in P.

7 0
3 years ago
Read 2 more answers
Which site was launched by Ben t Smith iv
Kryger [21]

He launched the site "Wanderful Media".

5 0
3 years ago
Is a multiuser computer system that runs a network operating system?
jasenka [17]
No . A multiuser computer system does not run a network operating system
8 0
3 years ago
Other questions:
  • A network protocol is a set of rules defining communication between two devices. True False
    8·2 answers
  • When you want to avoid sending email that a recipient may feel their privacy has been invaded, how would you fill in the (To) bo
    13·1 answer
  • Which command displays the status of the ipsec installation?
    7·1 answer
  • By Carl Sandburg
    6·1 answer
  • The machine should not be oiled until the
    11·1 answer
  • Which function would you use to make sure all names are prepared for a mailing label?
    10·2 answers
  • Write a Java program that accepts an integer number from the user between 20 and 100. Next, divide the number by 12 and determin
    13·1 answer
  • What are the three control statements in Qbasic?​
    10·1 answer
  • 010101010101011101011
    7·1 answer
  • Write steps for converting decimal to binary numbers?
    13·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!