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
bixtya [17]
2 years ago
6

Es costoso construir un robot

Computers and Technology
1 answer:
Ghella [55]2 years ago
3 0

Answer:

I dont speak that sorry

Explanation:

You might be interested in
ANYBODY WANNA PLAY FoRnITe
ValentinkaMS [17]

Answer:

No but my baby brother can play with u

6 0
3 years ago
Read 2 more answers
Add the following numbers in abacus 2436+9214​
bazaltina [42]

Answer:

the answer is - 11,650

Explanation:

you study abacus too ?

4 0
2 years ago
A line of text that has an equal number of characters on either side of the horizontal center of the page is called____.
VLD [36.1K]
A) force justified.

If you open up Word (or probably any word processor) and hover over the alignment options in the ribbon (or format the paragraph), it tells you what each one is, and the option that ensures the characters are spread evenly between the margins is labeled "justified."
6 0
3 years ago
Which invention replaced vacuum tubes in computers?
dlinn [17]

Answer:

Transistors

Explanation:

6 0
2 years ago
Consider the following algorithms. Each algorithm operates on a list containing n elements, where n is a very large integer.
DochEvi [55]

We have that the appropriate statement will be

  • An algorithm that accesses only the first 10 elements in the list, regardless of the size of the list. Which of the algorithms run in reasonable time

III only.

Option B

From the question we are told

Consider the following <u>algorithms</u>. Each <u>algorithm</u> operates on a list containing n <em>elements</em>, where n is a very large <u>integer</u>.

I. An algorithm that accesses each <u>element</u> in the list twice.

II. An <em>algorithm </em>that accesses each <u>element </u>in the list n times.

III. An <u>algorithm</u> that accesses only the first 10 elements in the list, regardless of the size of the list. Which of the <em>algorithms </em>run in <em>reasonable </em>time?

<h3>Algorithm  </h3>

Generally In order to get <em>admission </em>to every thing in the list twice, the algorithm has to traverse the listing twice,

which leads to 2*n entry to operations.

And if the every factor is accessed n times, the listing will be traversed n time, which leads to n^2 get right of entry to operations.

If n is a very giant <em>integer</em>, each 2*n and n^2 are plenty larger.

So, there will be <em>solely </em>ten entry to operations and this algorithm will have a sensible jogging time.

Therefore

An algorithm that accesses only the first 10 elements in the list, regardless of the size of the list. Which of the algorithms run in reasonable time

III only.

Option B

For more information on  algorithm  visit

brainly.com/question/950632

4 0
2 years ago
Other questions:
  • Explain the steps users can take to maintain an operating system
    15·1 answer
  • Important tools used in the _____ phase of the DMAIC process include a project charter, a description of customer requirements,
    10·1 answer
  • In this challenge, write a function to add two floating point numbers. Determine the integer floor of the sum. The floor is the
    8·1 answer
  • What is the primary responsibility of the federal reserve bank??
    11·1 answer
  • Which of the following allows the transmission of voice and often video communication over the internet?
    12·1 answer
  • A _____ is a number that summarizes an encrypted information. digital certificate hash function message digest hash algorithm
    8·1 answer
  • Match the job description to the level of degree it requires.
    15·1 answer
  • SeleCT all correct text​
    5·1 answer
  • Solve this for brainlest​
    10·1 answer
  • state an application that would be better to write c++ than java and give a rationale for your answer
    5·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!