Answer:
import java.lang.Object
import java.lang.Math
public class RegularPolygon extends java.lang.Object{
public void randomize(RegularPolygon c){
int min = 10, max1 = 20;
double min1 = 5, max1 = 12;
double range = (max - min) + 1;
double range1 = (max1 -min1) + 1
int side = (Math.random() * range) + min;
double len = (Math.random() * range1) + min1;
c.setNumSides(side);
c.setSideLength( len);
}
public static void main(String[] args) {
RegularPolygon r = new RegularPloygon();
randomize(r);
}
}
Explanation:
The randomize method accepts a regular polygon class as its only parameter and assigns a random number of sides and the length of these sides with the 'Math.random' function.
Go into your trash bin in your computer.
Answer:
The answer of the following question is Brute force attack
.
Explanation:
A brute force attack is the error and trial method that is used by an application program to decode the encrypted data like passwords or the Data Encryption Standard (DES) keys, which through an exhaustive effort (by using brute force) rather than the employing an intellectual strategies.
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.