3.3-1. Internet Checksum. Consider the four sixteen bit numbers: 10110100 01000110 01001001 01101111 10110111 01100111 01001011 11101111 Compute the Internet Checksum of these two values Enter the 2 bytes each as an 8-bit number with only O's and 1's, and make a single blank space between the two 8-bit numbers (e.g., 01010101 00101000). [Note: Use XOR function, as I explained in class to find the checksum field value.]

Write a program that swaps 5th~11th bits in data_a with 25th~31th bits in data_bYour program must work for any data given, not just the example belowIn this question, we assmue that the positions of bits count from right to left.That is, the first bit is the least significant bit.

Write a program in C  that can convert a bit stream of a message into a frame by using Hamming coding. The bit stream is the input parameter of the program. For example, given an input parameter as 1001000, the correct output of the frame is 00110010000. Input bit stream will have 1 to 64 bits. Some self-testing examples are:Input 1001000; output 00110010000Input 1101001100110101; output 011110110011001110101Input 1010101; output 11110100101Input 11111111; output 111011101111   Write a program in C  that can convert a bit stream of a message into a frame by using CRC. The bit stream is the first input parameter of the program, which will have 8 to 128 bits. The generator function is the second input parameter of the program, which will have 4 to 16 bits. For example, if the generator function is x^4 + x + 1, the second input will be 10011. The output should be the transmitted bit stream with its CRC checksum bits; see example in Figure 3-9 in the textbook. Some self-testing examples…

Our everyday number system in the UK and many other parts of the world is a base-10 system using Arabic numerals, namely the digits 0, 1, 9. Integers larger than 9 are represented by sequences of these elementary numerals. The numerical value encoded by such a sequence is determined by multiplying each numeral by 10k, where k is the position of the numeral counted from the back and starting at zero, and then summing together the contributions from all numerals. For example, 5207 = 5 × 10³ +2×10² +0×10¹ + 7×10⁰ The built-in int function in Python can take a string (type str) representing such a number and convert it to a Python integer (type int). Write a similar function base14_convert that takes a string and converts it to a Python integer according to the following number system: • the base is 14, i.e., the individual digits have to be multiplied by powers of 14 to obtain the numerical value; digits are represented by lower-case letters 'a', 'b', 'c', 'd', ..., i.e., 'a' is…

This is for the Verilog Subject.

A certain computer has a word length of 18 bits, including sign bit. If 2's complement is used to represent negative numbers, what is the range of signed decimal integer values, that can be stored? { Answer in decimal numbers, not 2* ) The same computer stores unsigned integers using the same 18 bits. What is the range of unsigned integer values, in decimal, that can be stored?

Write a program that swaps 5th~11th bits in data_a with 25th~31th bits in data_bYour program must work for any data given, not just the example belowIn this question, we assume that the positions of bits count from right to left.That is, the first bit is the least significant bit.data_a        DCD    0x77FFD1D1data_b        DCD    0x12345678

Write a program that asks the user to enter and integer number and read it. Then ask him to enter a bit position (between 0 and 31) and display the value of that bit.   srlv $s1,$s2,$s3   s2 = 3210 = 0000 0000 0000 1000 0000 0000 010 00002 s3 = 18       Bit = 10   1 = 00000000000000000000000000010000   2 = 00000000000000000000000000001000   3 = 00000000000000000000000000000100 4 = 00000000000000000000000000000010 5 = 00000000000000000000000000000001 S1   = 00000000000000000000000000000001  1    =  00000000000000000000000000000001 $t0  = 00000000000000000000000000000001 = x.1 = x   AND $t0,$s1,1

Create a 4-bit by 3-bit binary multiplier that multiplies a 4-bit number by a 3-bit number. Note: The 4-bit number should be the multiplicand and the 3-bit number should be the multiplier.

Find the decimal values of the following signed (negative) numbers. First find a signed-magnitude binaryrepresentation for them and then convert them to decimal numbers: a. (71)8= (111001)2 signed-magnitude =b. (80C)16 = (100000001100)2 signed-magnitude =c. (10100101)2 = (-0100101)2 signed-magnitude =