Answer:
e(a) = 0
e(b) = 10
e(c) = 110
e(d) = 1110
Explanation:
The Worst case will happen when f(a) > 2*f(b) ; f(b) > 2*f(c) ; f(c) > 2*f(d) ; f(d) > 2*f(e) and f(e) > 2*f(f).
Where f(x) is frequency of character x.
Lets consider the scenario when
f(a) = 0.555, f(b) = 0.25, f(c) = 0.12, f(d) = 0.05, f(e) = 0.02 and f(f) = 0.005
Please see attachment for image showing the steps of construction of Huffman tree:- see attachment
From the Huffman tree created, we can see that endcoding e() of each character are as follows:-
e(a) = 0
e(b) = 10
e(c) = 110
e(d) = 1110
e(e) = 11110
e(f) = 11111
So we can see that maximum length of encoding is 5 in this case.
Answer:
C. DAT-1
Explanation:
Chain of custody is applied when examining digital evidence and checking for proof that no alterations have been made to the document. It ensures that the original piece of digital evidence which could be in text, image, video, or other electronic formats, is preserved and protected from alterations. Hashing algorithms which are mathematical computations that help to condense files are applied during this procedure.
Common hashing algorithms applied, include; the message digest 4, secure hashing algorithms 1, 2, 256, 224, 512, etc. The message digest 4 is used to evaluate why a particular piece of evidence was handled by an individual. This is further authenticated by examining the fingerprint.
A- overusing highlights lowers the contrast and degrads the effect of the highlights.
to review the most important supporting points from the original information
Answer:
An operating system has three main functions: (1) manage the computer's resources, such as the central processing unit, memory, disk drives, and printers, (2) establish a user interface, and (3) execute and provide services for applications software.
