Which of the following is the domainof the given relation?{(-6, 3), (-4 ,5), (0, 0)}A {0, 4, -6}B {0, 3, 5)C {3, 4, 0}D {-6, -4,
Bas_tet [7]
The domain is the input, which is the x value in the relation (x, y)
Hence the domain in the given relation {(-6, 3), (-4 ,5), (0, 0) is :
{-6, -4, 0}
Answer:
Axis of Symmetry: x = -4
Vertex: (-4, 54)
Step-by-step explanation:
We use a graphing calc.
Answer:
a. Narrower
b. Shifts left
c. Opens up
d. Shifts up
Step-by-step explanation:
The original quadratic equation is y = x²
The given quadratic equation is y = 5·(x + 4)² + 7
The given quadratic equation is of the form, f(x) = a·(x - h)² + k
a. A quadratic equation is narrower than the standard form when the coefficient is larger than the coefficient in the original equation
The quadratic coefficient is 5 > 1 in the original, therefore, the quadratic equation is <em>narrower</em>
b. Given that the given quadratic equation has positive 'a', and 'b', and h = -4, therefore, the axis of symmetry <em>shifts left</em>
c. The quadratic coefficient is positive, (a = 5), therefore, the quadratic equation <em>opens down</em>
d. The value of 'k' gives the vertical shift, therefore, the given quadratic equation with k = 7, <em>shifts up.</em>
Subtracting 3.25 hours from 10 PM is subtracting 3 hours and 15 minutes from 10 PM. Doing this, we get that the game started at 6:45 P.M. Hope this helped!
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)
