Hello my name is fvgrbhcdnxjm

Enables businesses and consumers to share data or use software applications directly from a remote server over the Internet or w

Sindrei [870]

Answer:

Cloud Computing

Explanation:

Cloud Computing is basically an infrastructure to deliver various computing resources and services to the users online (via Internet). These resources include networks, applications, servers, databases, software, storage etc.

These services are mostly utilized by organizations for recovery and backup of data, using virtual hardware and other computing resources such as desktops, memory etc. Cloud computing is also used for developing software, for securing data by providing with access control and for storing bulk of data.

The benefits of cloud computing are as following:

Because of cloud computing the customers do not have to buy hardware or install software on their computer which might be very costly to maintain and update. Servers and data centers are provided by cloud service providers and experts are available for managing the services and resources.

These services are scalable and can be adjusted as per the users requirements.

Cloud computing offers a variety of protocols, tools, and access controls that improve security and protects confidential data, applications, and networks against security threats and attacks. It also provides with data backup, disaster recovery.

5 0

3 years ago

How to implement switch statement in Python?

Jet001 [13]

Answer:

Switch-case statements are a powerful tool for control in programming. In this article, Sreeram Sceenivasan goes over you can use a switch-case statement in Python.

Explanation:

Python doesn’t need a switch statement. You can do exactly the same thing with if/elif/else statements.

5 0

3 years ago

Read 2 more answers

The running time of Algorithm A is (1/4) n2+ 1300, and the running time of another Algorithm B for solving the same problem is 1

Mnenie [13.5K]

Answer:

Answer is explained below

Explanation:

The running time is measured in terms of complexity classes generally expressed in an upper bound notation called the big-Oh ( "O" ) notation. We need to find the upper bound to the running time of both the algorithms and then we may compare the worst case complexities, it is also important to note that the complexity analysis holds true (and valid) for large input sizes, so, for inputs with smaller sizes, an algorithm with higher complexity class may outperform the one with lower complexity class i.e, efficiency of an algorithm may vary in cases where input sizes are smaller & more efficient algorithm might be outperformed by the lesser efficient algorithms in those cases.

That's the reason why we consider inputs of larger sizes when comparing the complexity classes of the respective algorithms under consideration.

Now coming to our question for algorithm A, we have,

let F(n) = 1/4x² + 1300

So, we can tell the upper bound to the function O(F(x)) = g(x) = x2

Also for algorithm B, we have,

let F(x) = 112x - 8

So, we can tell the upper bound to the function O(F(x)) = g(x) = x

Clearly, algorithmic complexity of algorithm A > algorithmic complexity of algorithm B

Hence we can say that for sufficiently large inputs , algorithm B will be a better choice.

Now to find the exact location of the graph in which algorithmic complexity for algorithm B becomes lesser than

algorithm A.

We need to find the intersection point of the given two equations by solving them:

We have the 2 equations as follows:

y = F(x) = 1/4x² + 1300 __(1)

y = F(X) = 112x - 8 __(2)

Let's put the value of from (2) in (1)

=> 112x - 8 = 1/4x² + 1300

=> 112x - 0.25x² = 1308

=> 0.25x² - 112x + 1308 = 0

Solving, we have

=> x = (112 ± 106) / 0.5

=> x = 436, 12

We can obtain the value for y by putting x in any of the equation:

At x=12 , y= 1336

At x = 436 , y = 48824

So we have two intersections at point (12,1336) & (436, 48824)

So before first intersection, the

Function F(x) = 112x - 8 takes lower value before x=12

& F(x) = 1/4x² + 1300 takes lower value between (12, 436)

& F(x) = 112x - 8 again takes lower value after (436,∞)

Hence,

We should choose Algorithm B for input sizes lesser than 12

& Algorithm A for input sizes between (12,436)

& Algorithm B for input sizes greater than (436,∞)

8 0

3 years ago

Calculate how many different pixel colours could be formed if one of the bytes gives the intensity of the red colour, one of the

Elena L [17]

Answer: The three RGB colors are each 8-bits (possible values [0.. 255], 2 to the power of 8 = 256) of each of Red, Green, and Blue. The three 8-bit RGB components can create up to 256×256×256 = 16.7 million possible RGB color combinations, called 24-bit "color".

Explanation:

6 0

3 years ago

Create a function that takes a list of numbers between 1 and 10 (excluding one number)

Luda [366]

def missing_num(lst):

for n in range(1,11):

if n not in lst:

print(n)

lst = (1,3,4,5,6,7,8,9,10)

missing_num(lst)

I hope this helps!

8 0

3 years ago