Answer:
The answer to this question is given below in the explanation section.
Explanation:
An algorithm is the list of a finite set of instructions and rules that a computer needs to do to complete a task in order to solve a problem.
In short, an algorithm is a series of instructions that are implemented step by step to solve a problem. For example, you could consider a pizza recipe an algorithm for making a pizza in an everyday life routine. But when you are talking about using algorithms in computation and in mathematics. It means that solving a problem using a series of steps step by step.
For example, your everyday tasks aligned on a google calendar and remind you about your tasks using the alarm, etc- how to implement this using set of instructions and rules- is an algorithm.
Solving a quadratic equation is another example of an algorithm.
Binary search, array sorting are an example of an algorithm in computation. Because these algorithms based on the execution of step-by-step instruction to solve a problem such as sorting a list of numbers etc.
Answer:
print("Let's play Silly Sentences!")
print(" ")
name=input("Enter a name: ")
adj1=input("Enter an adjective: ")
adj2=input("Enter an adjective: ")
adv=input("Enter an adverb: ")
fd1=input("Enter a food: ")
fd2=input("Enter another food: ")
noun=input("Enter a noun: ")
place=input("Enter a place: ")
verb=input("Enter a verb: ")
print(" ")
print(name + " was planning a dream vacation to " + place + ".")
print(name + " was especially looking forward to trying the local \ncuisine, including " + adj1 + " " + fd1 + " and " + fd2 + ".")
print(" ")
print(name + " will have to practice the language " + adv + " to \nmake it easier to " + verb + " with people.")
print(" ")
print(name + " has a long list of sights to see, including the\n" + noun + " museum and the " + adj2 + " park.")
Explanation:
Got it right. Might be a longer version, but it worked for me.
Complete Question:
Recall that with the CSMA/CD protocol, the adapter waits K. 512 bit times after a collision, where K is drawn randomly. a. For first collision, if K=100, how long does the adapter wait until sensing the channel again for a 1 Mbps broadcast channel? For a 10 Mbps broadcast channel?
Answer:
a) 51.2 msec. b) 5.12 msec
Explanation:
If K=100, the time that the adapter must wait until sensing a channel after detecting a first collision, is given by the following expression:
The bit time, is just the inverse of the channel bandwidh, expressed in bits per second, so for the two instances posed by the question, we have:
a) BW = 1 Mbps = 10⁶ bps
⇒ Tw = 100*512*(1/10⁶) bps = 51.2*10⁻³ sec. = 51.2 msec
b) BW = 10 Mbps = 10⁷ bps
⇒ Tw = 100*512*(1/10⁷) bps = 5.12*10⁻³ sec. = 5.12 msec
Answer:
for (char outerChar='a'; outerChar<='e'; outerChar++){
for (char innerChar='a'; innerChar<='e'; innerChar++){
cout << outerChar << innerChar << "\n";
}
}
