Say you have an n block of bits message. You split it to 8 bits each (assume that 8 divides n). For each of the 8 bit we choose a permutation of the bits. How many different codes could come out of this? Explain or prove the correctness of your analysis.
Please do rate me and mention doubts in the comments section
Say you have an n block of bits message. You split it to 8 bits each (assume that 8 divides n). For each of the 8 bit we...
please explain how they solved this. in a simple way. Example 5.1 How many padding bits must be added to a message of 100 characters if 8-bit ASCII is used for encoding and the block cipher accepts blocks of 64 bits? Solution Encoding 100 characters using 8-bit ASCII results in an 800-bit message. The plaintext must be divisible by 64. If MI and IPadl are the length of the message and the length of the padding 32 mod 64 This...
3. (5pts) Let's assume we have a source message with 10 bits and the probability for any single bit going wrong is 0.1, then what's the minimum coding bits we need if we want to send the message out?
1. How many different characters could be encoded using a six-bit code? 2. What is the numerical difference between ASCI a and ASClI 'AN if you treaj them as hexadecimal (hex) numbers? 3. The ASCII codes for the characters 'O' through '9' are what hex numbers? If an asynchronous frame is used to send ASCII characters in the form of bytes (8 bits), what is the shortest time it could take to send 1000 characters if each bit in a...
Assume that 151 and 214 are signed 8-bit decimal integers stored in two’s complement format. Calculate 151 + 214 by adding the two’s complement numbers first and then writing the final result in decimal. Then explain why the final result is very different from 366 (151+214=366). Note that if a number requires more than 8 bits, you need to represent first the number correctly using as many bits as necessary, then keep only the 8 bits, and use the resulting...
7. In a cache system we have the following attributes: 4 GB of DRAM 256 MB of physical memory space 2 MB of cache IKB per cache line Determine number of lines in cache. a) Determine the number of address bits out of the processor. b) c) Determine the number of bits needed for the block offset section of the address. If our cache is 8-way set associative, how many sets are there in the cache? d) How many bits...
computer architecture The sum of the two 32 bit integers may not be representable in 32 bits. In this case, we say that an overflow has occurred. Write MIPS instructions that adds two numbers stored in registers Ss1 and Ss2, stores the sum in register $s3, and sets register Sto to 1 if an overflow occurs and to 0 otherwise. 5. (16pts) 6. Show the IEEE 754 binary representation of the number -7.425 in a single and double 7. If...
Assume you have: 32-bit addresses, 4KB Page size, 4MB Physical Memory Space, 4KB Cache with 4-way set associative and LRU replacement, 32 Byte Cache block size, 4-entry fully associative TLB. A program to be run on this machine begins as follows: double A[1024]; int i, j; double sum = 0; for( i = 0; i < 1024; i++ ) // first loop A[i] = i; for( j = 0; j < 1024; j += 16 ) // second loop ...
Assume a memory model where you have a cache size of 4 blocks, a block size of 8, and addresses from 0 through 511. Assume that the n-way associative cache and fully associative cache use a LRU (least recently used) eviction strategy. Consider the following sequence of memory accesses: 17, 66, 22, 66, 80, 41, 85, 66, 17, 104. (a) Show the updates to a 2-way associative cache in a table using a similar format to the table shown on...
1. You own n colors, and want to use them to color 6 objects. For each object, you randomly choose one of the colors. How large does n have to be so that odds are that no two objects will have the same color (i.e., every object is colored in a different color)? 2. Consider the following game: An urn contains 20 white balls and 10 black balls. If you draw a white ball, you get $1, but if you...
In the last module you learned a formula for calculating bit rate, R = b/t, that is the number of bits divided by the time. This formula expresses the number of bits that are transmitted over a circuit in a given period of time. In practice, however, we are not only concerned with the number bits transmitted, but also with the number of data bits transmitted over a circuit. The data bits are those that the sender decides to send...