2nd question:
128 64 32 16 8 4 2 1
0 1
1 1 0 1 1 0
---------------------------------
0 64 32 16 0 4 2 0
so 64+32+16+4+2=118
so for binary number 01110110 the decimal number is 118
4th question:
dividing
remainder
2)131(65 1
2)65(32 1
2)32(16
0
2)16(8
0
2)8(4
0
2)4(2
0
2)2(1 0
2)1( 1
so the binary number is 10000011 for decimal number 131
6th question:
given binary number is 01101111 and the hexadecimal number
according to table is
0110 is '6' and 1111 is'F' so the heaxdecimal number
is 6F
7th question:
given hexdecimal number is A2 according the given table
A=1010 and 2=0010 so the binary number is
10100010
Please show work! 2. Now, give it a try by converting the binary number 01110110 to...
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
We have learned a famous shift cipher called Caesar Cipher. Now if we are given a plain test: THE ART OF WARAnd key = 3 (a shift by 3 letters), please give the ciphertext Given an 8 bit block P = 10101111 and a key K = 01101011, please give the result of bitwise XOR between P and K Please give the left 2 shift of the 8 bit text 01100101 Use the given a permutation table 23614857 to define...
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
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...
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...
Show all work. Define the following: 1. Bit 2. Byte 3. ASCII 4. Binary 5. Octal Convert the following binary numbers to decimal numbers: 1011 0111 0000 0001 1100 1000 0101 Convert the following numbers from decimal to binary: 0 4 9 3 17 8 7 Decode the following Binary ASCII text. Show your work. 01001001 00100000 01101100 01101111 01110110 01100101 00100000 01111001 01101111 01110101
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...
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...
please solve the question completely and show the steps ... thumb up will be given 1. (3 points each) [CO: 11 a. Perform the number conversion (2101)s -6 binary equivalent of the Gray code numbers listed below in ascending order, ie, b. List all 4-bit from smallest to largest. (Hint: Use the mirroring technique.) Gray-Code Straight Binary Equivalent 0001 0011 0010 0110 0111 0101 0100 1100 1101 Perform the following binary multiplication: c. (1031)4 (1031)4 Perform the following base-3 addition:...
The place values for the eight binary digits used in IPv4 addressing are as follows: 128, 64, 32, 16, 8, 4, 2, 1. Expand this range to include an additional four bits. Do this by recording the place values for 211, 210, 29, and 28. 1111 Express the decimal value 2001 in binary by placing 1s in the binary positions requiring the addition of the corresponding place value. Place 0s in the binary positions where the corresponding place value should...