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:
Means no matter how many processors you use, speed up never increase from 10 times.
Explanation:
If a problem of size W has a serial component Ws,then performance using parallelism:
Using Amdahl's Law:
Tp = (W - Ws )/ N + Ws
Here, Ws = .1,
W - Ws = .9
Performance Tp = (.9 / N) + .1
---------------------------------------------------------
Speed Up = 1 / ( (.9 / N) + .1)
If N -> infinity, Speed Up <= 10
Means no matter how many processors you use, speed up never increase from 10 times.
A spreadsheet function that indicates the average of a group of numbers in a range.
USB Type C or 3.0/3.1 is the fastest
