a. If the last operation performed on a computer with an 8-bit word was an addition in which the two operands were 00000010 and 00000011, what would be the value of the following flags? • Carry • Zero • Overflow Sign • Even Parity • Half-Carry b. Repeat for the addition of -1 (twos complement) and +1.

a. If the last operation performed on a computer with an 8-bit word was an addition in which the two operands were 00000010 and 00000011, what would be the value of the following flags? • Carry • Zero • Overflow Sign • Even Parity • Half-Carry b. Repeat for the addition of -1 (twos complement) and +1.

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

We can perform logical operations on strings of bits by considering each pair of corresponding bits separately (called bitwise operation). Given two eight-bit strings A = 10110001 and B = 10101100 , evaluate the eight-bit result after the following logical operations: XOR
1. Write a C++ program that takes two binary numbers of 8 bits eachrepresented with the letters Z and O (for zero or one) and displays thesum in binary with Zs and Os. Do this by converting the numbers to ints,adding the its using +, displaying the 3 ints, then converting the sum toZ and Os and displaying the result. 1 a.) Redo number 1, by doing a bit-by-bit addition, not forgetting the carry. 1b.) Write a program to take two numbers represented with romannumerals and display the sum. Assume the sum will be less than 20.Hints: Ask the user to terminate each number with a semicolon and usechars to hold the roman ‘digits’.The numbers are I, II, III IV, V, VI, VII, VIII, IX, X, XI, XII, XIII, XIV, XV…isfive, Change the program to allow the sum to go up to 49 See how large a number you can handle. L is 50, C is 100, M is 1000. Using basic C++ int, char, if- else statements, and switch statements, please! no functions, or strings, or Cmath etc.
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?
Write a MIPS procedure that takes as its three parameters the address of a zero-terminated string, a character c, and an integer n, and returns the number of distinct runs of consecutive instances of c in the string that are of length at least n. Also, write a simple main program to test your procedure. Your main program should input a string from the user (you may assume that the string has at most 20 characters), input the character and the integer, invoke your procedure, output the return value, and then terminate. For example, given the inputs “bbabbbbagbgbb”, “b”, and 2, the output should be 3. Your code must use the “standard” conventions covered in class for passing parameters and returning results. code in mips
Show Steps Please 5. Compute the Hamming distance of the following code: 0011010010111100 0000011110001111 0010010110101101 0001011010011110 6. Suppose we are given the following subset of codewords, created for a 7-bit memory word with one parity bit: 11100110, 00001000, 10101011, and 11111110. Does this code use even or odd parity? Explain. 7. Given that the ASCII code for A is 1000001, what is the ASCII code for J? b. Given that the EBCDIC code for A is 1100 0001, what is the EBCDIC code for J? 8. Decode the following ASCII message, assuming 7-bit ASCII characters and no parity: 1001010 1001111 1001000 1001110 0100000 1000100 1001111 1000101
Show Steps Please 20. Suppose we have just found yet another representation for floating point numbers. Using thisrepresentation, a 12-bit floating point number has 1 bit for the sign of the number, 4 bits forthe exponent and 7 bits for the mantissa, which is normalized as in the Simple Model so thatthe first digit to the right of the radix points must be a 1. Numbers in the exponent are in signed2's complement representation. No bias is used and there are no implied bits. Show therepresentation for the smallest positive number this machine can represent using the followingformat (simply fill in the squares provided). What decimal number does this equate to?
We can perform logical operations on strings of bits by considering each pair of corresponding bits separately (called bitwise operation). Given two eight-bit strings A = 10110001 and B = 10101100 , evaluate the eight-bit result after the following logical operations: OR
Compute the weakest precondition for each of the following assignmentstatements and postconditions:1. a = 2 * (b - 1) - 1 {a > 0}2. b = (c + 10) / 3 {b > 6}3. a = a + 2 * b - 1 {a > 1}4. x = 2 * y + x - 1 {x > 11}
Consider a 6-bit two’s complement representation. Fill in the box with question mark "?" in the following table. You don't need to care about "n/a." Number Binary Representation TMin + TMin ? Please input the binary representation in this format xxxxxx. For example, if the answer is 010010, please input 010010.
In a Digital Logic examination, you are given two signed integers in different number systems. A= (64)16 B= -(103)8Determine their values in the decimal system AN, b) Find the value of n, the shortest word-length of a computer using two’s complement representation which can represent all these numbers. Find the largest and thesmallest numbers that can be represented. c) Give the n-bit two’s complement representations of the two numbers, where n isvalue determined in b.
Consider the following floating point representation where each number has 2exponent bits and 5 fraction bits. The exponent bias is 1. Round each number tohave 3 fraction bits. Apply round-to-even and round-toward-zero modes.a. 1 10 11100b. 0 00 00101c. 1 01 10101i. Can you see a pattern for rounding floating point numbers when thenumber of exponent bits are intact?
A binary code is a string of 0's and 1's. In particular, an n-bit binary code is a string of "n" 0's and 1's. For example, the code "01001" is a 5-bit binary code. How many 5-bit binary codes can be formed?