Answer:
The solution is as follows.
class LFilters implements Lock {
int[] lvl;
int[] vic;
public LFilters(int n, int l) {
lvl = new int[max(n-l+1,0)];
vic = new int[max(n-l+1,0)];
for (int i = 0; i < n-l+1; i++) {
lvl[i] = 0;
}
}
public void lock() {
int me = ThreadID.get();
for (int i = 1; i < n-l+1; i++) { // attempt level i
lvl[me] = i;
vic[i] = me;
// rotate while conflicts exist
int above = l+1;
while (above > l && vic[i] == me) {
above = 0;
for (int k = 0; k < n; k++) {
if (lvl[k] >= i) above++;
}
}
}
}
public void unlock() {
int me = ThreadID.get();
lvl[me] = 0;
}
}
Explanation:
The code is presented above in which the a class is formed which has two variables, lvl and vic. It performs the operation of lock as indicated above.
Answer:
The answer is "DDoS
"
Explanation:
The distributed denial of service attack (DDoS) occurs whenever a directed program's wireless data or assets, generally one or even more application servers, were also swamped by various machines. This attack is always the consequence of many affected systems, that fill up the target network with traffic.
- This attack is aimed to avoid legal customers of one's website from accessing it.
- In being effective in a DDoS attack, further demands need to be sent to the hacker than even the victim's server could deal with.
- One other way to successfully attack is to send fake requests from the attacker.
Explanation:
that programming language you must use?
