A. Add the two pairs of binary numbers X = 00101 and Y = 10111and show the results in binary. (Be sure to show the carry as you add.) Let us the call the result Z = X+Y. Carries 0010 1 (X) + 10111 (Y) (Z) B. Convert the binary integer 1010101011 to decimal. C. Convert decimal integer 1393 to binary. Show all your work, quotients, and remainders, and then write down the answer.

A. Add the two pairs of binary numbers X = 00101 and Y = 10111and show the results in binary. (Be sure to show the carry as you add.) Let us the call the result Z = X+Y. Carries 0010 1 (X) + 10111 (Y) (Z) B. Convert the binary integer 1010101011 to decimal. C. Convert decimal integer 1393 to binary. Show all your work, quotients, and remainders, and then write down the answer.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

On the planet Tatooine, droids do computations in base-6. What is the greatest base-6 number with three different digits? (Your base-6 number must have a separate digit for each digit.) Make a decimal out of your answer (base-10).
Write the symbol used in the following language of mathematics: 1. The complement of the complement of A 2. The set of rational numbers 3. The Cartesian product of B and C 4. 3 is an integer 5. The value of y ranges from -4 to 5 6. The square of a number is positive 7. J belongs to both sets A and B 8. Point A's distance from D is equal to point B's distance from D
A and B are two unsigned 32 bits numbers. Compare the values of A and B and write if 1. A>B or 2. A
Consider the following code which includes a parity check for the third digit: C=(000,011,101,110). You get the third digit by adding the first two and then using the remainder on division by 2. Can this code detect and count single errors? how can this be implemented?
Implement the following Boolean function using a multiplexer. Use A, C and D as the select lines, where A is the MSB and D is the LSB. Answer the following questions. Include a systematic solution for you answer, if applicable. 1. Which of the following inputs are not connected to the ground? A. I0 B. I2C. I5D. More than one of the choicesE. None2. Which of the following inputs are connected to the complement of B?A. I0B. I4C. I7D. More than one of the choicesE. None 3. Which of the following inputs are connected to +5V or Vcc?A. I0B. I4C. I6D. More than one of the choicesE. None 4. What is the output when A=1, B=0, C=0 and D=1? A. +5VB. 0VC. B'D. More than one of the choicesE. None
Perform each of the below computation using IEEE-754 single precision representation. [Method: Convert both the given decimal values to IEEE-754 single precision representation. Perform IEEE-754 computation and write the result in hexadecimal. Convert the IEEE-754 single precision hexadecimal result back to decimal value]. Clearly show all the steps. I a. 3.375 + 7.25 = b. 3.375 – 7.25 =
Implement the following Boolean function using a multiplexer. Use A, C and D as the select lines, where A is the MSB and D is the LSB. Answer the following questions. Include a systematic solution for you answer, if applicable.1. Which of the following inputs are not connected to the ground?A. I2B. I5C. I6D. More than one of the choicesE. None 2. Which of the following inputs are connected to B?A. I0B. I1C. I3D. More than one of the choicesE. None 3. Which of the following inputs are connected to +5V or Vcc?A. I3B. I4C. I7D. More than one of the choicesE. None 4. What is the output when A=1, B=0, C=1 and D=0?A. +5VB. 0VC. B’D. More than one of the choicesE. None
Given a positive integer, check whether it has alternating bits: namely, if two adjacent bits will always have different values. For example: Input: 5 Output: True because the binary representation of 5 is: 101. Input: 7 Output: False because the binary representation of 7 is: 111. Input: 11 Output: False because the binary representation of 11 is: 1011. Input: 10 Output: True because The binary representation of 10 is: 1010. """ # Time Complexity - O(number of bits in n) def has_alternative_bit(n): first_bit=0 second_bit=0 whilen: first_bit=n&1 ifn>>1:.
I am trying to get the range of bits from a number. For example , if I call bitRange(0x00001234, 0 , 4). I will get 0x00000004; 0x00001234 is the number i want to the range of bits from. 0 is the starting position. 4 is the number of bits to get from the number.
Convert the following. please show all work.
In MIPS assembly, implement integer division using rounding (rather than truncation). This is accomplished by taking the remainder of the division and dividing it by the original divisor. If the new quotient is higher than or equal to one, multiply it by one.Otherwise, leave the original quotient alone.In MIPS assembly, implement integer division using rounding (rather than truncation). This is accomplished by taking the remainder of the division and dividing it by the original divisor. If the new quotient is higher than or equal to one, multiply it by one.Otherwise, leave the original quotient alone.In MIPS assembly, implement integer division using rounding (rather than truncation). This is accomplished by taking the remainder of the division and dividing it by the original divisor. If the new quotient is higher than or equal to one, multiply it by one.Otherwise, leave the original quotient alone.In MIPS assembly, implement integer division using rounding (rather than truncation).…
Challenge: Use MIPS(MARS) to create a program that takes an 8-bit binary number and returns it as a binary-coded decimal (BCD).