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
Schach [20]
3 years ago
8

Which electronic community allows you to write a message and send it to several people at the same time?

Computers and Technology
2 answers:
Fynjy0 [20]3 years ago
7 0
Email would be the answer youre looking for.Hope this helps!!
ollegr [7]3 years ago
4 0
The answer is email :)
You might be interested in
Select all correct statements below: Group of answer choices A redundant link's switch port will be blocked by STP until needed.
GenaCL600 [577]
Snhahshshshshshhshshshsshhshshshshhs
5 0
3 years ago
A source is:
Anestetic [448]

Answer:

A. a primary work from which information is taken.

Explanation:

4 0
3 years ago
Read 2 more answers
What are the basic computer components that must be purchased in order for the computer to function efficiently?
V125BC [204]
Motherboard
Power Supply
Graphics Card (gpu)
Storage (Hard Drive or Solid State Drive)
Processor (cpu)
RAM

That should be the main components. There are other non-essential ones.

6 0
3 years ago
Determine the number of character comparisons made by the brute-force algorithm in searching for the pattern GANDHI in the text
leonid [27]

Answer:

Total number of character comparison = 43

Explanation:

Using the Brute force algorithm

The string of n characters is known as text, and the string of m characters is known as the pattern.

From the given information:

The text (n)=THERE_IS_MORE_TO_LIFE_THAN_INCREASING_ITS_SPEED

The pattern (m) = GANDHI

The total no of characters that we have in the text = 47

The total number of characters in pattern = 6

For a brute force algorithm;

Since; the first character of the pattern does not exist in the text, then the number of trials made can be attempted can be expressed as = n – m + 1

= 47 – 6 + 1

= 47 – 5

= 42

Thus; the algorithm will attempt the trial 42 times.

Now, for loop in the algorithm to run 42 times, the G in the pattern will have to align against the for T in the text, and in the last case, it will be aligned against the last space.

On each attempted trial, the algorithm will make one unsuccessful comparison.

However, at the trial at which the G in the pattern Is aligned with the G in the text, there will be two successful comparisons.

Hence, we can calculate the total number of character comparison as follows:

Total number of character comparison = \mathbf{\bigg ( ( 42 -  (no. \ of \  failed \ comparison) ) \times 1 + (1 \times ( Two \ successful \  comparisons) ) \bigg ) }

Total number of character comparison = ( (( 42 – 1) × 1 ) + ( 1 × 2) )

Total number of character comparison = 41 + 2

Total number of character comparison = 43

3 0
3 years ago
I need help with these
solmaris [256]

Answer:

Choose internet is the right answer

7 0
3 years ago
Other questions:
  • Which strategy are you using when you only read the title, section headings, and captions?
    12·2 answers
  • ________ symbol is used in the "Advanced" section of the time range picker to round down to nearest unit of specified time.
    8·1 answer
  • . Reorder the following efficiencies from smallest to largest:
    9·1 answer
  • teve wants to use Google Display Ads to reach new customers who are looking to purchase products similar to his. Which audience
    14·1 answer
  • What is also known as a visual aid in presentation
    15·1 answer
  • Copy the following code and run it. You should break it into the following 3 functions
    6·1 answer
  • Which of the following are part of personal growth? Check all of the boxes that apply.
    8·2 answers
  • Prompts what is a row?
    7·1 answer
  • Which of the following is NOT a reason we use subprograms?
    7·1 answer
  • The original programs awaiting tanslation is called​
    11·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!