Answer:
Huffman code is use for encoding the language. The entropy when calculated is 1.5.
Explanation:
Using Huffman Coding scheme to encode:
The huffman coding scheme is described in the attachment.
To find entropy; we use the formula given below:
H = ∑
where H = Entropy and p = probability
p(A) = 50% = 1/2
p(B) = 25% = 1/4
p(C) = 25% = 1/4
Answer:
D. O(NlogN)
Explanation:
The computation of the overall algorithm cost is as follows:
Given that
O(logN) + O(N) × O(logN) + 1
In the case of complexity we considered the high order that dominates the other terms
Thus, that term would be
O(N) × O(logN)
It could be rewrite as
O(NlogN)
Hence, the correct option is D.
All the other options are wrong
Answer:
[24, 35, 9, 56 Approach #3: Swap the first and last element is using tuple variable.
Answer:
i). Signed magnitude
Five bit representation = 11111
For positive 5 bit representation = 01111 = +15
For negative 5 bit representation = 11111 = -15
ii). One's complement
For positive 5 bit representation = 01111 =+15
For negative 5 bit representation = 10000 = -15
iii). Two's compliment
For positive 5 bit representation = 01111 = -15
For negative 5 bit representation = 10001 = +15
Answer:
ADMINISTRATIVE CONTROL
Explanation:
If a potential employee is required to undergo a drug screening an Administrative Control is what will be conducted on the employee because
Administrative controls are training, procedure, policy that limit or prevent exposure of an individual to hazards. Examples of administrative controls include training, supervision, timing of work. Administrative controls are also changes in work procedures such as written safety policies, rules, supervision which is the reason the employee has to undergo drug screening using Administrative controls.
