Answer:
This is not true
Explanation:
The optimal Huffman code is used to encrypt and compress text files. It uses fixed-length code or variable-length code for encryption and compression of data.
The professor's character code is similar to Huffman's variable-length coding which uses variable length od binary digits to represent the word strings. The file size of the text file above is;
= 6 x 1 + 2 x 2 + 3 x 2 + 2 x 2 + 8 x 1 = 28 bits
This would be the same for both cases.
The encrypt would be the problem as the encoded and decoding of the characters B and E may cause an error.
Answer:
1. a modem connects a computer to the internet
4. a modem transmits digital signals over a telephone line
5. a dial-up modem communicates using a telephonic call
All of three mentioned above.
Modem stands for modulator de-modulator, and it connects the computer to the internet. Its not the fastest, which is router. And the connection is established via the telephone line, through which the digital signals is being transmitted, And the type used is dial up communication.
Explanation:
The answer is self explanatory.
On windows, it is the type command.
On linux, the cat command outputs the file.
All bytes that represent printable characters will be displayed as ASCII or even Unicode.
Answer:
465 ways
Explanation:
Atleast 1 girl and 1 boy
Possible combinations :
1 girl ; 3 boys = 6C1 ; 6C3
2 girls ; 2 boys = 6C2 ; 6C2
3 girls ; 1 boy = 6C3 ; 6C1
(6C1 * 6C3) + (6C2 * 6C2) + (6C3 * 6C1)
Combination formula:
nCr = n! ÷ (n-r)!r!
We can also use a calculator :
6C1 = 6
6C3 = 20
6C2 = 15
Hence,
(6C1 * 6C3) + (6C2 * 6C2) + (6C3 * 6C1)
(6 * 20) + (15 * 15) + (20 * 6)
120 + 225 + 120
= 465 ways
