Computers and Technology, 07.04.2020 18:35 mia5530

8. (P4) a. Suppose you have the following 2 bytes: 01011100 and 01100101. What is the 1s complement of the sum of these 2 bytes? b. Suppose you have the following 2 bytes: 11011010 and 01100101. What is the 1s complement of the sum of these 2 bytes? c. For the bytes in part (a), give an example where one bit is flipped in each of the 2 bytes and yet the 1s complement doesn’t change.

Answers: 1

Show answers

Answers

Answer from: dallisjuhnke

a) 00111110

b) 11000000

c) We get 00111110 when one bit is flipped in each of the 2 bytes and yet the 1s complement doesn’t change.

Explanation:

a) The sum of 01011100 and 01100101 is as indicated below:

01011100

+ 01100101

11000001

Therefore, the sum of these 2 bytes 01011100 and 01100101 equals 11000001.

Next we determine the 1s complement, this is usually obtained by reversing the bits i.e 1 to 0 and 0 to 1. Therefore, the 1s complement of 11000001 is 00111110.

Therefore, the 1s complement of the sum of these 2 bytes 01011100 and 01100101 equals 00111110.

b) The sum of 11011010 and 01100101 is as indicated below:

11011010

+ 01100101

00111111

The carry is ignored as we are dealing with 8 bits

Therefore, the sum of these 2 bytes 11011010 and 01100101 equals 00111111.

Next we determine the 1s complement, this is usually obtained by reversing the bits i.e 1 to 0 and 0 to 1. Therefore, the 1s complement of 00111111 is 11000000.

Therefore, the 1s complement of the sum of these 2 bytes 11011010 and 01100101 equals 11000000.

c) Using the 2 bytes in part (a)

The sum of 01011100 and 01100101 is as indicated below:

01011100

+ 01100101

11000001

Therefore, the sum of these 2 bytes 01011100 and 01100101 is 11000001.

The 1s complement of 11000001 is 00111110.

When the most significant bit is flipped 01011100 we get 11011100. We get 11100101 when the most significant bit of 01100101 is flipped.

Now we determine their sum:

11011100

+ 11100101

11000001

The carry is ignored as we are dealing with 8 bits

Therefore, the sum of these 2 bytes 11011100and 11100101 is 11000001.

The 1s complement of 11000001 is 00111110.

We can see that the 1s complement doesn’t change when one bit is flipped in each of the 2 bytes.

Answer from: Quest

it is a requirement to graduate high school where i live

Answer from: Quest

b and c ( ip address and port number)

Another question on Computers and Technology

Computers and Technology, 22.06.2019 01:00

)a grad student comes up with the following algorithm to sort an array a[1..n] that works by first sorting the first 2/3rds of the array, then sorting the last 2/3rds of the (resulting) array, and finally sorting the first 2/3rds of the new array. 1: function g-sort(a, n) . takes as input an array of n numbers, a[1..n] 2: g-sort-recurse(a, 1, n) 3: end function 4: function g-sort-recurse(a, `, u) 5: if u â’ ` â‰¤ 0 then 6: return . 1 or fewer elements already sorted 7: else if u â’ ` = 1 then . 2 elements 8: if a[u] < a[`] then . swap values 9: temp â† a[u] 10: a[u] â† a[`] 11: a[`] â† temp 12: end if 13: else . 3 or more elements 14: size â† u â’ ` + 1 15: twothirds â† d(2 â— size)/3e 16: g-sort-recurse(a, `, ` + twothirds â’ 1) 17: g-sort-recurse(a, u â’ twothirds + 1, u) 18: g-sort-recurse(a, `, ` + twothirds â’ 1) 19: end if 20: end function first (5 pts), prove that the algorithm correctly sorts the numbers in the array (in increasing order). after showing that it correctly sorts 1 and 2 element intervals, you may make the (incorrect) assumption that the number of elements being passed to g-sort-recurse is always a multiple of 3 to simplify the notation (and drop the floors/ceilings).

Answers: 3

Answer

Computers and Technology, 22.06.2019 15:30

What is a costume plot? why is it important to a film or theater production?

Answers: 2

Answer

Computers and Technology, 22.06.2019 20:50

What is the difference between windows 7 and windows 10?

Answers: 1

Answer

Computers and Technology, 22.06.2019 21:30

How do you take a green screen out of the video while editing?