1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
Archy [21]
3 years ago
13

An intruder tries a large number of possibilities in rapid succession to guess a password. As a result, other users on the netwo

rk are locked out. What type of attack has occurred
Computers and Technology
1 answer:
Daniel [21]3 years ago
8 0

A brute force is the type of attack that occurs when other users on a network are locked out because an intruder is trying to gain access by guessing a large number of password.

<h3>What is a brute force?</h3>

A brute force attack refers to a situation where someone uses a trial-and-error to guess login info, encryption keys etc.

In conclusion, the brute force is the type of attack that occurs when other users on a network are locked out.

Read more about brute force

brainly.com/question/2323336

You might be interested in
Look at the logos below, decide which one would be the most suitable to use for a Cooking App? Please explain your reason below.
den301095 [7]

Answer:

The logo on the top right

Explanation:

It's pretty obvious :/

Everything else is not related to baking or cooking (kiiiinda excluding taco bell, but thats a fast food chain)

6 0
3 years ago
Write a code that calculates the Greatest Common Divisor (GCD) of two positive integers (user-defined inputs). Include an except
STALIN [3.7K]

Answer:

<em>This program is written using Java programming language</em>

import java.util.*;

public class calcGcd

{

   public static void main (String [] args)

   {

       int num1, num2;

       Scanner input = new Scanner(System.in);

       //Input two integers

       num1 = input.nextInt();

       num2 = input.nextInt();

       //Get least of the two integers

       int least = num1;

       if(num1 > num2)

       {

           least = num2;

       }

       //Initialize gcd to 1

       int gcd = 1;

       //Calculate gcd using for loop

       for(int i=1;i<=least;i++)

       {

           if(num1%i == 0 && num2%i == 0)

           {

               gcd = i;

           }

       }

       if(gcd == 1)

       {

           System.out.print("GCD is 1");

       }

       else

       {

           System.out.print("GCD is "+gcd);

       }

   }

}

Explanation:

To calculate the GCD, the program uses a for loop that iterates from 1 to the smaller number of the user input.

Within this iteration, the program checks for a common divisor of the two user inputs by the iterating element

The GCD is then displayed afterwards;

However, if the GCD is 1; the program prints the message "GCD is 1"

<em>Line by Line Explanation</em>

This line declares two integer numbers

       int num1, num2;

This line allows user the program to accept user defined inputs        

Scanner input = new Scanner(System.in);

The next two line allows gets inputs from the user

<em>        num1 = input.nextInt();</em>

<em>        num2 = input.nextInt();</em>

<em />

To calculate the GCD, the smaller of the two numbers is needed. The smaller number is derived using the following if statement

<em>        int least = num1;</em>

<em>        if(num1 > num2)</em>

<em>        {</em>

<em>            least = num2;</em>

<em>        }</em>

The next line initializes GCD to 1

       int gcd = 1;

The GCD is calculated using the following for loop

The GCD is the highest number that can divide both numbers

<em>        for(int i=1;i<=least;i++)</em>

<em>        {</em>

<em>            if(num1%i == 0 && num2%i == 0)</em>

<em>            {</em>

<em>                gcd = i;</em>

<em>            }</em>

<em>        }</em>

The following is printed if the calculated GCD is 1

       if(gcd == 1)

       {

           System.out.print("GCD is 1");

       }

Otherwise, the following is printed

       else

       {

           System.out.print("GCD is "+gcd);

       }

8 0
3 years ago
You copy several files from one folder to another folder within the same drive. what permissions do the files in the destination
cricket20 [7]
They have the same permissions in the destination folder as in the original folder
3 0
3 years ago
Jack is part of the software quality assurance team in a company. Which activity should Jack perform as a part of software quali
gizmo_the_mogwai [7]

Answer:

C - testing

Explanation:

quality assurance is another name for verifying something. so when you verify software, you test the software.

3 0
3 years ago
For each of the following memory accesses indicate if it will be a cache hit or miss when carried out in sequence as listed. Als
nika2105 [10]

Answer:

Explanation:

Operation Address Hit? Read Value

Read 0x834 No Unknown

Write 0x836 Yes (not applicable)

Read 0xFFD Yes CO

6 0
3 years ago
Other questions:
  • Who gave a demonstration of modern computer systems showing a mouse and when?
    8·1 answer
  • 1. _____ can’t be rewritten by the computer in which it’s installed, but it has the advantage of being very _____.
    6·1 answer
  • To find if the Library owns the item listed below using Quick SearchLinks to an external site., what would you type in the searc
    9·1 answer
  • What features are offered by most of the email programs with for receiving and sending messages?
    10·1 answer
  • A virus that is embedded in the automatically executing scipts commonly found in word processors, spreadsheets, and database app
    13·2 answers
  • Just took a test and I got 5 wrong and I wanted to know the correct answers
    10·1 answer
  • Where do charts get the data series names?
    14·1 answer
  • Weird canvas submission, I’ve done directly what the directions say to do to submit it, but it won’t submit
    15·1 answer
  • Explain four sitting postures in a computer laboratory​
    9·1 answer
  • PLEASE HELP
    5·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!