Answer:
Storage management
Explanation:
The programs that do this are known as Storage management programs. They are incredibly useful since they allow you to see which files are taking up the most amount of space as well as the importance that each file has on the system. Many of these programs have a different visual representation of the files such as pie charts or system blocks showing the percentage of space it is taking up. Everything in these programs is made to help the end-user visualize and analyze their data thoroughly.
Answer:
Redundant paths can be available without causing logical Layer 2 loops.
Explanation:
- Spanning Tree Protocol is used to allow redundancy in the Layer 2 switched networks without creating cycles/circles also called loops.
- These loops are called physical 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 forward 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 block 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 tracks all the links in the switched network and eliminates redundant loops by allowing only one active path to the destination while blocking all other paths.
Answer:
#include <iostream>
using namespace std;
int main()
{
int side1=0;
int side2=0;;
int side3=0;
cout <<"Enter side one measurement";
cin >> side1;
cout <<"Enter side two measurement";
cin >> side2;
cout <<"Enter side three measurement";
cin >> side3;
if(side1+side2>side3||side1+side3>side2||side2+side3>side1){
if (side1==side2 && side2==side3)
{
cout <<"equilateral triangle"<<endl;
}
else if(side1==side2||side2==side3||side1==side3){
cout <<"Isosceles triangle"<<endl;
}
else{
cout <<"scalene triangle"<<endl;
}
}else{
cout<<"No triangle";
}
return 0;
}
Explanation:
The code is written in c++. It takes measurements of each side from users as input and check the types of triangle based on the following formula.
1. Equilateral Triangle
If all sides of a triangle are equal than it's an equilateral triangle.
2. Isosceles Triangle
If any two sides of a triangle are equal than it's an Isosceles triangle.
3. Scalene Triangle
If all the sides of a triangle are of different length than it's an Scalene triangle.
In a triangle the sum of two sides is greater than third side otherwise it's not a triangle.
Answer:
Following are the code to the given question:
int power(int x, int n)//defining a method power that accepts two integer parameters
{
if (n == 0)//defining if block to check n equal to 0
{
return 1; //return value 1
}
else//defining else block
{
x = x * power(x, --n); //use x variable to call method recursively
}
return x; //return x value
}
Explanation:
In the above-given code, a method power is defined that accepts two integer variable in its parameter, in the method a conditional statement is used which can be defined as follows:
- In the if block, it checks "n" value, which is equal to 0. if the condition is true it will return value 1.
- In the else block, an integer variable x is defined that calls the method recursively and return x value.
