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
AnnyKZ [126]
3 years ago
5

2. The force of impact is

Computers and Technology
1 answer:
NNADVOKAT [17]3 years ago
7 0

Answer:

lực ( Tiếng Anh : force ) là bất kỳ ảnh hưởng nào làm một vật thể chịu sự thay đổi, hoặc là ảnh hưởng đến chuyển động, hướng của nó hay cấu trúc hình học của nó.

Explanation:

You might be interested in
In implementing Secunity Lfe Cycle:_______
KIM [24]

Answer:

c

Explanation:

because its inportant



7 0
3 years ago
How might your use of computers and knowledge of technology systems affect your personal and professional success?
RUDIKE [14]
It can help you more be aware of whats going on and what you need to do.
8 0
3 years ago
What is the quickest option for adding internet images to a power point presentation
Alex777 [14]

Answer:copy and paste

Explanation:

5 0
3 years ago
Create a button to play the playlist <br><br> Java, netbeans
Pavel [41]
I'm not sure but maybe one of the two websites can help you
.
http://wiki.netbeans.org/MusicAppUsingRESTRemoting

https://mukeshscience.wordpress.com/2014/05/26/adding-audio-to-java/

6 0
4 years ago
Read 2 more answers
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
Other questions:
  • A network administrator is implementing dhcpv6 for the company. the administrator configures a router to send ra messages with m
    6·1 answer
  • What does it mean to have liability for a company?
    6·1 answer
  • Bulleted and Numbered List button appear in the ………….. Toolbar.​
    6·1 answer
  • What is the definition of D1-D4?
    14·1 answer
  • What task does the casting director do, apart from auditioning actors?
    8·1 answer
  • What are the data types in access​
    6·1 answer
  • If nobody buys a ticket to a movie, do they still show it?
    5·1 answer
  • Consider the code fragment below. Show the values stored at each location in memory and as they change while the code executes.
    5·1 answer
  • The image below shows an encoding for a black and white pixel image. The first two
    13·1 answer
  • Can somebody please help me with these few questions?
    11·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!