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
Arada [10]
3 years ago
5

A computer can sort x objects in t seconds, as modeled by the function below:

Computers and Technology
1 answer:
zavuch27 [327]3 years ago
6 0
T = 9 = 0.005x^2 + 0.002x

0.005x^2 + 0.002x - 9 = 0

To solve this quadratic equation divide by 0.005

x^2 + 0.4x - 1800 = 0

x = {-b +/- √[b^2 -4ac] } / 2a = {-0.4 +/-√[0.16 + 7200]} / 2 = { - 0.4 +/- 84.85}/2 =

Use only the positive result: x =  42.2 = 42

Answer: 42
You might be interested in
What is 14.10 to the tenth power​
nataly862011 [7]

what i remeber is that when your trying to figure out to the tenth power u have to multiply it like for example:3^{2}power would be 9 because u had to multiply 3, 2 times so i think the answer is 310,592,615,939.35/310,592,615,939.4

3 0
3 years ago
Consider the following code snippet: int count = 0; int[][] numarray = new int[2][3]; for (int i = 0; i < 3; i++) { for (int
inna [77]
I have never seen this in my life sorry
7 0
3 years ago
Which directory holds most of the system log files?
faust18 [17]
I think the answer to that is /var/log hope this helps
5 0
3 years ago
Write the use of these computers.
xxTIMURxx [149]

Answer:

i not know mainframe computer there is many use of computer

5 0
3 years ago
Consider the following language:
VMariaS [17]

L is a decidable language because the Turing machine accepts it.

L is a recognizable language if  TM M recognizes it.

<h3>How do you know if a language is decidable?</h3>

A language is said to be decidable only when there seems to exists a Turing machine that is said to accepts it,

Here, it tends to halts on all inputs, and then it answers "Yes" on words that is seen in the language and says "No" on words that are not found in the language. The same scenario applies to recognizable language.

So,  L is a decidable language because the Turing machine accepts it.

L is a recognizable language if  TM M recognizes it.

Learn more about programming language from

brainly.com/question/16936315

#SPJ1

8 0
2 years ago
Other questions:
  • which of the following are used on cable trays to protect the cable insulation from direct sunlight? a. barrier strips b. solid
    5·1 answer
  • An Internet Service Provider (ISP) is a company that builds the routers and wired connections that allow individuals to access t
    12·2 answers
  • The moon has less mass than the earth, so what happens to objects on the moon?
    11·1 answer
  • Write an algorithm that gets as input your current credit card balance, the total dollar amount of new purchases, and the total
    8·1 answer
  • An IT professional with a customer-service
    13·1 answer
  • In the following code: function drawCircle(radius, x, y, color) { var circle = new Circle(radius); circle.setPosition(x, y); cir
    7·1 answer
  • Not every organization integrates with the Internet, but all use some or most of the technology that gave rise to it.
    15·1 answer
  • If we need to manage a contiguous range of memory, handling requests to allocate various sized chunks, and later make those chun
    12·1 answer
  • Write Epic username plz
    6·1 answer
  • What version of java do i have installed.
    6·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!