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
Lubov Fominskaja [6]
3 years ago
5

The cost of a new smart watch at Walmart is

Mathematics
1 answer:
ludmilkaskok [199]3 years ago
7 0

Answer:    $50.50

Step-by-step explanation:

$250.49-$199.99=$50.50

You might be interested in
Find the LCD of the following list of fractions. 2/21, 10/14, 17/22 LCD=
ollegr [7]
The least common denominator is 462
7 0
3 years ago
9. Write an algebraic expression for each verbal expression.
alexandr402 [8]
A) x+6
B)3x
C)x/7
D)4-5x
E)x^2-2
F)2X+16
4 0
2 years ago
Read 2 more answers
Jenise throws a ball 75 times and hits the target 41 times. What is the experimental probability that she will hit the target? S
Nutka1998 [239]

Answer:

Step-by-step explanation:

Probability is the ratio of the required outcome to the total possible outcome

Total outcome = 75

Number of times target was hit (expected outcome) = 41

Pr(she will hit target)= 41/75

Next is to state in percent and u do that by multiplying the resulting fraction by 100

41/75 i n percent.

41/75×100

= 4100/75

= 54.67%

Hence the answer in percentage is 54.67%

7 0
3 years ago
Rotation 180 counterclockwise around the origin of the point (-3,-7)
yaroslaw [1]

Answer: (3 , 7)

Step-by-step explanation: When rotating a point 180 degrees counterclockwise about the origin our point A(x,y) becomes A'(-x,-y). So all we do is make both x and y negative. Since x and y are already negative, they become positive due to the double negative rule.

8 0
2 years ago
"3. When we have two sorted lists of numbers in non-descending order, and we need to merge them into one sorted list, we can sim
iren [92.7K]

Answer:

Since we extract n elements in total, the algorithm for the running time for K sorted list is O (n log k+ k) = O (n log k)

Step-by-step explanation:

To understand better how we arrived at the aforementioned algorithm, we take it step by step

a, Construct a min-heap of the minimum elements from each of "k" lists.

The creation of this min-heap will cost O (k) time.

b) Next we run delete Minimum and move the minimum element to the output array.

Each extraction takes O (log k) time.

c) Then insert into the heap the next element from the list from which the element was extracted.

Now, we note that  since we extract n elements in total, the running time is

O (n log k+ k) = O (n log k).

So we can conclude that :

Since we extract n elements in total, the algorithm for the running time for K sorted list is O (n log k+ k) = O (n log k)

5 0
3 years ago
Other questions:
  • An angle measures 47°. What are the measures of the angle’s complement and supplement? (1 point)
    14·1 answer
  • Which line plot displays a data set with an outlier?
    5·2 answers
  • I need help in this question
    6·1 answer
  • WHAT IS THE DIFFERENCE BETWEEN A RELATION AND A FUNCTION?
    13·2 answers
  • WHO EVER ANSWERS FIRST I WILL GIVE THE CROWN-
    11·1 answer
  • 10 2/3 x 6 1/4 simplify or reduce
    8·2 answers
  • Can someone help me pls
    9·2 answers
  • CAN ANYONE HELP ME? :)
    12·1 answer
  • Nala is getting new tile in her kitchen. Her kitchen is in the shape of a rectangle with a length of 9 feet and a width of 15 fe
    12·1 answer
  • Chose the correct property
    9·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!