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
nadya68 [22]
3 years ago
14

Provide 50000 customers with internet service, however it is only given a pool of 256 ip addresses. suggest an address allocatio

n methodology to make this service possible.
Computers and Technology
1 answer:
Ludmilka [50]3 years ago
3 0
DHCP (Dynamic Host Configuration Protocol) with short lease renewal times.
You might be interested in
Ill give alot of points if you answer: How do I get a 100 dollar ps4
stepladder [879]
Uh how do you get a little blue box in a sandwich
8 0
3 years ago
Read 2 more answers
Who are the best candidates for members of skills USA?
Kryger [21]

Answer:

Is there more to the question? But I have had this question already and the answer is B)

7 0
3 years ago
Using language c, find the nth Fibonacci, knowing that nth Fibonacci is calculated by the following formula: - If n = 1 Or n = 2
Nina [5.8K]

Answer:

#include <stdio.h>

int fib(int n) {

 if (n <= 0) {

   return 0;

 }

 if (n <= 2) {

   return 1;

 }

 return fib(n-1) + fib(n-2);

}

int main(void) {

 for(int nr=0; nr<=20; nr++)

   printf("Fibonacci %d is %d\n", nr, fib(nr) );

 return 0;

}

Explanation:

The code is a literal translation of the definition using a recursive function.

The recursive function is not per se a very efficient one.

4 0
3 years ago
Write function modifyString(origString, charsToReplace, count) that takes as input a string origString, a string charsToReplace,
laila [671]

Answer:

The code of the above program is provided below. using Python

Explanation:

<u>Code in Python 3:- </u>

def modifyString(origString,charsToReplace,count):

# Make s1 as original string

s1=origString

# Make s2 as charsToReplace string in lowercase

s2=charsToReplace.lower()

# Make s3 as charsToReplace string in uppercase

s3=s2.upper()

# Initialize answer as an empty string

ans=''

# Iterate the string upto length times

for i in range(len(s1)):

# check for chars in the string and append to the answer

if (s1[i] in s2) or (s1[i] in s3):

ans=ans+count*s1[i]

else:

ans=ans+s1[i]

# return the final string

return ans

print(modifyString("Our cat is funny","aeiou",5))    

print(modifyString("Our cat is funny","zu",3))

8 0
3 years ago
I need help figuring out 2 pictures with topics that I can put on a magazine about the serengeti. This is something I'm doing fo
Usimov [2.4K]

Answer:

how about lions, trees, or zebras

Explanation:

i looked it up

4 0
3 years ago
Read 2 more answers
Other questions:
  • How do i connect wifi direct from pc to phone​
    15·1 answer
  • What is the highest education degree available at a community college
    14·1 answer
  • What is one advantage of top-down programming design?
    13·2 answers
  • a problem-solving approach that requires defining the scope of a system, dividing it into its components, and then identifying a
    8·1 answer
  • Describe how data center storage applications drive the development of SAN technology.
    8·1 answer
  • Andy is trying to put together a holiday gift knapsack (with W=8) for Sarah. He has n items to choose from, each with infinitely
    15·1 answer
  • Which term describes computers (e.g., Windows PC, Mac OS X) with applications that allow a person to perform diverse tasks, from
    5·1 answer
  • Solver: Most of this class has already been written. Complete the solveRecurse() method using the backtracking. Also complete th
    10·1 answer
  • Using a graphic organizer in the prewriting can do all of the following except what?
    9·1 answer
  • During the POST process, the BIOS uses two (2) different ways to notify you of a problem, Error beep codes and error messages, e
    10·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!