Please upvote if you like the answer, as it helps the community a lot.
Also if you have any doubts, feel free to ask in comments, we will reach you ASAP.
Solution:
A. Given N symbols in the charset, we need to represent them with fixed length binary encoding.
Let the number of bits required = k
So we need 2k >= N
Hence, k = Ceil(log2N) = smallest integer greater than or equal to log2N
Ceil stands for ceiling value
B. Given N=12
Using above formula k = Ceil(log212) = 4
A Suppose you had a character set with n symbols. How many bits are needed if...
Given n bits, how many unsigned integers can be represented with the n bits? What is the range of these integers? (6 points) There are 26 characters in the alphabet we use for writing English. What is the least number of bits needed to give each character a unique bit pattern? How many bits would we need to distinguish between upper- and lowercase versions of all 26 characters? (12 points)
a) Convert decimal 17.375 to binary, hexadecimal and octal. b) How many bits are needed to represent a number between -13 ~ +22?
. Huffman Encoding (a.) (6 points) Suppose a certain file contains only the following letters with the corresponding frequencies 1 AİB 73 9 30 44 130 28 16 In a fixed-length encoding scheme, cach character is given a binary representation with the same number of bits. What is the minimum number of bits required to represent each letter of this file under fixed-length encoding scheme? Describe how to encode all seven letters in this file using the number of bits...
Hello, please keep the solutions simple and understandable, I am not a computer scientist. Thank you! 1.1. How many bits are necessary to represent the alphabet using a binary code if we only allow uppercase characters? How about if we allow both uppercase and lowercase characters? 1.2. Describe how you can create an OR gate using NOT gates and AND gates. 1.3. A kilobyte is 1024 bytes. How many messages can it store? 1.4. What is the entropy associated with...
Suppose we have another file with only ASCII symbols. But we decided to encode the file in the following way using Huffman Encoding: instead of treating each character as a unique symbol, we use 2 characters together as a unique symbol. For example, if the file content is ABABCCDD. Then there are 4 total symbols (2 ABs, 1 CC, and 1 DD). Please explain how this approach to construct symbols may impact the compression process. More specifically, explain how this...
(b.) Huffman code is a way to encode information using variable-length binary strings to represent symbols depending on the frequency of each individual letter. Specifically, letters that appear more frequently can be encoded into strings of shorter lengths, while rarer letters can be turned into longer binary strings. On average, Huffman code is a more efficient way to encode a message as the number of bits in the output string will be shorter than if a fixed-length code was used....
Computer architecture How many SRAM bits are needed to implement an 8KB two-way set associative cache with 64B block size? Assume that each line (entry) has a single valid bit and no dirty bits. There is one bit per set for true LRU. Assume that the address size of the machine is 32-bits and that the machine allows for byte addressing.
Could you please help me with this assignment? The purpose of this assignment is to simulate the transmission and reception of a text message (i.e., character string) over a noisy communications channel. Suppose we wish to transmit the string “Hello.” We can translate this string into a bit stream as shown below: String: H e l l o . \0 (note: the last character \0 is the null terminator character) ASCII: 72 101 108 108 111 46 0 Binary: 01001000...
2. You are making a new account on your favorite social media website. This great new website offers the most fun way to steal all of your personal information! Long story short, you need a new password. ords can include upper-case letters, lower-case letters, numbers and the symbols you can r. Characters may be repeated. Please do not simplify your answers. get by holding Shift + a numbe (a) Suppose you want to make a 7, 8 or 9-character long...
a) Suppose we have a 64 KB, direct-mapped cache with 8-word blocks. Determine how many bits are required for the tag, index, and offset fields for a 32-bit memory address. b) If instead, we use a 64 KB, 4-way set-associative cache with 8-word blocks, how many bits will be required for the tag, index, and offset fields for a 32-bit address? c) What type of cache is shown in problem 2? How many bits are required for this cache’s tag,...