Answer:
The domain is found depending on the information you're given. In a table, the domain is found by taking all the x values given and listing them least to greatest. Same with ordered pairs. In a graph, the domain is found by first seeing if there are any restrictions and then find the x values that work and have one output.
The range is found the same way, but with the y values.
Hope this helps!!
Answer:
660
Step-by-step explanation:
First, to find out how much money they have collected so far, you need to add 7100 + 1300 which is 8400. 8400= $8.40. So now you know that they have collected 8.40, you need to subtract 1500-840 which = 660
Hope this helps!
Assuming a d-heap means the order of the tree representing the heap is d.
Most of the computer applications use binary trees, so they are 2-heaps.
A heap is a complete tree where each level is filled (complete) except the last one (leaves) which may or may not be filled.
The height of the heap is the number of levels. Hence the height of a binary tree is Ceiling(log_2(n)), for example, for 48 elements, log_2(48)=5.58.
Ceiling(5.58)=6. Thus a binary tree of 6 levels contains from 2^5+1=33 to 2^6=64 elements, and 48 is one of the possibilities. So the height of a binary-heap with 48 elements is 6.
Similarly, for a d-heap, the height is ceiling(log_d(n)).
Answer:
1. -2
2. add 25/4
3. sub 25/2
4. 5/2
Step-by-step explanation:
Answer:
(x+7)(x-9) = 0
Step-by-step explanation:
x + 7 = 0
x = -7
x - 9 = 0
x = 9
