Problems :1.1 Convert to octal then to binary:a. (757.25)ho b. (123.17)10c. (356.89)10d. (1063.5)101.2 Convert to octal and then to decimal:a.(10111011.1),1.3 Add, subtract and multiply in binary:a. 1111 and 1011 b. 1001001and 111010 c. 110100 and 11011b.(1101101.011); c.(10000011.11);1.4 Convert to base 5: (165.2),(do all of the arithmetic in decimal)1.5 a. Convert to hexadecimal: (701.12)10b. Convert to decimal: (ABC.D)16c. Device a scheme for converting hexadecimal directly to base 4 andconvert the previous hexadecimal number to base 4.

Name: Problems :1.1 Convert to octal then to binary:a. (757.25)ho b. (123.1
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Problems :1.1 Convert to octal then to binary:a. (757.25)ho b. (123.17)10c. (356.89)10d. (1063.5)101.2 Convert to octal and then to decimal:a.(10111011.1),1.3 Add, subtract and multiply in binary:a. 1111 and 1011 b. 1001001and 111010 c. 110100 and 1

“Since you have asked multiple question, we will solve the first question for you. If you want any…

Answered: 1.1 Convert to octal then to binary: a.…

Engineering

Computer Science

1.1 Convert to octal then to binary: a. (757.25)10 b. (123.17)10 c. (356.89)10 d. (1063.5)10

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

a) Consider the (7,4) hamming code with data word 1111 and evaluate the 7-bt composite code word (use even parity). b) Assume the stored composite code from memory is 1010001. Evaluate the parity bits of the stored code, find the bit position in error, and correct it if it is correctable (use even parity).
2. (a) What is a single error and burst error? Explain with an example. (b) Find the Hamming code of the following bitstream using even parity. 11011111010111010101110111000010
Let's Assume, X=224A0000 and Y=336B0000 are two Hex numbers. Using IEEE-754 floating point arithmetic perform the below calculations and give the answers in decimal: Y What is the Bias exponent of X? What is actual exponent of X? What is the Bias exponent of Y? What is actual exponent of y? Now, what would be the value of X+Y in decimal? Consider two decimal points of the final results after rounding-up. A sample answer: 4.23*10^3When you are typing the '*' symbol in the input field, it will appear as a '·' symbol.
a. Assume (F43)(16) and (1B7)(16) are unsigned 12-bit Hexadecimal integers.CalculateF43 -1B7. Is there overflow?b. Assume 185 and 122 are unsigned 8-bit decimal integers. Calculate185 - 122. Is there overflow?c. Calculate (1100 1101)2 + (1100 10101)2
Assume x goes to $s0, y goes to $s1, and z goes to $s2. Convert the following MIPS code to C. addi $s1, $s2, -3
3. A cyclic redundancy check (CRC) is an error-detecting code commonly used in digital networks and storage devices to detect accidental changes to raw data. Propose your own Roll as data bits (e.g roll 1 to 100) and show how the sender adds the parity bits and write the final code word that will be sent. Value of Key is 1011 (derived from polynomial function). Also show in the receiver side that the correct data is received.
It is necessary to formulate the Hamming code for four data bits, D3, D5, D6, and D7, together with three parity bits, P1, P2, and P4.1. Evaluate the 7-bit composite code word for the data word 0010.2. Evaluate three check bits, C4, C2, and C1, assuming no error.3. Assume an error in bit D5 during writing into memory. Show how the error in the bit is detected and corrected.4. Add parity bit P8 to include double-error detection in the code. Assume that errors occurred in bits P2 and D5. Show how the double error is detected.
1. Assume numbers are represented in 8-bit two's complement Show the calculation of the following: a) 5 + 10 b) 5 – 10 c) -5 + 10 d)-5 – 10 2. Represent the following decimal numbers or values according to the given requirements: a) +4 in both binary sign/magnitude and two's complement b) -6 in both binary sign/magnitude and two's complement c) -85 in two's complement d) +52 in two's complement 3. Find the following differences using twos complement arithmetic: a) 001000 – 110111 b) 10100101 – 011110 c) 100100001011 – 101010110011 d) 10011011 – 10100101
7. Add the following two 8-bit binary numbers, producing an 8-bit result. Indicate the status of the carry and overflow bits at the end of the addition by circling the appropriate choices. The space in between is only for readability. 1101 0110 + 1001 0111 -------------- Overflow? Yes or No Carry? Yes or No
Show Steps Please 21. Suppose we want an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 10. a) How many parity bits are necessary? b) Assuming we are using the Hamming algorithm presented in this chapter to design our error-correcting code, find the code word to represent the 10-bit information word: 1001100110. 22. Using the CRC polynomial 1101, compute the CRC code word for the information word, 01001101. Check the division performed at the receiver.
Please use C++ to solve the listed problems in one code 1). Decrypt the following: “DY CVOOZ ZOBMRKXMO DY NBOKW” 2). Convert 890 to base 9. 3). Determine if the bits of 1100010 is correct or not by using Hamming Code Detection method. If not, detect which bit is incorrect and print out the decimal format of the message that was sent after the correction 4). Universal Set: [A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T] Set A: [A, B, C, E, H, M] Set B: [A, C, E, G, I, K, M, O, Q, S] Set C: [A, B, C, E, G, K, M, Q, S] Please print out: ((A Union B) Intersect C) 5). Present a Truth Table for the following statement: !(A XOR B) NAND (A OR C) Please provide the code and a screenshot of output
For problems 8, 9 and 10, convert the following decimal numbers into 8‑bit binary numbers as required for 2's complement math, and perform the indicated operations. Circle or bold your binary answer and show your work. 8‑bit binary 2's complement 8 Bits 7 6 5 4 3 2 1 0 21 22 21+22 9 21 -22 21-22 10 -21 22 -21+22