1 |
0 |
3 |
2 |
3 |
2 |
1 |
0 |
0 |
2 |
1 |
3 |
1 |
1 |
3 |
2 |
and a substitution scheme that if we denote a 4 bit number as “b1 b2 b3 b4”, the (b1 b4) forms a 2 bit binary number that specifies a row of the above matrix and the (b2 b3) forms another 2 bit binary number that specifies a column of the matrix. The row and column lead to a number in the matrix. Taking the number and translating it into binary, we get the substitution value for the original 4 bit number. Now given a 4 bit 1001, please give the substitute value.
Define a Nib Table as follows
nib |
S−box(nib) |
nib |
S−box(nib) |
|
0000 |
1001 |
1000 |
0110 |
|
0001 |
0100 |
1001 |
0010 |
|
0010 |
1010 |
1010 |
0000 |
|
0011 |
1011 |
1011 |
0011 |
|
0100 |
1101 |
1100 |
1100 |
|
0101 |
0001 |
1101 |
1110 |
|
0110 |
1000 |
1110 |
1111 |
|
0111 |
0101 |
1111 |
0111 |
What is SubNib(1010 0101)?
a)
THE ART OF WAR, key=3
Shift all character by 3
like A to D, B to E.... X to A, Y to B and Z to C
Answer = WKH DUW RI ZDU
T->W, H-> K and so on
b)
P = 10101111
K = 01101011
XOR = 11000100 (same bit gives 0 and different give 1)
c)
left 2 shift of the 8 bit text 01100101
Aswer = 100101 00 (trim first 2 bits and add 2 0s in end)
d)
1 |
0 |
3 |
2 |
3 |
2 |
1 |
0 |
0 |
2 |
1 |
3 |
1 |
1 |
3 |
2 |
number = 1001, b1=1, b2=0, b3=0, b4=1
11 for row (b1b4)
00 for column (b2b3)
3rd row and 0th column = 1 (0001 in binary)
We have learned a famous shift cipher called Caesar Cipher. Now if we are given a...
3. What is the hexadecimal representation of each of the following binary numbers in signed 2’s complement? 0010 0101 0100 0011 0001 1011 0010 0100 1111 0110 1101 1001
Generate the equivalent Sim68 assembly program for the following machine code assuming it originates at address dollar 0000: 1001 0000 0100 0000 0011 0000 0100 0000 0011 0010 0010 1000 0000 0000 0000 1100 0110 0111 0000 0110 0110 1101 1111 1000 1101 0000 0100 0001 0110 0000 1111 0110 0100 1110 0100 0000 0000 0000 0000 0000 0001 0110 1111 0000 1111 1111 1111 1111 1000 0000 0000 0000 0000 0000 0000 0001
Please show work! 2. Now, give it a try by converting the binary number 01110110 to decimal by filling in the same table in step 1 r of 2 Pov 128 64 32 16 Cumulative Amount 4. Now, you give it a try by converting the decimal number 131 to binary by filling in the table Power of 2 128 32 16 Bit Amount Remaining 6. Use the binary to hexadecimal table to convert the binary number 01101111 to hexadecimal...
Arduino. DEC HEX BIN(4-bits) Introducing ARDUINO 0 0 0000 1 1 0001 2 2 0010 3 3 0011 4 4 0100 5 5 0101 How many 1/0 of Port-D? How many usable 1/0 of Port-D, if Serial-Communication is in-used? What is the Arduino's pin assignment of ATMEL's PC5, PB3, & PD1*? What is the ATMEL's pin assignment of Arduino's D13*, D1, & D19? To complete the table about Number System Conversion (shown your step) 6 6 0110 7 7 0111...
I think you are actually doing binary to hex. please do this without loops and you can use recursion. please write a working C code. Thanks Write a loop-less function to convert from Hex to Binary. (HINT: Use a helper function/recursion) binHex[16] [5] {"0000", "O001","0010","0011","0100" ,"0101", "0110", "0111", "1000", "1001" , "1010", "1011", "1100", "1101", "1110" 1 const char = s char hexToBinary ...) 7
binary conversions. please help. thank you! Convert the following Binary number to Base 8 4. 1111 1001 0110 0001 1001 0101 1101 1010 1110 0010 0101 Convert the following Base 8 number to binary 5. 200076524, Convert the following Base 8 number to Base 16 6. 1177662231
Base no bit 0 0 Q-2 (25p): Assume that logical addresses are 16-bit long: 3 bits for segment no and 13 bits for offset. Segment table of the currently running process is given below: a) (5) How many segments can this Segment Present Modify Length process have at maximum? bit 0 00100 0111 0000 0100 0000 1000 0100 b) (15) Convert the following logical 10100 0100 0001 0010 0010 1100 1000 address to physical (real) address. 2 01100 0100 0000...
Question 1.1. (TCO 1) Which number system has a radix of two? (Points : 4) Hexadecimal Binary Decimal Octal Question 2.2. (TCO 1) Convert 24 base 10 to hexadecimal. (Points : 4) 1A 18 20 30 Question 3.3. (TCO 1) If FF h is converted to decimal, the result is _____. (Points : 4) 100 200 255 256 Question 4.4. (TCO 1) Convert decimal 103 to an 8-bit binary number. (Points : 4) 1110 0100 0100 0000 0110 0111 0110...
E-Cube algorithm: 1. for source A and destination B, result = A XOR B 2. for each non-zero bit in the result starting from the least significant (right most) travel along that dimension Using the above algorithm give the sequence of hops, node by node, for the following source and destinations on this hypercube: 1.0000→1111 2.1111→0000 3. 0101→1010 4. 1100→1000 5. 0001→1000 6. 0010→1111 AQ3 ю. AQ r000 1001 0010 101p.. 001 1011 1100, 1101 0110 Ц10
DO bit 0 1 Q-2 (25p): Assume that logical addresses are 16-bit long: 3 bits for segment no and 13 bits for offset. Segment table of the currently running process is given below: a) (5) How many segments can this Segment Present Modify process have at maximum? Length bit Base 0 0 0 0100 0111 0000 0100 0000 1000 0100 b) (15) Convert the following logical 1 1 0100 0100 0001 0010 0010 1100 1000 address to physical (real) address...