Binary_AND_ExerciseZZ

✓ sizeof operator does not work with bitfields. (True/False)

36 59- is a sequence of characters surrounded by double quotes. * • Constant • Numeric • Character • String 57- What are bitwise operators? * • & ! • All above 52- Which one of the following is a keyword in c++? * • Size Кey >

CCTT211 Assignment: 1. Change the following decimal numbers to 16-bit two’s complement integersa. -1024b. 16384 2. Change the following 8-bit unsigned numbers to decimala. 11010101b. 00101110 3. If we apply the two’s complement operation to a number twice, we should get the original number. Apply the two’s complement operation to each of the following numbers and see if we can get the original number.a. 110011b. 111111114. Normalize the following binary floating-point numbers. Explicitly show the value of the exponent after normalization.a. 0.1011.1 * 26b. 1101.11 * 2-2  5. Convert the following numbers in 32-bit IEEE format.a. 16.25b. -12.75 6. Convert the following decimal integers to sign-and-magnitude with 8-bit allocationa. 45b. -78 7. One method of representing signed numbers in a computer is one’s complement representation. In this representation, to represent a positive number, we store the binary number. To represent a negative number, we apply the one’s comple- ment operation…

Coordinates : A(2,0) B(2,2) C(2,5) D(0,5) E(0,2) F(0,0) Assume a custom Q6 isoparametric. Compute N, J11, J21, B in isoparametric format. (1)

6 - What decimal number does the bit pattern 0xC3300000 represent if it is: A two's complement integer? An unsigned integer? A floating point number assuming the IEE 754 single precision format 7 - Perform the following calculations assuming that the values are 4-bit decimal integers stored in two's complement format. Be sure to consider the possibility of overflow. 0110 + 1001 0110 - 1001 8 - For the following operations: write the operands as 2's complement binary numbers then perform the addition or subtraction operation shown. Show all work in binary operating on 4-bit numbers. 1+2 2-1 1-2

Q3 aciq

This is computer architecture! PLEASE HELP ME FIX THE CODE AS THERE IS ERROR! # This program corrects bad data using Hamming codes # It requests the user to enter a 12-bit Hamming code and determines if it is correct or not # If correct, it displays a message to that effect. If incorrect, it displays a message # saying it was incorrect and what the correct data is (the 12-bit Hamming code) again in hex. # This program is designed to handle single bit errors only.   .data prompt: .asciiz "Enter a 12-bit Hamming code: " correct_msg: .asciiz "The Hamming code is correct." incorrect_msg: .asciiz "The Hamming code is incorrect. The correct code is: " newline: .asciiz "\n"   .text .globl main   main:     # Display prompt to enter Hamming code     li $v0, 4     la $a0, prompt     syscall          # Read Hamming code from user     li $v0, 5     syscall     move $t0, $v0          # Calculate parity bits     andi $t1, $t0, 0b1111 # Parity bit p1     andi $t2, $t0, 0b011001100110 # Parity bit p2…

1. bitwise operators Compute the answer of each calculation and report the answer in decimal: 0303 | Ox124 = Ob11011010 ^ 57 = -29 & OXFE = (127 & -OX7F) | 233291 =

CONVERTING FROM BIG ENDIAN TO LITTLE ENDIAN Write a program that uses the variables below and MOv instructions to copy the value from bigEndian to littleEndian, reversing the order of the bytes. The number's 32-bit value is understood to be 12345678 hexadecimal. .data bigEndian BYTE 12h,34h, 56h, 78h littleEndian DWORD? Hint: Using DumpMem is the best way to show the effect - byte orders "before" and "after" Sample output: DumpMem output showing Big Endian Byte Order Dump of offset 001E6000 12 34 56 78 DumpMem output showing Little Endian Byte Order Dump of offset 001E6004 78 56 34 12

Q1 PART 1 There are several bitwise operators to help manipulate bits: · & - Operates on the corresponding bits of two strings of bits. The result is a 1 if both bits were 1, O if not. •|- Operates on the corresponding bits of two strings of bits. The result is a 1 if either bit was 1, O if not. .^ - Operates on the corresponding bits of two strings of bits. The result is a 1 if only one bit was 1, 0 if not. .» (number) - Operates on one string of bits. Shifts all bits to the right equivalent to the number provided. .< (number) - Operates on one string of bits. Shifts all bits to the left equivalent to the number provided. .N- Operates on one string of bits. Inverses all of the bits. Consider variable string1 = Ox12345678 and variable mask = OxC Fill in the missing value (???) by inputting what it should be in the Solutions boxes adjacent to the respective Task below. Each Task is distinct so earlier tasks have no bearing on the following ones (updating string1 will only be for that…

TMin - 1 (write in decimal representation): -TMin: -TMax: TMAX> A

Which of the following bitwise operations will you use to set a particular bit to 1?a) ORb) ANDc) XORd) NOR

When the result of an operation is negative, the following flag should be set to one Select one: a. Sign flag b. Carry flag c. Zero flag d. Parity flag <

Q2:A :: Find the final result of the following arithmetic operation :- ( 111101 + 11101 - 10101 )

Q1- c) Several ID Automation products support the inclusion of the Application Identifier(Al) with ASCII 202 in Code 128 auto mode.(ASCII-128 characters).Each Al is represented by 125 characters, calculate: i. The number of bits required per character. ii. The number of bits required to represent each Al. iii. If an additional parity bit is added for error detection purpose to the code of each character. Modify your answers to parts i) and ii) in view of this.

Q5:: Determine I, V,, V2 , and Vo for this configuration in figure beside, when E=12V, and E;-8V. (10) Marks + V, - R E, o M 4.7 k2 Si R2 2.2 k2

ADD CD, [BC+RI] This expression belongs to which addressing mode and how it works b) ADD AD, [SE+OI] This expression belongs to which addressing mode and how it works

Say what the following code does? Start: LDA 0300H CMA AD1 - 01H END: STA 0300H

Which of the following bitwise operations will you use to set a particular bit to 0?a) ORb) ANDc) XORd) NAND

Ans only c

12. Assume that the value is a 8 bit unsigned integer, and that another is XORed with the original value. What will the new decimal value be after the operation? The first row has been filled in. Be careful, the devil is in the details. Value 13 83 250 Operation e Operand value 2 5 7 New value 15

A PLI program has variables U, V, w, X, Y, Z which are declared as follows: DCL U BIT(4) W CHAR(5) Y CHAR(3) V FIXED (4,1). X FLOAT(4), Z FIXED(3): The Data Card for the same program contains the following information: U ='1101'B, V = 981-2; U='1101'B, V= 123•4, W = '123•4', X= 1052E + 02, Y= 'PQR', Z=- 249; a) Show what will be entered into memory storage in the computer as a result of the statements: GET DATA; followed a little later in the program by the statement: GET DATA(Z,V,W,YU,X); b) In the same program at a later stage, the contents of the memory locations corresponding to U, V, W, X, Y and Z were changed to 0100 769.2 144.7 •0129E – 03 BOG - 47 respectively. Show what will be printed out by the following statements: PUT DATA(U,Y); PUT SKIP DATA(X): PUT SKIP DATA(W,V,Z);