Ask question

Ask question

All categories

1 year ago

14

allows users to enter text and control the computer with their voice.allows users to enter text and control the computer with th

eir voice.

Computers and Technology

1 answer:

solong [7]1 year ago

7 0

Speech input software allows users to enter text and control the computer with their voice.

<h3>What is a speech software?</h3>

Speech recognition software is known to be a form of a computer program that is made to take the input of human speech and then they do interpret it, and change it into text.

Note that Speech input software allows users to enter text and control the computer with their voice.

Learn more about Speech input software from

brainly.com/question/27752622

#SPJ1

You might be interested in

How Do you get Splatoon two for free

IRISSAK [1]

Answer:

Well the real question would be how comfortable are you with computer software if not good or none at all I feel the answer would simply be buy the game in the Nintendo store or you could buy the key for the Nintendo store for much cheaper on 3rd party websites give that a try hope this helped you. :)

5 0

2 years ago

Read 2 more answers

Selena needs to insert a comment in a webpage's code to ensure that other web team members who work with the page code understan

ANTONII [103]

Answer:

Explanation:

In HTML,  tag is used to insert comments in the webpage code.

Comments written inside the tag is visible only on the code, and is not displayed in the browsers when the page is requested by the client computer.

<em>Comment tag</em> is useful when there is a lot of code and multiple developers are dealing with the same code.

Comments help developers understand what changed is made and why.

5 0

3 years ago

Recursion occurs when a function (calls itself/ calls another function/ calls a function from the python standard library)

lesantik [10]

Answer:

Recursion is calling of a function from within that same function

5 0

2 years ago

A contiguous subsequence of a list S is a subsequence made up of consecutive elements of S. For example, if S is 5,15,-30,10,-5,

Sindrei [870]

Answer:

We made use of the dynamic programming method to solve a linear-time algorithm which is given below in the explanation section.

Explanation:

Solution

(1) By making use of the dynamic programming, we can solve the problem in linear time.

Now,

We consider a linear number of sub-problems, each of which can be solved using previously solved sub-problems in constant time, this giving a running time of O(n)

Let G[t] represent the sum of a maximum sum contiguous sub-sequence ending exactly at index t

Thus, given that:

G[t+1] = max{G[t] + A[t+1] ,A[t+1] } (for all 1<=t<= n-1)

Then,

G[0] = A[0].

Using the above recurrence relation, we can compute the sum of the optimal sub sequence for array A, which would just be the maximum over G[i] for 0 <= i<= n-1.

However, we are required to output the starting and ending indices of an optimal sub-sequence, we would use another array V where V[i] would store the starting index for a maximum sum contiguous sub sequence ending at index i.

Now the algorithm would be:

Create arrays G and V each of size n.

G[0] = A[0];

V[0] = 0;

max = G[0];

max_start = 0, max_end = 0;

For i going from 1 to n-1:

// We know that G[i] = max { G[i-1] + A[i], A[i] .

If ( G[i-1] > 0)

G[i] = G[i-1] + A[i];

V[i] = V[i-1];

Else

G[i] = A[i];

V[i] = i;

If ( G[i] > max)

max_start = V[i];

max_end = i;

max = G[i];

EndFor.

Output max_start and max_end.

The above algorithm takes O(n) time .

4 0

2 years ago

A computer retail store has 15 personal computers in stock. A buyer wants to purchase 3 of them. Unknown to either the retail st

Dima020 [189]

Answer:

a. 1365 ways

b. Probability = 0.4096

c. Probability = 0.5904

Explanation:

Given

PCs = 15

Purchase = 3

Solving (a): Ways to select 4 computers out of 15, we make use of Combination formula as follows;

$^nC_r = \frac{n!}{(n-r)!r!}$

Where $n = 15\ and\ r = 4$

$^{15}C_4 = \frac{15!}{(15-4)!4!}$

$^{15}C_4 = \frac{15!}{11!4!}$

$^{15}C_4 = \frac{15 * 14 * 13 * 12 * 11!}{11! * 4 * 3 * 2 * 1}$

$^{15}C_4 = \frac{15 * 14 * 13 * 12}{4 * 3 * 2 * 1}$

$^{15}C_4 = \frac{32760}{24}$

$^{15}C_4 = 1365$

<em>Hence, there are 1365 ways </em>

Solving (b): The probability that exactly 1 will be defective (from the selected 4)

First, we calculate the probability of a PC being defective (p) and probability of a PC not being defective (q)

<em>From the given parameters; 3 out of 15 is detective;</em>

So;

$p = 3/15$

$p = 0.2$

$q = 1 - p$

$q = 1 - 0.2$

$q = 0.8$

Solving further using binomial;

$(p + q)^n = p^n + ^nC_1p^{n-1}q + ^nC_2p^{n-2}q^2 + .....+q^n$

Where n = 4

For the probability that exactly 1 out of 4 will be defective, we make use of

$Probability = ^nC_3pq^3$

Substitute 4 for n, 0.2 for p and 0.8 for q

$Probability = ^4C_3 * 0.2 * 0.8^3$

$Probability = \frac{4!}{3!1!} * 0.2 * 0.8^3$

$Probability = 4 * 0.2 * 0.8^3$

$Probability = 0.4096$

Solving (c): Probability that at least one is defective;

In probability, opposite probability sums to 1;

Hence;

<em>Probability that at least one is defective + Probability that at none is defective = 1</em>

Probability that none is defective is calculated as thus;

$Probability = q^n$

Substitute 4 for n and 0.8 for q

$Probability = 0.8^4$

$Probability = 0.4096$

Substitute 0.4096 for Probability that at none is defective

Probability that at least one is defective + 0.4096= 1

Collect Like Terms

Probability = 1 - 0.4096

Probability = 0.5904

8 0

2 years ago