Answer:
19
Step-by-step explanation:
2d + 3
d = 8
2(8) + 3
multiply 2 and 8
16 + 3
add 16 and 3
= 19
Data points
a data series
an x axis
a y axis
a legend
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:
AC = 3.72 units
Angles:
A = 132.6°
C = 27.4°
Step-by-step explanation:
AC² = 5² + 8² - 2(5)(8)cos(20)
AC² = 13.82459034
AC = 3.718143399
3.718143399/sin20 = 8/sinA
sinA = 0.7358944647
A = 180 - 47.38285134
A = 132.6171487
3.718143399/sin20 = 5/sinC
sinC = 0.4599340405
C = 27.38285134
Step-by-step explanation:
when 11 is decreased by a number, the result is 413
