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
Andreas93 [3]
3 years ago
13

PLEASE HELP!!!!!!!!!!!!!!!!!!!!

Computers and Technology
1 answer:
aleksandrvk [35]3 years ago
6 0

Answer:

A. Elevating keyboard, so wrists are bent when typing

You might be interested in
Write the definition of a function named printpoweroftwostars that receives a non-negative integer n and prints a line consistin
Aleksandr-060686 [28]
To accomplish this without using a loop,
we can use math on a string.

Example:
print("apple" * 8)

Output:
appleappleappleappleappleappleappleapple

In this example,
the multiplication by 8 actually creates 8 copies of the string.

So that's the type of logic we want to apply to our problem.

<span>def powersOfTwo(number):
if number >= 0:
return print("*" * 2**number)
else:
<span>return

Hmm I can't make indentations in this box,
so it's doesn't format correctly.
Hopefully you get the idea though.

We're taking the string containing an asterisk and copying it 2^(number) times.

Beyond that you will need to call the function below.
Test it with some different values.

powersOfTwo(4) should print 2^4 asterisks: ****************</span></span>
4 0
4 years ago
In what domain electrica energy is the most use
amm1812

Answer:the main signal bearing entities are voltage and their current in circuit environments.

Explanation:

5 0
3 years ago
Dear Brainly, since you don't respond anyother way...
madreJ [45]

Answer:

that's an amen stop deleting our stuff deleters!.!!!!!

6 0
2 years ago
Read 2 more answers
Which of the following is true of binary files?
alina1380 [7]
Try using socrative to answer your question it’s really good
3 0
3 years ago
Read 2 more answers
Let U = {b1, b2, , bn} with n ≥ 3. Interpret the following algorithm in the context of urn problems. for i is in {1, 2, , n} do
viva [34]

Answer:

Check the explanation

Explanation:

Kindly check the attached image for the first step

Note that the -print" statement executes n(n — I)(n — 2) times and the index values for i, j, and k can never be the same.  

Therefore, the algorithm prints out all the possible ways to draw three balls in sequence, without replacement.

Now we need to determine the number of lines this the algorithm print. In this case, we are selecting three different balls randomly from a set of n balls. So, this involves permutation.  

Therefore, the algorithm prints the total  

P(n, 3)  

lines.  

7 0
3 years ago
Other questions:
  • ____ repeatedly sends a cluster of three packets starting at the first router connected to a computer, then the next, and so on,
    12·1 answer
  • OSHA standards appear in the ___________ and are then broken down into ____________.
    9·1 answer
  • Suppose you have four 500 MB hard drives plus one 2 GB flash drive. How many GB of capacity is this overall?
    12·1 answer
  • Give four examples of devices which are both<br>Input and Output to a Computer.​
    12·1 answer
  • HELLLPPPPPP For each of the following discussion questions, write a response in complete sentences. Your response should be at l
    6·1 answer
  • What offers backup services that use cloud resources to protect applications and data from disruption caused by disaster? Multip
    9·1 answer
  • Stanovte intenzitu magnetického poľa v strede tenkej cievky s 20 závitmi. Prúd je 2A , stredný polomer cievky je 4cm.
    10·1 answer
  • You are designing an ecommerce web application that will scale to hundreds of thousands of concurrent users. Which database tech
    10·1 answer
  • 45 points!!
    15·2 answers
  • A(n) _____ is a local connection point-of-presence that connects a variety of high-performance networks, and its main function i
    5·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!