The address entered into a web browser (firefox, safari, chrome, ie) is technically called a?

A switch that is configured to use the Spanning Tree Protocol will place a port in ____________ mode if sending traffic to it ma

Rashid [163]

Answer:

Blocking Mode

Explanation:

Spanning Tree Protocol is used to allow path redundancy in the network without creating cycles/circles also called loops.

When two parts of the switched network are connected via two or more Layer 2 switches this result in a loop.

This affects the performance of the network as the result of broadcast packets flooding.

STP puts one port of the switch to forwarding mode and the rest of the ports within the same part of the network to the blocking mode to avoid broadcast packet flooding. STP puts all the ports that are allowing redundant paths to blocking mode and the one port that is left after this is placed in forward mode.

Spanning Tree Algorithm is used by STP to determine the optimal path of switch to the network.

Bridge Protocol Data Units are used to share the information about the optimal path determined by the spanning tree algorithm with other switches.

This information helps STP to eliminate the redundant paths.

So this is how STP allows only one active path to the destination while blocking all other paths to avoid switching loop.

6 0

3 years ago

As you are talking to your colleague over the phone, the sound of an airplane flying low drowns out part of your conversation. I

Rasek [7]

Answer:

Interference.

Explanation:

As the user is communicating with their friend through the mobile, most of their interaction is interrupted by the noise of an airplane flying at low hight. Instantly afterward, the user's mobile phone rang, disrupting the communication once more.

So, according to the following scenario both of those are examples of interference.

6 0

3 years ago

What was one important academic skill the blogger learned?

denis23 [38]

An academic skill that the blogger learned, was to review the graded tests and quizzes to see which concepts he missed out on so that in the future he would be well prepared for it. Reviewing and comparing the tests and quizzes would give him an idea on which topics he needs to study.

Other than the academic skill, the blogger also learned that a person should never give up and he keeps on learning throughout his entire life, and that all of the improvements that the blogger made did not come all at once.

4 0

3 years ago

Write a program and flowchart. The program should ask the user for the average temperature in each of the last 12 months. After

Afina-wow [57]

#First we define the variables to house the temperatures

#temp is an empty array that will be used to store the temperature

Temp = []

#The months is defined as stated below

months = 12

#Ask the user for the temperature input and unit if possible

print("Kindly enter the temperature here")

#the program enter loop to get the temperatures.

for x in range(months):

InitTemp = str(input("Kindly add the unit behind the number .eg C for celcius"))

Temp.append(InitTemp)

j=0

for x in range(len(Temp)):

j=j+1

print("The Temperature is", " ", Temp[x], "for the ", j, "Month" )

#there is an attached photo for the flowchart

5 0

3 years ago

Is recursion ever required to solve a problem? What other approach can you use to solve a problem that is repetitive in nature?

Setler79 [48]

Answer:

No you can not tell that recursion is ever required to solve a problem.

Recursion is required when in the problem, the solution of the input depends on the solution of the subsets of the input.

Iteration is also another form of repetitive approach we follow to solve that kind of problems.

But the difference between recursion and iteration is :

In recursion we call the function repeatedly to return the result to next level.
In iteration certain bunch of instructions in a loop are executed until certain conditions met.

Explanation:

For example in the Fibonacci sequence problem, to find $f_{n}$ , we need to compute $f_{n-1}$ and $f_{n-2}$ before that.

In case of recursion we just call the method Fibonacci(n) repeatedly only changing the parameter Fibonacci(n-1), that calculates the value and return it.

Fibonacci(n)

1. if(n==0 or n==1)

2. return 1.

3.else

4. return( Fibonacci(n-1)+Fibonacci(n-1) )

But in case of iteration we run a loop for i=2 to n, within which we add the value of current $f_{i-1}$ and $f_{i-2}$ to find the value of $f_{i}$

Fibonacci(n)

1. if(n<=2)

2. result = 1

3. else

4. result1 =1 and result2=1.

5. { result = result1 +result2.

6. result1= result2.

7. result2 = result.

8. }

9. output result.

8 0

3 years ago