Que compone una maquina Rube Goldberg (operadores mecánicos- maquinas simples – mecanismos)

Computers and Technology

1 answer:

Veseljchak [2.6K]2 years ago

3 0

Answer:

dominoes, fans, PVC pipe, magnets, duct tape, marbles, cups or bowls, miniature toy cars, paper towel tubes, string.

------------------------------------------------------------------------------------------------------------

dominó, abanicos, tubos de PVC, imanes, cinta adhesiva, canicas, tazas o cuencos, carros de juguete en miniatura, tubos de toallas de papel, cuerdas.

Explanation:

You might be interested in

If a thread is not finished running, perhaps because it had to wait or it was preempted, it is typically restarted on the same p

andrew11 [14]

<span>If a thread is not finished running, perhaps because it had to wait or it was preempted, it is typically restarted on the same processor that previously ran it. This is this known as </span>processor affinity.

4 0

3 years ago

Which form of malware contains hidden code that is triggered by meeting or reaching a specific condition? (A) Trap door (B) Viru

Alborosie

Answer:

D- Trojan Horse

Explanation:

Trojan horse is a malware that has hidden code and look legitimate in order to damage or transfer harmful action on the computer.

Example hackers can disguise as Trojan horse by spying on the victims computer in order to gain access to sensitive data on the computer over the network.

3 0

2 years ago

Pundits attributed Obama’s 2012 victory to which social media site?

maksim [4K]

twitter i think -----------------------------

5 0

3 years ago

Which option will you use to show your presentation to the audience?

spin [16.1K]

Answer:

Powerpoint is a good option.

Explanation:

You can also connect the computer that has to powerpoint to a larger monitor.

Hope it helps! :)

3 0

3 years ago

Consider a logical address with a page size of 8 kb. how many bits must be used to represent the page offset in the logical addr

777dan777 [17]

8 kilobytes have addresses from hex 0x0000 to 0x1fff (=8191). You would need 13 bits for that. 2^13-1 = 8191. If you write the highest address in binary, you get:

0001 1111 1111 1111. Just count the number of 1's.

If you find this difficult to visualise, write down all logical addresses of a small page size of e.g. 8 bytes. You can see you can make all addresses with 3 bits.

7 0

3 years ago