Answer:
It goes like:
public class Program
{
public static void main(String[] args)
{
int j=18;
int sum=0;
for (int i =1; i<7; i++)
{
sum=sum+(i*(j-2));
j=j-2;
}
System.out.println(sum);
}
}
Explanation:
<u>Variables used: </u>
j : controls the first number in product and decreases by 2 each time the loop runs.
sum: saves the values of addition as the loop runs.
In order to prevent ports that are serving network hosts from being considered as best paths, BPDU guard should be enabled to block bpdus.
<h3>What are BPDU used for?</h3>
A bridge protocol data unit (BPDU) is known to be a kind of a data message that is known to be often transmitted in a local area network to be able to know or find loops in that given network topologies.
Hence, in the case above, In order to prevent ports that are serving network hosts from being considered as best paths, BPDU guard should be enabled to block bpdus.
See full question below
. In order to prevent ports that are serving network hosts from being considered as best paths, what should be enabled to block BPDUs?
a. BPDU filter
b. BPDU guard
c. root guard
d. BPDU drop
Learn more about ports from
brainly.com/question/10097616
#SPJ1
Answer:
True: In binary search algorithm, we follow the below steps sequentially:
Input: A sorted array B[1,2,...n] of n items and one item x to be searched.
Output: The index of x in B if exists in B, 0 otherwise.
- low=1
- high=n
- while( low < high )
- { mid=low + (high-low)/2
- if( B[mid]==x)
- {
- return(mid) //returns mid as the index of x
- }
- else
- {
- if( B[mid] < x) //takes only right half of the array
- {
- low=mid+1
- }
- else // takes only the left half of the array
- {
- high=mid-1
- }
- }
- }
- return( 0 )
Explanation:
For each iteration the line number 11 or line number 15 will be executed.
Both lines, cut the array size to half of it and takes as the input for next iteration.
That's B.
Linguist love all kinds of studies of languages culture writing etc.
Phone wireless data plans.
