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)).

6 0

2 years ago

Trigonometric functions

givi [52]

Answer:

udg7838jsj

Step-by-step explanation:

888888888888 9283

3 0

2 years ago

Read 2 more answers

The table shows the results of an experiment in which subjects taking either a drug or a placebo either reported fatigue or did

Lady bird [3.3K]

Answer:

Therefore, the correct options are;

-P(fatigue) = 0.44

$P(fatigue \left | \right drug)$ = 0.533

--P(drug and fatigue) = 0.32

P(drug)·P(fatigue) = 0.264

Step-by-step explanation:

Here we have that for dependent events,

$P(A \, and \, B)= P(A)\times P(B\left | \right A )$

From the options, we have;

$P(fatigue \left | \right drug)$ = 0.533

P(drug) = 0.6

P(drug and fatigue) = 0.32

Therefore

P(drug and fatigue) = P(drug)× $P(fatigue \left | \right drug)$

= 0.6 × 0.533 = 0.3198 ≈ 0.32 = P(drug and fatigue)

Therefore, the correct options are;

-P(fatigue) = 0.44

$P(fatigue \left | \right drug)$ = 0.533

--P(drug and fatigue) = 0.32

P(drug)·P(fatigue) = 0.264

Since P(fatigue) = 0.44 ∴ P(drug) = 0.264/0.44 = 0.6.

4 0

2 years ago

what key features can be identified from graphs of polynomials with higher degrees and explain how the key features can be used

Natali [406]

Polynomials are algebraic expressions that contain more than two terms. AN example would be: f(x) = x^3 + x^2 + x +1. This equation contains three terms, with the 3rd degree as its highest term. It also means that the graph passed three x-intercepts. This depends in the highest degree. So, the first thing you do is plot the intercepts because for sure, the graph will pass there.

3 0

2 years ago