Ask question

Ask question

All categories

3 years ago

9

When a hacker floods a web server with millions of bogus service requests so that it cannot service legitimate requests, it is c

alled a denial-of-service attack?

Computers and Technology

1 answer:

Salsk061 [2.6K]3 years ago

7 0

Almost it is actually called a distributed denial of service attack or DDoS attack for short

You might be interested in

. Reorder the following efficiencies from smallest to largest:

alexdok [17]

Answer:

The order of the efficiencies is as following:-

10,000 < 2n < nlog(n) < n5 < n!.

Explanation:

10,000 is constant time whatever will be the size of the problem the efficiency will remain the same.

2n this efficiency is linear it will grow proportionally as the size of the problem increases.

nlog(n) this efficiency is is a bit greater than 2n though it will grow faster than 2n but slower than n2 as the size of the problem increases.

n5 this efficiency is very poor.It is growing very rapidly as the size of the problem increases.

n! is the worst efficiency of them all.

n!=n*(n-1)*(n-2)*(n-3)*(n-4)*.......2*1.

It will grow beanstalk in jack and the beanstalk.

3 0

3 years ago

Write. A program to fine the difference of two number 25 and 17 . Also displays the output

Anon25 [30]

Answer:

Answer = 25-17

print("25-17", Answer)

Explanation:

You put the sum into a variable which in this case would be Answer and then you can output it with the question.

6 0

3 years ago

Suppose that, even unrealistically, we are to search a list of 700 million items using Binary Search, Recursive (Algorithm 2.1).

damaskus [11]

Answer:

There is also an attachment below

Explanation:

Since we are talking about binary search, let's assume that the items are sorted according to some criteria.

Time complexity of binary search is O(logN) in worst case, best case and average case as well. That means it can search for an item in Log N time where N is size of the input. Here problem talks about the item not getting found. So, this is a worst case scenario. Even in this case, binary search runs in O(logN) time.

N = 700000000.

So, number of comparisions can be log(N) = 29.3 = 29.

So, in the worst case it does comparisions 29 times

7 0

4 years ago

How do technologies such as virtual machines and containers help improve

Alla [95]

The answer is.. D. By allowing multiple applications to run on a single server.

Got 100% on test!

Hope this helps!!

8 0

2 years ago

When you choose a(n) ___________ installation, you only install selected features, rather than all of the features associated wi

lisabon 2012 [21]

Answer:

When you choose a(n) <em><u>custom</u></em> installation, you only install selected features, rather than all of the features associated with a software program.

Explanation:

There are two types of installation while installing a software

1. Default

2. Custom

In default installation, all the features of a software program are installed while when the custom installation mode is selected, the user can select which features of the software he wants to install instead of all features.

So,

When you choose a(n) <em><u>custom</u></em> installation, you only install selected features, rather than all of the features associated with a software program ..

8 0

3 years ago